./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 d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/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_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB --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.3.0-dev-d790fec [2024-11-27 20:08:31,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:08:31,501 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-27 20:08:31,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:08:31,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:08:31,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:08:31,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:08:31,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:08:31,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:08:31,551 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:08:31,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:08:31,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:08:31,552 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:08:31,552 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-27 20:08:31,552 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-27 20:08:31,552 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-27 20:08:31,553 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-27 20:08:31,553 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-27 20:08:31,553 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-27 20:08:31,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:08:31,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-27 20:08:31,553 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:08:31,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:08:31,553 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:08:31,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:08:31,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-27 20:08:31,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-27 20:08:31,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-27 20:08:31,555 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:08:31,555 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:08:31,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:08:31,555 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-27 20:08:31,555 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:08:31,556 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:08:31,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:08:31,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:08:31,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:08:31,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM [2024-11-27 20:08:31,557 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-27 20:08:31,557 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB 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 [2024-11-27 20:08:31,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:08:31,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:08:31,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:08:31,928 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:08:31,929 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:08:31,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2024-11-27 20:08:35,338 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/data/e0456ff0d/7a707e998d3f4d4dbf4e6c9a0a553a55/FLAG8abdb8708 [2024-11-27 20:08:35,737 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:08:35,738 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2024-11-27 20:08:35,764 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/data/e0456ff0d/7a707e998d3f4d4dbf4e6c9a0a553a55/FLAG8abdb8708 [2024-11-27 20:08:35,825 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/data/e0456ff0d/7a707e998d3f4d4dbf4e6c9a0a553a55 [2024-11-27 20:08:35,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:08:35,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:08:35,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:08:35,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:08:35,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:08:35,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:08:35" (1/1) ... [2024-11-27 20:08:35,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53bd0573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:35, skipping insertion in model container [2024-11-27 20:08:35,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:08:35" (1/1) ... [2024-11-27 20:08:35,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:08:36,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:08:36,089 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:08:36,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:08:36,133 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:08:36,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:36 WrapperNode [2024-11-27 20:08:36,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:08:36,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:08:36,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:08:36,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:08:36,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:36" (1/1) ... [2024-11-27 20:08:36,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:36" (1/1) ... [2024-11-27 20:08:36,184 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-11-27 20:08:36,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:08:36,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:08:36,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:08:36,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:08:36,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:36" (1/1) ... [2024-11-27 20:08:36,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:36" (1/1) ... [2024-11-27 20:08:36,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:36" (1/1) ... [2024-11-27 20:08:36,238 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]. [2024-11-27 20:08:36,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:36" (1/1) ... [2024-11-27 20:08:36,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:36" (1/1) ... [2024-11-27 20:08:36,247 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:36" (1/1) ... [2024-11-27 20:08:36,248 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:36" (1/1) ... [2024-11-27 20:08:36,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:36" (1/1) ... [2024-11-27 20:08:36,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:36" (1/1) ... [2024-11-27 20:08:36,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:36" (1/1) ... [2024-11-27 20:08:36,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:08:36,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:08:36,258 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:08:36,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:08:36,259 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:36" (1/1) ... [2024-11-27 20:08:36,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:08:36,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:36,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:08:36,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-27 20:08:36,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:08:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:08:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-27 20:08:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-27 20:08:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-27 20:08:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-27 20:08:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 20:08:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 20:08:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 20:08:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-27 20:08:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-27 20:08:36,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-27 20:08:36,357 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-11-27 20:08:36,357 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-11-27 20:08:36,357 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-11-27 20:08:36,358 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-11-27 20:08:36,358 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2024-11-27 20:08:36,358 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2024-11-27 20:08:36,358 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2024-11-27 20:08:36,358 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2024-11-27 20:08:36,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:08:36,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:08:36,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 20:08:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 20:08:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-27 20:08:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-27 20:08:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-27 20:08:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 20:08:36,515 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:08:36,519 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:08:36,859 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-27 20:08:36,859 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:08:36,874 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:08:36,876 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 20:08:36,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:08:36 BoogieIcfgContainer [2024-11-27 20:08:36,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:08:36,878 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-27 20:08:36,878 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-27 20:08:36,886 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-27 20:08:36,887 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-27 20:08:36,887 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.11 08:08:35" (1/3) ... [2024-11-27 20:08:36,888 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61b52475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.11 08:08:36, skipping insertion in model container [2024-11-27 20:08:36,889 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-27 20:08:36,889 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:36" (2/3) ... [2024-11-27 20:08:36,889 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61b52475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.11 08:08:36, skipping insertion in model container [2024-11-27 20:08:36,889 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-27 20:08:36,890 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:08:36" (3/3) ... [2024-11-27 20:08:36,891 INFO L363 chiAutomizerObserver]: Analyzing ICFG recursified_nested_4.c [2024-11-27 20:08:36,972 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-27 20:08:36,972 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-27 20:08:36,972 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-27 20:08:36,972 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-27 20:08:36,972 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-27 20:08:36,972 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-27 20:08:36,973 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-27 20:08:36,973 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-27 20:08:36,982 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) [2024-11-27 20:08:37,011 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:08:37,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:08:37,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:08:37,020 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-27 20:08:37,020 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:37,020 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-27 20:08:37,021 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) [2024-11-27 20:08:37,024 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:08:37,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:08:37,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:08:37,025 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-27 20:08:37,025 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:37,034 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call 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#4(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-27 20:08:37,035 INFO L749 eck$LassoCheckResult]: Loop: "~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#4(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#88#return;" "call #t~mem14 := read~int#4(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< [2024-11-27 20:08:37,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:37,042 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 1 times [2024-11-27 20:08:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:08:37,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975667302] [2024-11-27 20:08:37,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:08:37,218 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:08:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:08:37,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:08:37,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:37,306 INFO L85 PathProgramCache]: Analyzing trace with hash -448633028, now seen corresponding path program 1 times [2024-11-27 20:08:37,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:08:37,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448230943] [2024-11-27 20:08:37,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:37,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:37,876 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:38,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:08:38,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448230943] [2024-11-27 20:08:38,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448230943] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:38,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556213535] [2024-11-27 20:08:38,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:38,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:38,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:38,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:38,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:08:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:38,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-27 20:08:38,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:38,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:08:38,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:08:38,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556213535] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:08:38,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:08:38,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-27 20:08:38,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113984145] [2024-11-27 20:08:38,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:08:38,685 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:08:38,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:08:38,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-27 20:08:38,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-27 20:08:38,725 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 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-27 20:08:39,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:39,123 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2024-11-27 20:08:39,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 61 transitions. [2024-11-27 20:08:39,130 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:08:39,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 33 states and 41 transitions. [2024-11-27 20:08:39,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-27 20:08:39,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-27 20:08:39,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2024-11-27 20:08:39,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:08:39,150 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-27 20:08:39,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2024-11-27 20:08:39,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-11-27 20:08:39,180 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) [2024-11-27 20:08:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-27 20:08:39,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-27 20:08:39,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:08:39,191 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-27 20:08:39,192 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-27 20:08:39,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2024-11-27 20:08:39,193 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:08:39,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:08:39,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:08:39,194 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-27 20:08:39,194 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:39,194 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call 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#4(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-27 20:08:39,194 INFO L749 eck$LassoCheckResult]: Loop: "~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#4(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#86#return;" "assume true;" >"#88#return;" "call #t~mem14 := read~int#4(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< [2024-11-27 20:08:39,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:39,195 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 2 times [2024-11-27 20:08:39,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:08:39,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982659639] [2024-11-27 20:08:39,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:39,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:08:39,232 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:08:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:08:39,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:08:39,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:39,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1860565822, now seen corresponding path program 1 times [2024-11-27 20:08:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:08:39,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342960574] [2024-11-27 20:08:39,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:39,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:39,610 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:39,829 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:39,932 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:08:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:39,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:08:39,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342960574] [2024-11-27 20:08:39,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342960574] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:39,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286830001] [2024-11-27 20:08:39,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:39,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:39,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:39,946 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:39,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:08:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:40,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-27 20:08:40,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:40,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 20:08:40,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:08:40,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286830001] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:08:40,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:08:40,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2024-11-27 20:08:40,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759211651] [2024-11-27 20:08:40,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:08:40,495 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:08:40,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:08:40,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-27 20:08:40,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-27 20:08:40,496 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (6), 1 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-27 20:08:40,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:40,810 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-11-27 20:08:40,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2024-11-27 20:08:40,812 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:08:40,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2024-11-27 20:08:40,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-27 20:08:40,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2024-11-27 20:08:40,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2024-11-27 20:08:40,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:08:40,817 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-27 20:08:40,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2024-11-27 20:08:40,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-11-27 20:08:40,824 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) [2024-11-27 20:08:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-27 20:08:40,826 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-27 20:08:40,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:08:40,827 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-27 20:08:40,827 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-27 20:08:40,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2024-11-27 20:08:40,828 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:08:40,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:08:40,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:08:40,829 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-27 20:08:40,829 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] [2024-11-27 20:08:40,830 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call 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#4(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-27 20:08:40,830 INFO L749 eck$LassoCheckResult]: Loop: "~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#4(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#86#return;" "assume true;" >"#88#return;" "call #t~mem14 := read~int#4(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< [2024-11-27 20:08:40,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 3 times [2024-11-27 20:08:40,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:08:40,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491254180] [2024-11-27 20:08:40,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:40,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:08:40,858 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:08:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:08:40,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:08:40,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1780666575, now seen corresponding path program 1 times [2024-11-27 20:08:40,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:08:40,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752661259] [2024-11-27 20:08:40,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:40,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:41,184 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:41,397 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:41,549 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:41,633 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-27 20:08:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:41,638 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-27 20:08:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:41,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:08:41,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752661259] [2024-11-27 20:08:41,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752661259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:41,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604931714] [2024-11-27 20:08:41,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:41,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:41,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:41,649 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:41,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:08:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:41,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-27 20:08:41,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:41,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 20:08:42,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:08:43,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604931714] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:08:43,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:08:43,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 23 [2024-11-27 20:08:43,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474840615] [2024-11-27 20:08:43,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:08:43,049 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:08:43,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:08:43,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-27 20:08:43,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2024-11-27 20:08:43,050 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand has 23 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 9 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 5 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-27 20:08:43,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:43,626 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-11-27 20:08:43,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2024-11-27 20:08:43,627 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:08:43,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 41 transitions. [2024-11-27 20:08:43,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2024-11-27 20:08:43,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2024-11-27 20:08:43,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2024-11-27 20:08:43,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:08:43,630 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-27 20:08:43,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2024-11-27 20:08:43,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-27 20:08:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.15) internal successors, (23), 23 states have internal predecessors, (23), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-27 20:08:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-27 20:08:43,635 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-27 20:08:43,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:08:43,637 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-27 20:08:43,637 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-27 20:08:43,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2024-11-27 20:08:43,638 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:08:43,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:08:43,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:08:43,640 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-27 20:08:43,640 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:43,640 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call 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#4(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-27 20:08:43,641 INFO L749 eck$LassoCheckResult]: Loop: "~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#4(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#86#return;" "assume true;" >"#88#return;" "call #t~mem14 := read~int#4(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< [2024-11-27 20:08:43,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:43,641 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 4 times [2024-11-27 20:08:43,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:08:43,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720491248] [2024-11-27 20:08:43,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:43,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:08:43,658 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:08:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:08:43,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:08:43,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:43,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1262581502, now seen corresponding path program 1 times [2024-11-27 20:08:43,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:08:43,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551133992] [2024-11-27 20:08:43,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:43,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:44,109 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:44,535 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:44,852 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:45,019 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:45,087 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:08:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:45,104 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:45,110 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:45,114 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-27 20:08:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:45,120 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-27 20:08:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:45,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:08:45,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551133992] [2024-11-27 20:08:45,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551133992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:45,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681959596] [2024-11-27 20:08:45,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:45,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:45,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:45,131 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:45,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:08:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:45,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-27 20:08:45,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:45,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:08:45,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:08:46,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681959596] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:08:46,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:08:46,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 23 [2024-11-27 20:08:46,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171688155] [2024-11-27 20:08:46,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:08:46,531 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:08:46,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:08:46,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-27 20:08:46,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-11-27 20:08:46,533 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. cyclomatic complexity: 10 Second operand has 23 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 7 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (17), 5 states have call predecessors, (17), 7 states have call successors, (17) [2024-11-27 20:08:46,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:46,989 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-11-27 20:08:46,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 45 transitions. [2024-11-27 20:08:46,991 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:08:46,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 45 transitions. [2024-11-27 20:08:46,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-11-27 20:08:46,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2024-11-27 20:08:46,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 45 transitions. [2024-11-27 20:08:46,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:08:46,993 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-11-27 20:08:46,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 45 transitions. [2024-11-27 20:08:46,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-27 20:08:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 25 states have internal predecessors, (25), 8 states have call successors, (8), 4 states have call predecessors, (8), 9 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-27 20:08:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-11-27 20:08:46,998 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-11-27 20:08:46,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 20:08:46,999 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-11-27 20:08:47,000 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-27 20:08:47,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2024-11-27 20:08:47,001 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:08:47,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:08:47,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:08:47,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-27 20:08:47,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:47,004 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call 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#4(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-27 20:08:47,004 INFO L749 eck$LassoCheckResult]: Loop: "~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#4(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#86#return;" "assume true;" >"#88#return;" "call #t~mem14 := read~int#4(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< [2024-11-27 20:08:47,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:47,004 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 5 times [2024-11-27 20:08:47,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:08:47,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062100804] [2024-11-27 20:08:47,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:47,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:08:47,020 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:08:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:08:47,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:08:47,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:47,030 INFO L85 PathProgramCache]: Analyzing trace with hash -61660086, now seen corresponding path program 2 times [2024-11-27 20:08:47,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:08:47,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832621679] [2024-11-27 20:08:47,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:47,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:47,904 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:48,586 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:49,053 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:49,323 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:49,558 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:49,677 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:49,738 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:08:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:49,757 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:49,769 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:49,778 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:49,784 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:49,788 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-27 20:08:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:49,792 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-27 20:08:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:49,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:08:49,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832621679] [2024-11-27 20:08:49,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832621679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:49,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225650309] [2024-11-27 20:08:49,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:49,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:49,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:49,802 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:49,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:08:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:50,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-27 20:08:50,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:50,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:08:50,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:08:53,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225650309] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:08:53,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:08:53,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 18] total 38 [2024-11-27 20:08:53,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021775992] [2024-11-27 20:08:53,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:08:53,657 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:08:53,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:08:53,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-27 20:08:53,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1163, Unknown=0, NotChecked=0, Total=1406 [2024-11-27 20:08:53,661 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. cyclomatic complexity: 10 Second operand has 38 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 31 states have internal predecessors, (62), 13 states have call successors, (29), 9 states have call predecessors, (29), 11 states have return successors, (25), 10 states have call predecessors, (25), 13 states have call successors, (25) [2024-11-27 20:08:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:54,561 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-11-27 20:08:54,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 49 transitions. [2024-11-27 20:08:54,563 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:08:54,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 49 transitions. [2024-11-27 20:08:54,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2024-11-27 20:08:54,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2024-11-27 20:08:54,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 49 transitions. [2024-11-27 20:08:54,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:08:54,566 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-11-27 20:08:54,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 49 transitions. [2024-11-27 20:08:54,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-27 20:08:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.125) internal successors, (27), 27 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 11 states have return successors, (14), 11 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-27 20:08:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-11-27 20:08:54,571 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-11-27 20:08:54,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 20:08:54,572 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-11-27 20:08:54,572 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-27 20:08:54,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 49 transitions. [2024-11-27 20:08:54,573 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:08:54,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:08:54,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:08:54,576 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-27 20:08:54,576 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:54,577 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call 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#4(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-27 20:08:54,577 INFO L749 eck$LassoCheckResult]: Loop: "~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#4(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#86#return;" "assume true;" >"#88#return;" "call #t~mem14 := read~int#4(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< [2024-11-27 20:08:54,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:54,578 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 6 times [2024-11-27 20:08:54,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:08:54,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178402583] [2024-11-27 20:08:54,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:54,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:08:54,592 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:08:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:08:54,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:08:54,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:54,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1870118038, now seen corresponding path program 3 times [2024-11-27 20:08:54,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:08:54,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466266448] [2024-11-27 20:08:54,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:54,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:55,842 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:56,933 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:57,833 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:58,477 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:58,989 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:59,215 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:59,381 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:59,482 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:59,551 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:08:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:59,571 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:59,583 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:59,594 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:59,603 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:59,610 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:59,616 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:08:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:59,619 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-27 20:08:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:59,623 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-27 20:08:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:59,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:08:59,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466266448] [2024-11-27 20:08:59,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466266448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:59,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372857795] [2024-11-27 20:08:59,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:59,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:59,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:59,631 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:59,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 20:08:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:59,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-27 20:08:59,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:59,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:09:00,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:09:05,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372857795] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:09:05,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:09:05,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 26] total 45 [2024-11-27 20:09:05,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983748063] [2024-11-27 20:09:05,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:09:05,635 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:09:05,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:09:05,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-27 20:09:05,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=1595, Unknown=0, NotChecked=0, Total=1980 [2024-11-27 20:09:05,638 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. cyclomatic complexity: 10 Second operand has 45 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 36 states have internal predecessors, (64), 12 states have call successors, (27), 11 states have call predecessors, (27), 15 states have return successors, (28), 13 states have call predecessors, (28), 12 states have call successors, (28) [2024-11-27 20:09:06,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:06,457 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-11-27 20:09:06,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2024-11-27 20:09:06,458 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:09:06,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 51 transitions. [2024-11-27 20:09:06,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2024-11-27 20:09:06,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-11-27 20:09:06,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 51 transitions. [2024-11-27 20:09:06,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:09:06,461 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-11-27 20:09:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 51 transitions. [2024-11-27 20:09:06,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-27 20:09:06,465 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) [2024-11-27 20:09:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-11-27 20:09:06,467 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-11-27 20:09:06,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:09:06,468 INFO L425 stractBuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-11-27 20:09:06,468 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-27 20:09:06,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 51 transitions. [2024-11-27 20:09:06,470 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:09:06,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:09:06,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:09:06,473 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-27 20:09:06,473 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 12, 12, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:06,473 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call 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#4(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-27 20:09:06,473 INFO L749 eck$LassoCheckResult]: Loop: "~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#4(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#86#return;" "assume true;" >"#88#return;" "call #t~mem14 := read~int#4(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< [2024-11-27 20:09:06,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:06,474 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 7 times [2024-11-27 20:09:06,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:09:06,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547200980] [2024-11-27 20:09:06,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:06,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:09:06,490 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:09:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:09:06,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:09:06,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:06,500 INFO L85 PathProgramCache]: Analyzing trace with hash 174242606, now seen corresponding path program 4 times [2024-11-27 20:09:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:09:06,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088658848] [2024-11-27 20:09:06,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:06,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:07,161 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:07,771 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,230 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,255 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,266 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,276 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,284 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,290 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,295 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,298 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,514 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,540 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,553 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,565 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,574 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,583 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,589 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,595 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,658 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-27 20:09:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:09:08,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088658848] [2024-11-27 20:09:08,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088658848] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:09:08,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209282477] [2024-11-27 20:09:08,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:08,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:08,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:08,670 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:08,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 20:09:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:08,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-27 20:09:08,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:08,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 20:09:09,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:09:10,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209282477] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:09:10,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:09:10,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 27 [2024-11-27 20:09:10,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797557755] [2024-11-27 20:09:10,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:09:10,573 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:09:10,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:09:10,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-27 20:09:10,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2024-11-27 20:09:10,574 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. cyclomatic complexity: 10 Second operand has 27 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 11 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (16), 9 states have call predecessors, (16), 11 states have call successors, (16) [2024-11-27 20:09:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:10,986 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-11-27 20:09:10,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 53 transitions. [2024-11-27 20:09:10,987 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:09:10,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 53 transitions. [2024-11-27 20:09:10,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2024-11-27 20:09:10,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2024-11-27 20:09:10,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 53 transitions. [2024-11-27 20:09:10,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:09:10,990 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 53 transitions. [2024-11-27 20:09:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 53 transitions. [2024-11-27 20:09:10,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-27 20:09:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 29 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 13 states have return successors, (16), 13 states have call predecessors, (16), 6 states have call successors, (16) [2024-11-27 20:09:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2024-11-27 20:09:10,996 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 53 transitions. [2024-11-27 20:09:10,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:09:10,997 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 53 transitions. [2024-11-27 20:09:10,997 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-27 20:09:10,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 53 transitions. [2024-11-27 20:09:10,998 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:09:10,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:09:10,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:09:11,002 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-27 20:09:11,002 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:11,002 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call 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#4(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-27 20:09:11,003 INFO L749 eck$LassoCheckResult]: Loop: "~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#4(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#86#return;" "assume true;" >"#88#return;" "call #t~mem14 := read~int#4(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< [2024-11-27 20:09:11,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:11,003 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 8 times [2024-11-27 20:09:11,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:09:11,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41544343] [2024-11-27 20:09:11,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:11,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:09:11,017 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:09:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:09:11,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:09:11,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:11,026 INFO L85 PathProgramCache]: Analyzing trace with hash 844313427, now seen corresponding path program 5 times [2024-11-27 20:09:11,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:09:11,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082537009] [2024-11-27 20:09:11,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:11,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:12,098 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:13,114 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,003 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,026 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,036 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,046 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,054 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,060 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,065 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,068 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,511 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,534 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,549 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,563 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,576 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,584 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,588 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,595 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,833 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,860 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,871 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,881 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,890 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,898 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,903 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,906 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,960 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-27 20:09:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:14,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:09:14,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082537009] [2024-11-27 20:09:14,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082537009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:09:14,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540730566] [2024-11-27 20:09:14,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:14,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:14,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:14,975 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:14,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 20:09:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:15,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-27 20:09:15,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:15,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 20:09:15,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:09:17,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540730566] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:09:17,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:09:17,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 18] total 32 [2024-11-27 20:09:17,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018908293] [2024-11-27 20:09:17,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:09:17,834 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:09:17,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:09:17,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-27 20:09:17,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2024-11-27 20:09:17,836 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. cyclomatic complexity: 10 Second operand has 32 states, 25 states have (on average 1.84) internal successors, (46), 24 states have internal predecessors, (46), 13 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (20), 12 states have call predecessors, (20), 13 states have call successors, (20) [2024-11-27 20:09:18,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:18,315 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-11-27 20:09:18,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 55 transitions. [2024-11-27 20:09:18,316 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:09:18,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 55 transitions. [2024-11-27 20:09:18,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-27 20:09:18,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-11-27 20:09:18,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 55 transitions. [2024-11-27 20:09:18,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:09:18,319 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-27 20:09:18,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 55 transitions. [2024-11-27 20:09:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-27 20:09:18,323 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) [2024-11-27 20:09:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-11-27 20:09:18,324 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-27 20:09:18,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 20:09:18,329 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-11-27 20:09:18,329 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-27 20:09:18,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 55 transitions. [2024-11-27 20:09:18,330 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:09:18,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:09:18,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:09:18,334 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-27 20:09:18,334 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [28, 28, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:18,334 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call 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#4(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-27 20:09:18,334 INFO L749 eck$LassoCheckResult]: Loop: "~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#4(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#86#return;" "assume true;" >"#88#return;" "call #t~mem14 := read~int#4(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< [2024-11-27 20:09:18,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:18,335 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 9 times [2024-11-27 20:09:18,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:09:18,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263076315] [2024-11-27 20:09:18,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:18,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:09:18,354 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:09:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:09:18,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:09:18,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:18,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1212847330, now seen corresponding path program 6 times [2024-11-27 20:09:18,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:09:18,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277594570] [2024-11-27 20:09:18,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:18,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:19,582 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:20,902 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:22,158 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:22,175 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:22,185 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:22,194 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:22,201 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:22,205 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:22,208 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:22,210 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:22,954 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:22,976 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:22,988 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:22,996 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,004 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,010 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,014 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,017 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,442 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,464 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,474 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,483 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,490 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,496 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,500 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,503 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,723 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,745 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,755 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,764 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,771 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,777 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,781 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,784 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,838 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-27 20:09:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:23,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:09:23,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277594570] [2024-11-27 20:09:23,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277594570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:09:23,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611194590] [2024-11-27 20:09:23,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:23,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:23,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:23,848 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:23,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 20:09:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:24,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-27 20:09:24,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:24,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 20:09:24,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:09:27,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611194590] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:09:27,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:09:27,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 22] total 37 [2024-11-27 20:09:27,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094282426] [2024-11-27 20:09:27,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:09:27,730 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:09:27,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:09:27,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-27 20:09:27,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1076, Unknown=0, NotChecked=0, Total=1332 [2024-11-27 20:09:27,732 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. cyclomatic complexity: 10 Second operand has 37 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 28 states have internal predecessors, (51), 15 states have call successors, (23), 11 states have call predecessors, (23), 12 states have return successors, (24), 15 states have call predecessors, (24), 15 states have call successors, (24) [2024-11-27 20:09:28,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:28,191 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-11-27 20:09:28,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 57 transitions. [2024-11-27 20:09:28,192 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:09:28,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 57 transitions. [2024-11-27 20:09:28,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-11-27 20:09:28,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-11-27 20:09:28,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 57 transitions. [2024-11-27 20:09:28,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:09:28,194 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-27 20:09:28,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 57 transitions. [2024-11-27 20:09:28,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-27 20:09:28,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 31 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 15 states have return successors, (18), 15 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-27 20:09:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2024-11-27 20:09:28,200 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-27 20:09:28,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:09:28,204 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-27 20:09:28,204 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-27 20:09:28,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 57 transitions. [2024-11-27 20:09:28,205 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:09:28,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:09:28,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:09:28,209 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-27 20:09:28,210 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [35, 35, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:28,210 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call 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#4(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-27 20:09:28,210 INFO L749 eck$LassoCheckResult]: Loop: "~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#4(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#86#return;" "assume true;" >"#88#return;" "call #t~mem14 := read~int#4(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< [2024-11-27 20:09:28,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:28,211 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 10 times [2024-11-27 20:09:28,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:09:28,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915607111] [2024-11-27 20:09:28,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:28,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:09:28,223 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:09:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:09:28,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:09:28,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash 978444803, now seen corresponding path program 7 times [2024-11-27 20:09:28,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:09:28,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652049033] [2024-11-27 20:09:28,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:28,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:29,858 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:31,423 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:32,613 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:32,625 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:32,633 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:32,641 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:32,646 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:32,650 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:32,653 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:32,655 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:33,432 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:33,446 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:33,453 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:33,460 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:33,467 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:33,472 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:33,476 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:33,478 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,033 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,047 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,053 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,060 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,065 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,069 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,071 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,074 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,317 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,332 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,338 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,343 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,347 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,351 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,354 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,356 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,475 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,488 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,496 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,503 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,507 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,511 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,513 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,515 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,553 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-27 20:09:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:34,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:09:34,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652049033] [2024-11-27 20:09:34,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652049033] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:09:34,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808794505] [2024-11-27 20:09:34,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:34,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:34,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:34,561 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:34,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 20:09:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:35,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-27 20:09:35,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:35,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-27 20:09:35,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:09:38,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808794505] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:09:38,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:09:38,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 26] total 41 [2024-11-27 20:09:38,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278551731] [2024-11-27 20:09:38,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:09:38,908 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:09:38,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:09:38,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-27 20:09:38,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2024-11-27 20:09:38,909 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. cyclomatic complexity: 10 Second operand has 41 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 31 states have internal predecessors, (55), 16 states have call successors, (25), 12 states have call predecessors, (25), 14 states have return successors, (27), 18 states have call predecessors, (27), 16 states have call successors, (27) [2024-11-27 20:09:39,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:39,350 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2024-11-27 20:09:39,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 59 transitions. [2024-11-27 20:09:39,351 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:09:39,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 59 transitions. [2024-11-27 20:09:39,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2024-11-27 20:09:39,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-11-27 20:09:39,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 59 transitions. [2024-11-27 20:09:39,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:09:39,357 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-11-27 20:09:39,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 59 transitions. [2024-11-27 20:09:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-27 20:09:39,363 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) [2024-11-27 20:09:39,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-11-27 20:09:39,364 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-11-27 20:09:39,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 20:09:39,365 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-11-27 20:09:39,365 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-27 20:09:39,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 59 transitions. [2024-11-27 20:09:39,366 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:09:39,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:09:39,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:09:39,369 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-27 20:09:39,369 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:39,369 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call 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#4(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-27 20:09:39,369 INFO L749 eck$LassoCheckResult]: Loop: "~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#4(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#86#return;" "assume true;" >"#88#return;" "call #t~mem14 := read~int#4(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< [2024-11-27 20:09:39,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:39,370 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 11 times [2024-11-27 20:09:39,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:09:39,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516852317] [2024-11-27 20:09:39,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:39,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:09:39,382 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:09:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:09:39,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:09:39,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:39,392 INFO L85 PathProgramCache]: Analyzing trace with hash -618919154, now seen corresponding path program 8 times [2024-11-27 20:09:39,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:09:39,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101383116] [2024-11-27 20:09:39,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:39,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:40,043 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:40,993 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,157 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,167 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,176 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,183 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,189 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,194 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,197 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,199 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,264 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,274 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,283 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,291 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,297 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,302 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,306 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,309 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,357 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,367 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,376 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,383 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,389 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,394 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,398 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,400 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,435 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,446 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,455 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,462 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,469 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,474 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,478 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,481 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,507 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,518 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,528 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,537 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,544 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,549 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,553 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,556 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,579 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,591 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,602 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,611 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,620 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,626 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,630 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,633 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,636 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-27 20:09:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:41,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:09:41,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101383116] [2024-11-27 20:09:41,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101383116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:09:41,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967753895] [2024-11-27 20:09:41,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:41,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:41,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:41,689 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:41,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-27 20:09:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:42,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 1544 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-27 20:09:42,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:42,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:09:42,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:09:43,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967753895] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:09:43,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:09:43,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 25 [2024-11-27 20:09:43,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449019883] [2024-11-27 20:09:43,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:09:43,828 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:09:43,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:09:43,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-27 20:09:43,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2024-11-27 20:09:43,828 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. cyclomatic complexity: 10 Second operand has 25 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 10 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-27 20:09:44,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:44,252 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-11-27 20:09:44,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 63 transitions. [2024-11-27 20:09:44,253 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:09:44,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 63 transitions. [2024-11-27 20:09:44,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2024-11-27 20:09:44,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2024-11-27 20:09:44,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 63 transitions. [2024-11-27 20:09:44,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:09:44,255 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-11-27 20:09:44,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 63 transitions. [2024-11-27 20:09:44,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-27 20:09:44,260 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) [2024-11-27 20:09:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-11-27 20:09:44,261 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-11-27 20:09:44,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:09:44,262 INFO L425 stractBuchiCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-11-27 20:09:44,262 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-27 20:09:44,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 63 transitions. [2024-11-27 20:09:44,263 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:09:44,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:09:44,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:09:44,269 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-27 20:09:44,269 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [126, 126, 108, 108, 108, 21, 21, 18, 18, 18, 18, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:44,269 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call 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#4(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-27 20:09:44,269 INFO L749 eck$LassoCheckResult]: Loop: "~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#4(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#86#return;" "assume true;" >"#86#return;" "assume true;" >"#86#return;" "assume true;" >"#88#return;" "call #t~mem14 := read~int#4(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< [2024-11-27 20:09:44,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:44,270 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 12 times [2024-11-27 20:09:44,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:09:44,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564018344] [2024-11-27 20:09:44,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:44,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:09:44,282 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:09:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:09:44,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:09:44,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:44,290 INFO L85 PathProgramCache]: Analyzing trace with hash 976960304, now seen corresponding path program 9 times [2024-11-27 20:09:44,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:09:44,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884604977] [2024-11-27 20:09:44,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:44,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:47,933 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,392 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,571 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,581 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,590 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,597 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,606 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,612 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,617 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,621 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,674 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,683 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,690 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,697 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,703 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,707 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,710 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,712 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,750 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,759 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,766 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,772 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,777 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,781 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,784 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,786 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,812 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,820 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,828 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,837 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,844 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,850 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,854 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,857 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,884 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,895 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,906 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,915 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,922 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,927 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,931 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,934 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,949 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,960 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,970 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,978 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,985 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,991 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,994 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,996 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:51,998 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-27 20:09:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,446 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,555 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,563 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,573 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,582 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,589 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,594 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,598 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,601 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,665 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,673 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,682 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,691 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,698 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,704 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,708 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,711 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,746 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,754 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,761 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,768 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,773 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,777 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,779 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,781 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,808 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,816 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,826 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,835 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,842 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,847 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,851 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,854 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,882 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,892 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,900 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,906 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,913 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,918 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,921 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,923 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,934 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,942 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,950 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,957 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,963 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,967 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,970 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,971 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:54,974 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-27 20:09:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:55,902 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,020 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,027 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,034 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,040 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,045 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,050 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,054 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,056 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,102 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,110 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,117 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,123 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,129 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,134 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,136 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,138 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,172 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,181 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,188 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,193 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,199 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,203 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,207 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,210 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,238 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,246 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,253 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,259 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,264 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,268 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,271 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,272 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,291 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,300 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,313 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,326 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,333 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,339 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,343 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,346 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,367 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,378 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,386 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,392 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,399 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,403 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,406 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:09:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,409 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:09:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,412 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-27 20:09:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:56,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:09:56,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884604977] [2024-11-27 20:09:56,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884604977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:09:56,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470151445] [2024-11-27 20:09:56,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:56,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:56,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:56,462 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:56,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-27 20:09:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:57,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 4424 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-27 20:09:57,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:57,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:09:58,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:10:03,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470151445] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:10:03,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:10:03,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 18] total 37 [2024-11-27 20:10:03,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480408526] [2024-11-27 20:10:03,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:10:03,130 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:10:03,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:10:03,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-27 20:10:03,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1087, Unknown=0, NotChecked=0, Total=1332 [2024-11-27 20:10:03,132 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. cyclomatic complexity: 10 Second operand has 37 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 15 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2024-11-27 20:10:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:10:03,641 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2024-11-27 20:10:03,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 67 transitions. [2024-11-27 20:10:03,643 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:10:03,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 67 transitions. [2024-11-27 20:10:03,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2024-11-27 20:10:03,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2024-11-27 20:10:03,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 67 transitions. [2024-11-27 20:10:03,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:10:03,646 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-11-27 20:10:03,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 67 transitions. [2024-11-27 20:10:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-27 20:10:03,654 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) [2024-11-27 20:10:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2024-11-27 20:10:03,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-11-27 20:10:03,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-27 20:10:03,662 INFO L425 stractBuchiCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-11-27 20:10:03,763 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-27 20:10:03,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 67 transitions. [2024-11-27 20:10:03,764 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:10:03,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:10:03,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:10:03,782 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-27 20:10:03,782 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] [2024-11-27 20:10:03,782 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call 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#4(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-27 20:10:03,783 INFO L749 eck$LassoCheckResult]: Loop: "~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#4(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#86#return;" "assume true;" >"#86#return;" "assume true;" >"#86#return;" "assume true;" >"#86#return;" "assume true;" >"#86#return;" "assume true;" >"#88#return;" "call #t~mem14 := read~int#4(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< [2024-11-27 20:10:03,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:10:03,790 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 13 times [2024-11-27 20:10:03,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:10:03,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154852977] [2024-11-27 20:10:03,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:03,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:10:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:10:03,828 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:10:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:10:03,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:10:03,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:10:03,855 INFO L85 PathProgramCache]: Analyzing trace with hash 729449042, now seen corresponding path program 10 times [2024-11-27 20:10:03,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:10:03,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115575994] [2024-11-27 20:10:03,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:03,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:10:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:14,406 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,577 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,703 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,711 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,718 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,723 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,728 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,731 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,734 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,735 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,780 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,787 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,795 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,801 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,805 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,809 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,812 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,813 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,863 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,874 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,884 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,892 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,899 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,905 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,909 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,911 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,950 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,961 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,971 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,979 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,986 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,992 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,996 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:24,998 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:25,018 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:25,026 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:25,034 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:25,040 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:25,045 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:25,048 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:25,051 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:25,053 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:25,064 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:25,072 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:25,086 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:25,093 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:25,098 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:25,102 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:25,105 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:25,106 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:25,108 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-27 20:10:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,178 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,282 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,289 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,295 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,301 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,306 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,309 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,312 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,313 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,358 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,366 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,372 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,378 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,383 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,386 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,389 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,390 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,434 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,445 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,454 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,463 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,469 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,474 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,478 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,481 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,518 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,529 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,539 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,547 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,554 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,560 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,564 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,566 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,593 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,604 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,612 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,620 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,626 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,631 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,635 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,638 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,653 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,665 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,675 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,683 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,691 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,697 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,702 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,704 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:36,707 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-27 20:10:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:40,927 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,078 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,085 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,091 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,097 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,102 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,105 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,108 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,109 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,164 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,175 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,185 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,193 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,199 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,204 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,208 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,210 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,255 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,263 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,270 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,276 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,281 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,284 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,287 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,289 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,317 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,324 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,331 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,337 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,342 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,346 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,349 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,350 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,368 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,376 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,384 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,390 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,396 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,400 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,403 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,405 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,416 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,424 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,431 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,438 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,444 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,448 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,451 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,453 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:41,455 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-27 20:10:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,668 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,791 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,798 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,805 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,810 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,815 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,820 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,824 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,825 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,868 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,875 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,882 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,887 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,892 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,896 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,898 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,900 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,936 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,944 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,951 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,956 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,961 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,965 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,968 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,969 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,995 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,003 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,010 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,016 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,020 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,024 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,027 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,029 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,047 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,054 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,062 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,068 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,075 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,080 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,085 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,087 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,103 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,115 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,125 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,134 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,142 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,148 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,152 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,155 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:44,159 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-27 20:10:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,155 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,350 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,360 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,369 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,376 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,383 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,387 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,391 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,393 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,454 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,464 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,476 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,488 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,497 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,504 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,509 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,512 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,576 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,586 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,596 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,603 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,610 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,615 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,619 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,621 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,658 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,669 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,678 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,686 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,692 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,697 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,701 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,703 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,727 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,742 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,755 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,767 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,777 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,784 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,789 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,792 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,812 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,828 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,842 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,854 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,864 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,872 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,877 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-27 20:10:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,881 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-27 20:10:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:45,887 INFO L370 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-27 20:10:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:46,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-11-27 20:10:46,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115575994] [2024-11-27 20:10:46,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115575994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:10:46,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141502080] [2024-11-27 20:10:46,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:46,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:10:46,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:10:46,009 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:10:46,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-27 20:10:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:48,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 7304 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-27 20:10:48,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:10:48,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 20:10:49,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:10:57,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141502080] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:10:57,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:10:57,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13, 26] total 60 [2024-11-27 20:10:57,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900477963] [2024-11-27 20:10:57,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:10:57,881 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-11-27 20:10:57,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-11-27 20:10:57,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-11-27 20:10:57,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=3053, Unknown=0, NotChecked=0, Total=3540 [2024-11-27 20:10:57,883 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. cyclomatic complexity: 10 Second operand has 60 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 49 states have internal predecessors, (70), 25 states have call successors, (32), 12 states have call predecessors, (32), 17 states have return successors, (32), 27 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-27 20:10:59,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:10:59,274 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-11-27 20:10:59,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 72 transitions. [2024-11-27 20:10:59,275 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:10:59,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 72 transitions. [2024-11-27 20:10:59,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2024-11-27 20:10:59,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2024-11-27 20:10:59,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 72 transitions. [2024-11-27 20:10:59,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-27 20:10:59,277 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 72 transitions. [2024-11-27 20:10:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 72 transitions. [2024-11-27 20:10:59,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-27 20:10:59,283 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) [2024-11-27 20:10:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2024-11-27 20:10:59,284 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 69 transitions. [2024-11-27 20:10:59,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-27 20:10:59,286 INFO L425 stractBuchiCegarLoop]: Abstraction has 63 states and 69 transitions. [2024-11-27 20:10:59,286 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-27 20:10:59,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 69 transitions. [2024-11-27 20:10:59,287 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2024-11-27 20:10:59,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-27 20:10:59,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-27 20:10:59,293 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-27 20:10:59,294 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] [2024-11-27 20:10:59,294 INFO L747 eck$LassoCheckResult]: Stem: "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);" "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#4(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call 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#4(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4);" "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);"< [2024-11-27 20:10:59,294 INFO L749 eck$LassoCheckResult]: Loop: "~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#4(~a.base, ~a.offset, 4);" "assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4);" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~c.base, ~c.offset, 4);" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume #t~mem7 < 6;havoc #t~mem7;call write~int#2(0, ~d.base, ~d.offset, 4);" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#2(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#2(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6;" "call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);"< "~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#2(~d.base, ~d.offset, 4);" "assume !(#t~mem4 < 6);havoc #t~mem4;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#92#return;" "assume true;" >"#80#return;" "call #t~mem8 := read~int#3(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9;" "call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);"< "~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#3(~c.base, ~c.offset, 4);" "assume !(#t~mem7 < 6);havoc #t~mem7;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#82#return;" "assume true;" >"#84#return;" "call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12;" "call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);"< "~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#1(~b.base, ~b.offset, 4);" "assume !(#t~mem10 < 6);havoc #t~mem10;" "assume true;" >"#86#return;" "assume true;" >"#86#return;" "assume true;" >"#86#return;" "assume true;" >"#86#return;" "assume true;" >"#86#return;" "assume true;" >"#86#return;" "assume true;" >"#88#return;" "call #t~mem14 := read~int#4(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#4(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15;" "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);"< [2024-11-27 20:10:59,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:10:59,296 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 14 times [2024-11-27 20:10:59,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:10:59,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601058601] [2024-11-27 20:10:59,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:59,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:10:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:10:59,313 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:10:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:10:59,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:10:59,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:10:59,328 INFO L85 PathProgramCache]: Analyzing trace with hash 815036130, now seen corresponding path program 11 times [2024-11-27 20:10:59,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:10:59,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849956219] [2024-11-27 20:10:59,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:59,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:11:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:11:00,668 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:11:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:11:02,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:11:02,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:02,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1469748745, now seen corresponding path program 1 times [2024-11-27 20:11:02,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-11-27 20:11:02,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937933188] [2024-11-27 20:11:02,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:02,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:11:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:11:03,413 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:11:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:11:04,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-11-27 20:12:36,668 INFO L204 LassoAnalysis]: Preferences: [2024-11-27 20:12:36,669 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-27 20:12:36,669 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-27 20:12:36,669 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-27 20:12:36,669 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-27 20:12:36,670 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:36,670 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-27 20:12:36,670 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-27 20:12:36,670 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_4.c_Iteration14_Lasso [2024-11-27 20:12:36,670 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-27 20:12:36,671 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-27 20:12:36,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:36,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-27 20:12:39,035 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-27 20:12:39,040 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-27 20:12:39,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,045 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-27 20:12:39,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,072 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-27 20:12:39,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,088 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-27 20:12:39,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,114 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-27 20:12:39,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,126 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-27 20:12:39,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,144 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-27 20:12:39,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,154 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-27 20:12:39,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,177 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-27 20:12:39,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,186 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-27 20:12:39,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 [2024-11-27 20:12:39,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,204 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-27 20:12:39,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,213 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-27 20:12:39,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,233 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-27 20:12:39,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,242 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-27 20:12:39,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,260 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,261 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-27 20:12:39,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,270 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-27 20:12:39,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,290 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-27 20:12:39,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,300 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-27 20:12:39,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-27 20:12:39,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,332 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-27 20:12:39,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,351 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:39,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,360 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-27 20:12:39,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-27 20:12:39,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-27 20:12:39,384 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-27 20:12:39,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,393 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-27 20:12:39,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-27 20:12:39,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-27 20:12:39,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-27 20:12:39,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,438 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-27 20:12:39,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-27 20:12:39,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,464 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-27 20:12:39,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,485 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-27 20:12:39,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,500 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-27 20:12:39,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,526 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:39,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,540 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-27 20:12:39,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,565 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:39,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,578 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-27 20:12:39,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,601 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-27 20:12:39,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,610 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-27 20:12:39,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,632 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:39,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,641 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-27 20:12:39,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 [2024-11-27 20:12:39,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,659 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-27 20:12:39,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,668 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-27 20:12:39,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,686 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-27 20:12:39,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,696 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-27 20:12:39,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,716 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-27 20:12:39,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,724 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-27 20:12:39,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-27 20:12:39,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,742 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-27 20:12:39,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-27 20:12:39,744 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-27 20:12:39,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,754 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-27 20:12:39,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-27 20:12:39,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-27 20:12:39,787 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-27 20:12:39,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,796 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-27 20:12:39,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-27 20:12:39,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-27 20:12:39,821 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:39,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,833 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-27 20:12:39,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-27 20:12:39,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-27 20:12:39,856 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-27 20:12:39,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,865 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-27 20:12:39,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-27 20:12:39,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-27 20:12:39,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-27 20:12:39,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,918 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-27 20:12:39,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:39,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,942 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-27 20:12:39,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-27 20:12:39,949 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:39,959 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-27 20:12:39,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:39,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:39,962 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:39,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-27 20:12:39,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 [2024-11-27 20:12:39,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:39,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:39,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:39,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:39,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-27 20:12:39,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-27 20:12:39,993 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:40,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-11-27 20:12:40,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:40,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:40,003 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:40,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-27 20:12:40,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:40,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:40,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:40,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:40,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:40,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-27 20:12:40,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-27 20:12:40,029 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:40,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-27 20:12:40,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:40,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:40,043 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:40,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-27 20:12:40,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:40,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:40,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:40,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:40,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:40,068 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-27 20:12:40,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-27 20:12:40,075 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:40,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:40,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:40,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:40,090 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:40,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-27 20:12:40,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:40,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:40,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:40,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:40,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:40,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-27 20:12:40,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-27 20:12:40,117 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:40,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:40,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:40,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:40,130 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:40,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-27 20:12:40,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:40,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:40,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:40,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:40,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:40,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-27 20:12:40,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-27 20:12:40,168 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:40,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-27 20:12:40,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:40,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:40,182 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:40,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-27 20:12:40,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:40,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:40,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:40,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:40,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:40,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-27 20:12:40,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-27 20:12:40,213 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-27 20:12:40,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:40,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:40,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:40,226 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:40,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-27 20:12:40,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-27 20:12:40,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-27 20:12:40,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-27 20:12:40,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-27 20:12:40,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-27 20:12:40,252 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-27 20:12:40,252 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-27 20:12:40,261 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-27 20:12:40,274 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-27 20:12:40,278 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-27 20:12:40,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-27 20:12:40,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:12:40,282 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-27 20:12:40,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-27 20:12:40,289 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-27 20:12:40,311 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-27 20:12:40,311 INFO L474 LassoAnalysis]: Proved termination. [2024-11-27 20:12:40,312 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#4 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#4 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 [] [2024-11-27 20:12:40,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-27 20:12:40,492 INFO L156 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2024-11-27 20:12:40,503 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2024-11-27 20:12:40,505 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2024-11-27 20:12:40,505 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-11-27 20:12:40,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:40,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-27 20:12:40,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:12:41,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-27 20:12:56,902 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: incorrect predicates - loop at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.getLoopInterpolants(AbstractBuchiCegarLoop.java:719) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.refineBuchiInternal(AbstractBuchiCegarLoop.java:558) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:151) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:364) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-27 20:12:56,906 INFO L158 Benchmark]: Toolchain (without parser) took 261075.55ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 118.4MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 438.4MB. Max. memory is 16.1GB. [2024-11-27 20:12:56,907 INFO L158 Benchmark]: CDTParser took 1.70ms. Allocated memory is still 142.6MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:12:56,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.30ms. Allocated memory is still 142.6MB. Free memory was 118.2MB in the beginning and 107.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:12:56,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.09ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 106.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:12:56,908 INFO L158 Benchmark]: Boogie Preprocessor took 68.75ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 104.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:12:56,909 INFO L158 Benchmark]: RCFGBuilder took 619.32ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 88.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:12:56,909 INFO L158 Benchmark]: BuchiAutomizer took 260027.61ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 88.0MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 413.3MB. Max. memory is 16.1GB. [2024-11-27 20:12:56,912 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.70ms. Allocated memory is still 142.6MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.30ms. Allocated memory is still 142.6MB. Free memory was 118.2MB in the beginning and 107.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.09ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 106.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.75ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 104.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 619.32ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 88.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 260027.61ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 88.0MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 413.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[#in~a!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: incorrect predicates - loop de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: incorrect predicates - loop: de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.getLoopInterpolants(AbstractBuchiCegarLoop.java:719) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-27 20:12:56,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-27 20:12:57,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-27 20:12:57,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-27 20:12:57,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-27 20:12:57,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-27 20:12:57,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:58,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:58,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-27 20:12:58,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:58,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:58,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 20:12:59,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:59,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-27 20:12:59,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/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 Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cfdc1ca8-c546-4477-8e9a-4ea34e89cf4d/bin/uautomizer-verify-aQ6SnzHsRB/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incorrect predicates - loop