./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ --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 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:27:22,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:27:22,611 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-23 22:27:22,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:27:22,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:27:22,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:27:22,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:27:22,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:27:22,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 22:27:22,652 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 22:27:22,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:27:22,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:27:22,654 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:27:22,654 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-23 22:27:22,655 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-23 22:27:22,656 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-23 22:27:22,656 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-23 22:27:22,657 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-23 22:27:22,657 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-23 22:27:22,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:27:22,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-23 22:27:22,659 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:27:22,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:27:22,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:27:22,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:27:22,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-23 22:27:22,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-23 22:27:22,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-23 22:27:22,663 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 22:27:22,664 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:27:22,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:27:22,665 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-23 22:27:22,665 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:27:22,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:27:22,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:27:22,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:27:22,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:27:22,667 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-23 22:27:22,668 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ 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 -> 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c [2023-11-23 22:27:22,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:27:23,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:27:23,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:27:23,012 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:27:23,013 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:27:23,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2023-11-23 22:27:26,245 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:27:26,475 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:27:26,475 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2023-11-23 22:27:26,485 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/data/7ee241a65/d28ff6530d8f4232ba10121bdf63e262/FLAG1f586e8f5 [2023-11-23 22:27:26,503 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/data/7ee241a65/d28ff6530d8f4232ba10121bdf63e262 [2023-11-23 22:27:26,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:27:26,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:27:26,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:27:26,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:27:26,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:27:26,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:27:26" (1/1) ... [2023-11-23 22:27:26,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@594a442a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:26, skipping insertion in model container [2023-11-23 22:27:26,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:27:26" (1/1) ... [2023-11-23 22:27:26,541 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:27:26,692 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:27:26,703 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:27:26,727 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:27:26,741 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:27:26,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:26 WrapperNode [2023-11-23 22:27:26,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:27:26,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:27:26,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:27:26,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:27:26,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:26" (1/1) ... [2023-11-23 22:27:26,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:26" (1/1) ... [2023-11-23 22:27:26,778 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2023-11-23 22:27:26,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:27:26,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:27:26,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:27:26,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:27:26,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:26" (1/1) ... [2023-11-23 22:27:26,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:26" (1/1) ... [2023-11-23 22:27:26,794 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:26" (1/1) ... [2023-11-23 22:27:26,812 INFO L189 HeapSplitter]: Split 26 memory accesses to 5 slices as follows [2, 6, 6, 6, 6] [2023-11-23 22:27:26,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:26" (1/1) ... [2023-11-23 22:27:26,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:26" (1/1) ... [2023-11-23 22:27:26,823 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:26" (1/1) ... [2023-11-23 22:27:26,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:26" (1/1) ... [2023-11-23 22:27:26,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:26" (1/1) ... [2023-11-23 22:27:26,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:26" (1/1) ... [2023-11-23 22:27:26,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:27:26,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:27:26,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:27:26,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:27:26,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:26" (1/1) ... [2023-11-23 22:27:26,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-23 22:27:26,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:27:26,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-23 22:27:26,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-23 22:27:26,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:27:26,910 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_28_0 [2023-11-23 22:27:26,910 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_28_0 [2023-11-23 22:27:26,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 22:27:26,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 22:27:26,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 22:27:26,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 22:27:26,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-23 22:27:26,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 22:27:26,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 22:27:26,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 22:27:26,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 22:27:26,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-23 22:27:26,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-23 22:27:26,912 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2023-11-23 22:27:26,914 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2023-11-23 22:27:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_28_0 [2023-11-23 22:27:26,915 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_28_0 [2023-11-23 22:27:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:27:26,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:27:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 22:27:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 22:27:26,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 22:27:26,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-23 22:27:26,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-23 22:27:26,917 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2023-11-23 22:27:26,917 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2023-11-23 22:27:26,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 22:27:27,026 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:27:27,029 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:27:27,296 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:27:27,307 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:27:27,308 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 22:27:27,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:27:27 BoogieIcfgContainer [2023-11-23 22:27:27,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:27:27,311 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-23 22:27:27,311 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-23 22:27:27,315 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-23 22:27:27,316 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-23 22:27:27,316 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 10:27:26" (1/3) ... [2023-11-23 22:27:27,317 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53ade116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 10:27:27, skipping insertion in model container [2023-11-23 22:27:27,318 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-23 22:27:27,318 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:27:26" (2/3) ... [2023-11-23 22:27:27,318 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53ade116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 10:27:27, skipping insertion in model container [2023-11-23 22:27:27,318 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-23 22:27:27,319 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:27:27" (3/3) ... [2023-11-23 22:27:27,320 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_6.c [2023-11-23 22:27:27,414 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-23 22:27:27,414 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-23 22:27:27,414 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-23 22:27:27,414 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-23 22:27:27,414 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-23 22:27:27,414 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-23 22:27:27,415 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-23 22:27:27,415 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-23 22:27:27,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-23 22:27:27,451 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-23 22:27:27,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:27:27,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:27:27,457 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-23 22:27:27,458 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-23 22:27:27,458 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-23 22:27:27,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-23 22:27:27,465 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-23 22:27:27,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:27:27,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:27:27,466 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-23 22:27:27,466 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-23 22:27:27,473 INFO L748 eck$LassoCheckResult]: Stem: 44#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#3(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 34#L109-2true [2023-11-23 22:27:27,473 INFO L750 eck$LassoCheckResult]: Loop: 34#L109-2true assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 11#L114-2true assume !(main_~b~0#1 < 6); 5#L114-3true main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 34#L109-2true [2023-11-23 22:27:27,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:27,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2023-11-23 22:27:27,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:27,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909896451] [2023-11-23 22:27:27,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:27,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:27:27,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:27:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:27:27,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:27:27,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:27,697 INFO L85 PathProgramCache]: Analyzing trace with hash 71729, now seen corresponding path program 1 times [2023-11-23 22:27:27,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:27,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411281991] [2023-11-23 22:27:27,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:27,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:27:27,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:27:27,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411281991] [2023-11-23 22:27:27,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411281991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:27:27,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:27:27,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:27:27,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300723314] [2023-11-23 22:27:27,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:27:27,791 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-23 22:27:27,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:27:27,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:27:27,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:27:27,842 INFO L87 Difference]: Start difference. First operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 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 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:27:27,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:27:27,876 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2023-11-23 22:27:27,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. [2023-11-23 22:27:27,884 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2023-11-23 22:27:27,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 36 states and 46 transitions. [2023-11-23 22:27:27,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2023-11-23 22:27:27,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2023-11-23 22:27:27,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2023-11-23 22:27:27,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:27:27,901 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2023-11-23 22:27:27,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2023-11-23 22:27:27,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2023-11-23 22:27:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-23 22:27:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2023-11-23 22:27:27,934 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2023-11-23 22:27:27,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:27:27,940 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2023-11-23 22:27:27,941 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-23 22:27:27,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2023-11-23 22:27:27,944 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-23 22:27:27,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:27:27,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:27:27,948 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-23 22:27:27,949 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:27:27,950 INFO L748 eck$LassoCheckResult]: Stem: 138#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 120#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#3(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 109#L109-2 [2023-11-23 22:27:27,950 INFO L750 eck$LassoCheckResult]: Loop: 109#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 118#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 119#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 135#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 134#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 124#L81-1 assume true; 121#func_to_recursive_line_25_to_26_0EXIT >#123#return; 123#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 136#L114-2 assume !(main_~b~0#1 < 6); 108#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 109#L109-2 [2023-11-23 22:27:27,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:27,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2023-11-23 22:27:27,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:27,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987998754] [2023-11-23 22:27:27,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:27,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:27:28,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:27:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:27:28,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:27:28,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:28,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1371427203, now seen corresponding path program 1 times [2023-11-23 22:27:28,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:28,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579786572] [2023-11-23 22:27:28,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:28,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:28,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:27:28,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:27:28,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579786572] [2023-11-23 22:27:28,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579786572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:27:28,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:27:28,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:27:28,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052244129] [2023-11-23 22:27:28,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:27:28,506 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-23 22:27:28,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:27:28,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:27:28,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:27:28,511 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 22:27:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:27:28,793 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2023-11-23 22:27:28,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2023-11-23 22:27:28,799 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-23 22:27:28,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 54 transitions. [2023-11-23 22:27:28,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-23 22:27:28,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-23 22:27:28,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2023-11-23 22:27:28,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:27:28,817 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 54 transitions. [2023-11-23 22:27:28,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2023-11-23 22:27:28,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2023-11-23 22:27:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 26 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-23 22:27:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2023-11-23 22:27:28,830 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2023-11-23 22:27:28,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:27:28,835 INFO L428 stractBuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2023-11-23 22:27:28,835 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-23 22:27:28,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2023-11-23 22:27:28,837 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-23 22:27:28,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:27:28,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:27:28,840 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-23 22:27:28,840 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:27:28,840 INFO L748 eck$LassoCheckResult]: Stem: 232#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#3(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 205#L109-2 [2023-11-23 22:27:28,841 INFO L750 eck$LassoCheckResult]: Loop: 205#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 212#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 213#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 228#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 227#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 202#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 203#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 220#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 223#L61-1 assume true; 224#func_to_recursive_line_26_to_27_0EXIT >#115#return; 225#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 215#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 228#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 227#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 222#L81-1 assume true; 214#func_to_recursive_line_25_to_26_0EXIT >#117#return; 216#L81-1 assume true; 233#func_to_recursive_line_25_to_26_0EXIT >#123#return; 229#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 230#L114-2 assume !(main_~b~0#1 < 6); 204#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 205#L109-2 [2023-11-23 22:27:28,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:28,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 3 times [2023-11-23 22:27:28,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:28,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812240271] [2023-11-23 22:27:28,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:28,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:27:28,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:27:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:27:28,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:27:28,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:28,893 INFO L85 PathProgramCache]: Analyzing trace with hash 182328154, now seen corresponding path program 1 times [2023-11-23 22:27:28,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:28,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624982095] [2023-11-23 22:27:28,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:28,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:29,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:29,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:29,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:27:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 22:27:29,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:27:29,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624982095] [2023-11-23 22:27:29,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624982095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:27:29,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:27:29,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:27:29,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093385307] [2023-11-23 22:27:29,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:27:29,450 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-23 22:27:29,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:27:29,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:27:29,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:27:29,452 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 22:27:29,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:27:29,612 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2023-11-23 22:27:29,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2023-11-23 22:27:29,618 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-23 22:27:29,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 53 transitions. [2023-11-23 22:27:29,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-23 22:27:29,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-23 22:27:29,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2023-11-23 22:27:29,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:27:29,626 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2023-11-23 22:27:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2023-11-23 22:27:29,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2023-11-23 22:27:29,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-11-23 22:27:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2023-11-23 22:27:29,636 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2023-11-23 22:27:29,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:27:29,639 INFO L428 stractBuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2023-11-23 22:27:29,639 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-23 22:27:29,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2023-11-23 22:27:29,641 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-23 22:27:29,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:27:29,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:27:29,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-23 22:27:29,643 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, 1] [2023-11-23 22:27:29,643 INFO L748 eck$LassoCheckResult]: Stem: 347#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 325#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#3(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 319#L109-2 [2023-11-23 22:27:29,644 INFO L750 eck$LassoCheckResult]: Loop: 319#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 326#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 327#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 343#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 341#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 316#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 317#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 334#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 313#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 324#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 331#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 332#L41-1 assume true; 333#func_to_recursive_line_27_to_28_0EXIT >#125#return; 340#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 315#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 317#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 334#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 337#L61-1 assume true; 338#func_to_recursive_line_26_to_27_0EXIT >#127#return; 339#L61-1 assume true; 348#func_to_recursive_line_26_to_27_0EXIT >#115#return; 342#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 329#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 343#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 341#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 336#L81-1 assume true; 328#func_to_recursive_line_25_to_26_0EXIT >#117#return; 330#L81-1 assume true; 349#func_to_recursive_line_25_to_26_0EXIT >#123#return; 344#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 345#L114-2 assume !(main_~b~0#1 < 6); 318#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 319#L109-2 [2023-11-23 22:27:29,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:29,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 4 times [2023-11-23 22:27:29,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:29,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584610383] [2023-11-23 22:27:29,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:29,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:27:29,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:27:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:27:29,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:27:29,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:29,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2098832724, now seen corresponding path program 1 times [2023-11-23 22:27:29,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:29,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70184623] [2023-11-23 22:27:29,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:29,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:29,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:30,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:30,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:30,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:27:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:30,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 22:27:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 22:27:30,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:27:30,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70184623] [2023-11-23 22:27:30,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70184623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:27:30,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:27:30,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:27:30,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006556570] [2023-11-23 22:27:30,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:27:30,207 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-23 22:27:30,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:27:30,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:27:30,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:27:30,208 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-23 22:27:30,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:27:30,378 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2023-11-23 22:27:30,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2023-11-23 22:27:30,387 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-23 22:27:30,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2023-11-23 22:27:30,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-23 22:27:30,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-23 22:27:30,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2023-11-23 22:27:30,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:27:30,390 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2023-11-23 22:27:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2023-11-23 22:27:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2023-11-23 22:27:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2023-11-23 22:27:30,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2023-11-23 22:27:30,395 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2023-11-23 22:27:30,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:27:30,396 INFO L428 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2023-11-23 22:27:30,396 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-23 22:27:30,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2023-11-23 22:27:30,397 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-23 22:27:30,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:27:30,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:27:30,399 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-23 22:27:30,399 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:27:30,399 INFO L748 eck$LassoCheckResult]: Stem: 494#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 473#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#3(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 465#L109-2 [2023-11-23 22:27:30,400 INFO L750 eck$LassoCheckResult]: Loop: 465#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 471#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 472#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 489#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 487#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 462#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 480#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 459#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 470#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 477#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 468#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 466#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 469#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 481#L25-1 assume true; 493#func_to_recursive_line_28_to_28_0EXIT >#119#return; 458#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 460#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 470#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 477#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 478#L41-1 assume true; 479#func_to_recursive_line_27_to_28_0EXIT >#121#return; 486#L41-1 assume true; 495#func_to_recursive_line_27_to_28_0EXIT >#125#return; 490#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 461#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 463#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 480#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 483#L61-1 assume true; 484#func_to_recursive_line_26_to_27_0EXIT >#127#return; 485#L61-1 assume true; 496#func_to_recursive_line_26_to_27_0EXIT >#115#return; 488#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 475#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 489#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 487#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 482#L81-1 assume true; 474#func_to_recursive_line_25_to_26_0EXIT >#117#return; 476#L81-1 assume true; 497#func_to_recursive_line_25_to_26_0EXIT >#123#return; 491#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 492#L114-2 assume !(main_~b~0#1 < 6); 464#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 465#L109-2 [2023-11-23 22:27:30,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:30,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 5 times [2023-11-23 22:27:30,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:30,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110903621] [2023-11-23 22:27:30,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:30,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:27:30,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:27:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:27:30,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:27:30,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:30,418 INFO L85 PathProgramCache]: Analyzing trace with hash 500602406, now seen corresponding path program 1 times [2023-11-23 22:27:30,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:30,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753374536] [2023-11-23 22:27:30,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:30,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:30,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:30,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:30,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:31,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:31,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:27:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:31,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-23 22:27:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:31,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 22:27:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 22:27:31,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:27:31,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753374536] [2023-11-23 22:27:31,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753374536] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:27:31,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:27:31,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:27:31,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460379411] [2023-11-23 22:27:31,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:27:31,173 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-23 22:27:31,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:27:31,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:27:31,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:27:31,175 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 22:27:31,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:27:31,320 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2023-11-23 22:27:31,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2023-11-23 22:27:31,323 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-23 22:27:31,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2023-11-23 22:27:31,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-23 22:27:31,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-23 22:27:31,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2023-11-23 22:27:31,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:27:31,328 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-11-23 22:27:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2023-11-23 22:27:31,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-23 22:27:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-23 22:27:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2023-11-23 22:27:31,338 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-11-23 22:27:31,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:27:31,342 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-11-23 22:27:31,342 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-23 22:27:31,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 51 transitions. [2023-11-23 22:27:31,344 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-23 22:27:31,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:27:31,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:27:31,348 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-23 22:27:31,348 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:27:31,348 INFO L748 eck$LassoCheckResult]: Stem: 685#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 662#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#3(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 651#L109-2 [2023-11-23 22:27:31,349 INFO L750 eck$LassoCheckResult]: Loop: 651#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 660#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 661#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 678#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 676#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 653#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 654#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 669#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 648#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 659#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 666#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 657#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 655#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 658#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 656#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 655#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 658#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 670#L25-1 assume true; 684#func_to_recursive_line_28_to_28_0EXIT >#113#return; 682#L25-1 assume true; 683#func_to_recursive_line_28_to_28_0EXIT >#119#return; 647#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 649#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 659#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 666#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 667#L41-1 assume true; 668#func_to_recursive_line_27_to_28_0EXIT >#121#return; 675#L41-1 assume true; 686#func_to_recursive_line_27_to_28_0EXIT >#125#return; 679#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 652#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 654#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 669#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 672#L61-1 assume true; 673#func_to_recursive_line_26_to_27_0EXIT >#127#return; 674#L61-1 assume true; 687#func_to_recursive_line_26_to_27_0EXIT >#115#return; 677#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 664#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 678#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 676#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 671#L81-1 assume true; 663#func_to_recursive_line_25_to_26_0EXIT >#117#return; 665#L81-1 assume true; 688#func_to_recursive_line_25_to_26_0EXIT >#123#return; 680#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 681#L114-2 assume !(main_~b~0#1 < 6); 650#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 651#L109-2 [2023-11-23 22:27:31,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:31,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 6 times [2023-11-23 22:27:31,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:31,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259527375] [2023-11-23 22:27:31,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:31,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:27:31,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:27:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:27:31,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:27:31,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:31,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1994055486, now seen corresponding path program 1 times [2023-11-23 22:27:31,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:31,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115727485] [2023-11-23 22:27:31,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:31,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:31,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:32,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:32,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:32,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:32,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:32,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:27:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:32,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:27:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:32,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:27:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 22:27:32,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:27:32,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115727485] [2023-11-23 22:27:32,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115727485] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:27:32,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043881065] [2023-11-23 22:27:32,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:32,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:27:32,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:27:32,855 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:27:32,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 22:27:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:33,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 22:27:33,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:27:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 22:27:33,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:27:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 22:27:33,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043881065] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:27:33,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:27:33,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 13 [2023-11-23 22:27:33,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612167749] [2023-11-23 22:27:33,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:27:33,251 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-23 22:27:33,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:27:33,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 22:27:33,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-23 22:27:33,252 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. cyclomatic complexity: 14 Second operand has 13 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 6 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2023-11-23 22:27:33,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:27:33,569 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2023-11-23 22:27:33,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2023-11-23 22:27:33,571 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2023-11-23 22:27:33,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 65 transitions. [2023-11-23 22:27:33,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2023-11-23 22:27:33,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2023-11-23 22:27:33,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 65 transitions. [2023-11-23 22:27:33,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:27:33,575 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 65 transitions. [2023-11-23 22:27:33,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 65 transitions. [2023-11-23 22:27:33,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-23 22:27:33,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 36 states have internal predecessors, (38), 11 states have call successors, (11), 4 states have call predecessors, (11), 9 states have return successors, (16), 12 states have call predecessors, (16), 11 states have call successors, (16) [2023-11-23 22:27:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2023-11-23 22:27:33,581 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 65 transitions. [2023-11-23 22:27:33,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 22:27:33,582 INFO L428 stractBuchiCegarLoop]: Abstraction has 53 states and 65 transitions. [2023-11-23 22:27:33,583 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-23 22:27:33,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 65 transitions. [2023-11-23 22:27:33,584 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2023-11-23 22:27:33,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:27:33,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:27:33,589 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-23 22:27:33,589 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2023-11-23 22:27:33,590 INFO L748 eck$LassoCheckResult]: Stem: 1204#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1179#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#3(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 1168#L109-2 [2023-11-23 22:27:33,591 INFO L750 eck$LassoCheckResult]: Loop: 1168#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1177#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1178#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1198#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1196#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 1170#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 1189#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 1165#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 1186#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 1173#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1172#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1175#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1174#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1172#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1175#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1174#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1172#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1175#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1190#L25-1 assume true; 1202#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1203#L25-1 assume true; 1212#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1206#L25-1 assume true; 1205#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1164#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1166#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 1186#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1187#L41-1 assume true; 1188#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1195#L41-1 assume true; 1214#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1199#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1169#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 1189#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1192#L61-1 assume true; 1193#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1194#L61-1 assume true; 1216#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1197#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1183#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1198#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1196#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1191#L81-1 assume true; 1180#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1185#L81-1 assume true; 1209#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1200#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1201#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1182#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1198#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1196#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 1170#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 1189#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 1165#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 1186#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 1173#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1172#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1175#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1174#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1172#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1175#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1174#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1172#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1175#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1190#L25-1 assume true; 1202#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1203#L25-1 assume true; 1212#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1206#L25-1 assume true; 1205#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1164#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1166#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 1186#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1187#L41-1 assume true; 1188#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1195#L41-1 assume true; 1214#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1199#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1169#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 1189#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1192#L61-1 assume true; 1193#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1194#L61-1 assume true; 1216#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1197#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1183#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1198#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1196#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1191#L81-1 assume true; 1180#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1185#L81-1 assume true; 1209#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1210#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1215#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1184#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1198#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1196#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 1170#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 1189#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 1165#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 1186#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 1173#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1172#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1175#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1174#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1172#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1175#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1174#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1172#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1175#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1190#L25-1 assume true; 1202#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1203#L25-1 assume true; 1212#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1206#L25-1 assume true; 1205#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1164#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1166#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 1186#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1187#L41-1 assume true; 1188#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1195#L41-1 assume true; 1214#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1199#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1169#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 1189#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1192#L61-1 assume true; 1193#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1194#L61-1 assume true; 1216#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1197#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1183#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1198#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1196#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1191#L81-1 assume true; 1180#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1185#L81-1 assume true; 1209#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1211#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1213#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1181#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 1198#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1196#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 1170#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 1189#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 1165#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 1186#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 1173#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1172#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1175#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1174#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1172#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1175#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1174#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1172#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 1175#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1190#L25-1 assume true; 1202#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1203#L25-1 assume true; 1212#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1206#L25-1 assume true; 1205#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1164#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1166#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1176#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 1186#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1187#L41-1 assume true; 1188#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1195#L41-1 assume true; 1214#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1199#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1169#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1171#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 1189#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1192#L61-1 assume true; 1193#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1194#L61-1 assume true; 1216#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1197#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1183#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1198#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 1196#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1191#L81-1 assume true; 1180#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1185#L81-1 assume true; 1209#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1208#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 1207#L114-2 assume !(main_~b~0#1 < 6); 1167#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 1168#L109-2 [2023-11-23 22:27:33,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:33,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 7 times [2023-11-23 22:27:33,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:33,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231350405] [2023-11-23 22:27:33,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:33,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:27:33,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:27:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:27:33,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:27:33,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:33,612 INFO L85 PathProgramCache]: Analyzing trace with hash -607354947, now seen corresponding path program 2 times [2023-11-23 22:27:33,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:33,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042134237] [2023-11-23 22:27:33,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:33,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:35,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:35,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:35,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:27:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:27:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:27:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 22:27:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:27:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:27:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:27:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-23 22:27:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:27:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:27:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:27:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-23 22:27:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:36,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:27:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:27:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:27:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 134 proven. 173 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2023-11-23 22:27:37,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:27:37,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042134237] [2023-11-23 22:27:37,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042134237] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:27:37,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175125131] [2023-11-23 22:27:37,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 22:27:37,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:27:37,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:27:37,897 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:27:37,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 22:27:38,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 22:27:38,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 22:27:38,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 1664 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 22:27:38,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:27:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2023-11-23 22:27:38,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:27:39,151 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2023-11-23 22:27:39,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175125131] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:27:39,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:27:39,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 7, 7] total 28 [2023-11-23 22:27:39,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589803809] [2023-11-23 22:27:39,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:27:39,157 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-23 22:27:39,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:27:39,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-23 22:27:39,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2023-11-23 22:27:39,159 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. cyclomatic complexity: 17 Second operand has 28 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 26 states have internal predecessors, (72), 15 states have call successors, (32), 2 states have call predecessors, (32), 8 states have return successors, (28), 12 states have call predecessors, (28), 15 states have call successors, (28) [2023-11-23 22:27:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:27:39,926 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2023-11-23 22:27:39,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2023-11-23 22:27:39,928 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2023-11-23 22:27:39,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 63 states and 77 transitions. [2023-11-23 22:27:39,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2023-11-23 22:27:39,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2023-11-23 22:27:39,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 77 transitions. [2023-11-23 22:27:39,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:27:39,931 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 77 transitions. [2023-11-23 22:27:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 77 transitions. [2023-11-23 22:27:39,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-23 22:27:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 42 states have internal predecessors, (44), 13 states have call successors, (13), 4 states have call predecessors, (13), 11 states have return successors, (20), 16 states have call predecessors, (20), 13 states have call successors, (20) [2023-11-23 22:27:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2023-11-23 22:27:39,937 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 77 transitions. [2023-11-23 22:27:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-23 22:27:39,939 INFO L428 stractBuchiCegarLoop]: Abstraction has 63 states and 77 transitions. [2023-11-23 22:27:39,939 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-23 22:27:39,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 77 transitions. [2023-11-23 22:27:39,940 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2023-11-23 22:27:39,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:27:39,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:27:39,948 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-23 22:27:39,948 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [48, 48, 36, 36, 36, 18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1] [2023-11-23 22:27:39,948 INFO L748 eck$LassoCheckResult]: Stem: 3175#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 3148#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#3(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 3140#L109-2 [2023-11-23 22:27:39,949 INFO L750 eck$LassoCheckResult]: Loop: 3140#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 3171#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3155#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3169#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3167#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 3137#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3138#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3161#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 3135#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3145#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3157#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3143#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3160#L25-1 assume true; 3173#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3174#L25-1 assume true; 3192#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3191#L25-1 assume true; 3189#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3177#L25-1 assume true; 3176#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3133#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3134#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3145#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3157#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3143#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3160#L25-1 assume true; 3173#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3174#L25-1 assume true; 3192#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3191#L25-1 assume true; 3189#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3177#L25-1 assume true; 3176#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3133#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3134#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3145#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3157#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3158#L41-1 assume true; 3159#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3166#L41-1 assume true; 3181#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3179#L41-1 assume true; 3178#func_to_recursive_line_27_to_28_0EXIT >#125#return; 3170#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3136#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3138#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3161#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3163#L61-1 assume true; 3164#func_to_recursive_line_26_to_27_0EXIT >#127#return; 3165#L61-1 assume true; 3180#func_to_recursive_line_26_to_27_0EXIT >#115#return; 3168#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3153#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3169#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3167#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3162#L81-1 assume true; 3149#func_to_recursive_line_25_to_26_0EXIT >#117#return; 3156#L81-1 assume true; 3184#func_to_recursive_line_25_to_26_0EXIT >#123#return; 3172#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3146#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3147#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3169#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3167#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 3137#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3138#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3161#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 3135#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3145#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3157#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3143#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3160#L25-1 assume true; 3173#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3174#L25-1 assume true; 3192#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3191#L25-1 assume true; 3189#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3177#L25-1 assume true; 3176#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3133#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3134#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3145#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3157#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3143#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3160#L25-1 assume true; 3173#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3174#L25-1 assume true; 3192#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3191#L25-1 assume true; 3189#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3177#L25-1 assume true; 3176#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3133#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3134#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3145#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3157#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3158#L41-1 assume true; 3159#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3166#L41-1 assume true; 3181#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3179#L41-1 assume true; 3178#func_to_recursive_line_27_to_28_0EXIT >#125#return; 3170#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3136#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3138#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3161#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3163#L61-1 assume true; 3164#func_to_recursive_line_26_to_27_0EXIT >#127#return; 3165#L61-1 assume true; 3180#func_to_recursive_line_26_to_27_0EXIT >#115#return; 3168#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3153#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3169#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3167#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3162#L81-1 assume true; 3149#func_to_recursive_line_25_to_26_0EXIT >#117#return; 3156#L81-1 assume true; 3184#func_to_recursive_line_25_to_26_0EXIT >#123#return; 3188#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3195#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3150#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3169#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3167#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 3137#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3138#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3161#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 3135#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3145#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3157#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3143#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3160#L25-1 assume true; 3173#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3174#L25-1 assume true; 3192#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3191#L25-1 assume true; 3189#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3177#L25-1 assume true; 3176#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3133#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3134#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3145#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3157#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3143#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3160#L25-1 assume true; 3173#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3174#L25-1 assume true; 3192#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3191#L25-1 assume true; 3189#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3177#L25-1 assume true; 3176#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3133#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3134#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3145#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3157#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3158#L41-1 assume true; 3159#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3166#L41-1 assume true; 3181#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3179#L41-1 assume true; 3178#func_to_recursive_line_27_to_28_0EXIT >#125#return; 3170#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3136#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3138#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3161#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3163#L61-1 assume true; 3164#func_to_recursive_line_26_to_27_0EXIT >#127#return; 3165#L61-1 assume true; 3180#func_to_recursive_line_26_to_27_0EXIT >#115#return; 3168#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3153#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3169#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3167#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3162#L81-1 assume true; 3149#func_to_recursive_line_25_to_26_0EXIT >#117#return; 3156#L81-1 assume true; 3184#func_to_recursive_line_25_to_26_0EXIT >#123#return; 3185#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3194#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3151#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3169#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3167#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 3137#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3138#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3161#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 3135#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3145#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3157#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3143#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3160#L25-1 assume true; 3173#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3174#L25-1 assume true; 3192#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3191#L25-1 assume true; 3189#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3177#L25-1 assume true; 3176#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3133#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3134#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3145#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3157#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3143#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3160#L25-1 assume true; 3173#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3174#L25-1 assume true; 3192#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3191#L25-1 assume true; 3189#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3177#L25-1 assume true; 3176#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3133#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3134#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3145#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3157#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3158#L41-1 assume true; 3159#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3166#L41-1 assume true; 3181#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3179#L41-1 assume true; 3178#func_to_recursive_line_27_to_28_0EXIT >#125#return; 3170#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3136#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3138#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3161#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3163#L61-1 assume true; 3164#func_to_recursive_line_26_to_27_0EXIT >#127#return; 3165#L61-1 assume true; 3180#func_to_recursive_line_26_to_27_0EXIT >#115#return; 3168#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3153#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3169#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3167#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3162#L81-1 assume true; 3149#func_to_recursive_line_25_to_26_0EXIT >#117#return; 3156#L81-1 assume true; 3184#func_to_recursive_line_25_to_26_0EXIT >#123#return; 3186#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3193#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3152#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3169#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3167#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 3137#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3138#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3161#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 3135#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3145#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3157#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3143#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3160#L25-1 assume true; 3173#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3174#L25-1 assume true; 3192#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3191#L25-1 assume true; 3189#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3177#L25-1 assume true; 3176#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3133#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3134#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3145#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3157#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3143#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3160#L25-1 assume true; 3173#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3174#L25-1 assume true; 3192#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3191#L25-1 assume true; 3189#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3177#L25-1 assume true; 3176#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3133#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3134#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3145#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3157#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3158#L41-1 assume true; 3159#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3166#L41-1 assume true; 3181#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3179#L41-1 assume true; 3178#func_to_recursive_line_27_to_28_0EXIT >#125#return; 3170#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3136#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3138#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3161#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3163#L61-1 assume true; 3164#func_to_recursive_line_26_to_27_0EXIT >#127#return; 3165#L61-1 assume true; 3180#func_to_recursive_line_26_to_27_0EXIT >#115#return; 3168#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3153#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3169#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3167#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3162#L81-1 assume true; 3149#func_to_recursive_line_25_to_26_0EXIT >#117#return; 3156#L81-1 assume true; 3184#func_to_recursive_line_25_to_26_0EXIT >#123#return; 3187#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3190#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 3154#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 3169#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3167#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 3137#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3138#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3161#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 3135#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3145#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3157#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3143#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3160#L25-1 assume true; 3173#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3174#L25-1 assume true; 3192#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3191#L25-1 assume true; 3189#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3177#L25-1 assume true; 3176#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3133#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3134#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3145#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3157#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 3143#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 3142#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 3141#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 3144#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3160#L25-1 assume true; 3173#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3174#L25-1 assume true; 3192#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3191#L25-1 assume true; 3189#func_to_recursive_line_28_to_28_0EXIT >#113#return; 3177#L25-1 assume true; 3176#func_to_recursive_line_28_to_28_0EXIT >#119#return; 3133#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 3134#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 3145#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 3157#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3158#L41-1 assume true; 3159#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3166#L41-1 assume true; 3181#func_to_recursive_line_27_to_28_0EXIT >#121#return; 3179#L41-1 assume true; 3178#func_to_recursive_line_27_to_28_0EXIT >#125#return; 3170#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 3136#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3138#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 3161#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3163#L61-1 assume true; 3164#func_to_recursive_line_26_to_27_0EXIT >#127#return; 3165#L61-1 assume true; 3180#func_to_recursive_line_26_to_27_0EXIT >#115#return; 3168#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 3153#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 3169#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 3167#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3162#L81-1 assume true; 3149#func_to_recursive_line_25_to_26_0EXIT >#117#return; 3156#L81-1 assume true; 3184#func_to_recursive_line_25_to_26_0EXIT >#123#return; 3183#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 3182#L114-2 assume !(main_~b~0#1 < 6); 3139#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 3140#L109-2 [2023-11-23 22:27:39,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:39,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 8 times [2023-11-23 22:27:39,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:39,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246463110] [2023-11-23 22:27:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:39,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:27:39,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:27:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:27:39,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:27:39,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:39,976 INFO L85 PathProgramCache]: Analyzing trace with hash -602624943, now seen corresponding path program 3 times [2023-11-23 22:27:39,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:39,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364286020] [2023-11-23 22:27:39,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:39,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:43,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:44,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:44,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 22:27:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 22:27:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 22:27:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 22:27:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-23 22:27:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 22:27:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:45,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 22:27:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 22:27:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 22:27:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-23 22:27:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 22:27:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 22:27:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 22:27:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 22:27:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-11-23 22:27:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 22:27:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 22:27:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 22:27:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 22:27:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-11-23 22:27:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 22:27:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 22:27:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 22:27:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 22:27:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2023-11-23 22:27:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 22:27:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 22:27:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 22:27:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-23 22:27:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6621 backedges. 23 proven. 770 refuted. 0 times theorem prover too weak. 5828 trivial. 0 not checked. [2023-11-23 22:27:46,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:27:46,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364286020] [2023-11-23 22:27:46,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364286020] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:27:46,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625559483] [2023-11-23 22:27:46,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 22:27:46,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:27:46,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:27:46,875 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:27:46,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 22:27:49,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-23 22:27:49,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 22:27:50,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 2025 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-23 22:27:50,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:27:50,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 22:27:50,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6621 backedges. 1247 proven. 39 refuted. 0 times theorem prover too weak. 5335 trivial. 0 not checked. [2023-11-23 22:27:50,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:27:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6621 backedges. 975 proven. 27 refuted. 0 times theorem prover too weak. 5619 trivial. 0 not checked. [2023-11-23 22:27:54,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625559483] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:27:54,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:27:54,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 18] total 39 [2023-11-23 22:27:54,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806878898] [2023-11-23 22:27:54,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:27:54,108 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-23 22:27:54,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:27:54,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-23 22:27:54,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1269, Unknown=0, NotChecked=0, Total=1482 [2023-11-23 22:27:54,110 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. cyclomatic complexity: 19 Second operand has 39 states, 29 states have (on average 2.793103448275862) internal successors, (81), 33 states have internal predecessors, (81), 16 states have call successors, (41), 8 states have call predecessors, (41), 11 states have return successors, (40), 11 states have call predecessors, (40), 16 states have call successors, (40) [2023-11-23 22:27:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:27:55,017 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2023-11-23 22:27:55,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 81 transitions. [2023-11-23 22:27:55,018 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2023-11-23 22:27:55,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 81 transitions. [2023-11-23 22:27:55,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2023-11-23 22:27:55,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2023-11-23 22:27:55,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 81 transitions. [2023-11-23 22:27:55,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:27:55,021 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 81 transitions. [2023-11-23 22:27:55,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 81 transitions. [2023-11-23 22:27:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-23 22:27:55,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 44 states have internal predecessors, (46), 13 states have call successors, (13), 4 states have call predecessors, (13), 13 states have return successors, (22), 18 states have call predecessors, (22), 13 states have call successors, (22) [2023-11-23 22:27:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2023-11-23 22:27:55,041 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 81 transitions. [2023-11-23 22:27:55,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-23 22:27:55,042 INFO L428 stractBuchiCegarLoop]: Abstraction has 67 states and 81 transitions. [2023-11-23 22:27:55,042 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-23 22:27:55,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 81 transitions. [2023-11-23 22:27:55,044 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2023-11-23 22:27:55,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-23 22:27:55,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-23 22:27:55,051 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-23 22:27:55,056 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [72, 72, 60, 60, 60, 18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1] [2023-11-23 22:27:55,056 INFO L748 eck$LassoCheckResult]: Stem: 8309#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 8282#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre16#1, main_#t~pre17#1, main_#t~mem18#1, main_#t~short19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_~a~0#1, main_~b~0#1, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset;main_~a~0#1 := 6;main_~b~0#1 := 6;call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(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#3(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call main_~#f~0#1.base, main_~#f~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 8274#L109-2 [2023-11-23 22:27:55,057 INFO L750 eck$LassoCheckResult]: Loop: 8274#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 8280#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 8281#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 8303#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 8301#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 8271#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8272#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8295#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8268#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8279#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8283#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 8277#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8294#L25-1 assume true; 8307#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8308#L25-1 assume true; 8333#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8332#L25-1 assume true; 8331#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8330#L25-1 assume true; 8328#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8327#L25-1 assume true; 8326#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8311#L25-1 assume true; 8310#func_to_recursive_line_28_to_28_0EXIT >#119#return; 8267#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8269#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8279#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8283#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 8277#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8294#L25-1 assume true; 8307#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8308#L25-1 assume true; 8333#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8332#L25-1 assume true; 8331#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8330#L25-1 assume true; 8328#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8327#L25-1 assume true; 8326#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8311#L25-1 assume true; 8310#func_to_recursive_line_28_to_28_0EXIT >#119#return; 8267#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8269#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8279#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8283#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8284#L41-1 assume true; 8293#func_to_recursive_line_27_to_28_0EXIT >#121#return; 8300#L41-1 assume true; 8315#func_to_recursive_line_27_to_28_0EXIT >#121#return; 8313#L41-1 assume true; 8312#func_to_recursive_line_27_to_28_0EXIT >#125#return; 8304#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8270#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8272#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8295#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8297#L61-1 assume true; 8298#func_to_recursive_line_26_to_27_0EXIT >#127#return; 8299#L61-1 assume true; 8314#func_to_recursive_line_26_to_27_0EXIT >#115#return; 8302#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 8288#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8303#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 8301#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 8296#L81-1 assume true; 8285#func_to_recursive_line_25_to_26_0EXIT >#117#return; 8292#L81-1 assume true; 8318#func_to_recursive_line_25_to_26_0EXIT >#123#return; 8305#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 8306#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 8290#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 8303#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 8301#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 8271#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8272#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8295#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8268#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8279#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8283#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 8277#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8294#L25-1 assume true; 8307#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8308#L25-1 assume true; 8333#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8332#L25-1 assume true; 8331#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8330#L25-1 assume true; 8328#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8327#L25-1 assume true; 8326#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8311#L25-1 assume true; 8310#func_to_recursive_line_28_to_28_0EXIT >#119#return; 8267#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8269#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8279#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8283#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 8277#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8294#L25-1 assume true; 8307#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8308#L25-1 assume true; 8333#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8332#L25-1 assume true; 8331#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8330#L25-1 assume true; 8328#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8327#L25-1 assume true; 8326#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8311#L25-1 assume true; 8310#func_to_recursive_line_28_to_28_0EXIT >#119#return; 8267#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8269#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8279#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8283#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8284#L41-1 assume true; 8293#func_to_recursive_line_27_to_28_0EXIT >#121#return; 8300#L41-1 assume true; 8315#func_to_recursive_line_27_to_28_0EXIT >#121#return; 8313#L41-1 assume true; 8312#func_to_recursive_line_27_to_28_0EXIT >#125#return; 8304#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8270#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8272#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8295#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8297#L61-1 assume true; 8298#func_to_recursive_line_26_to_27_0EXIT >#127#return; 8299#L61-1 assume true; 8314#func_to_recursive_line_26_to_27_0EXIT >#115#return; 8302#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 8288#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8303#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 8301#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 8296#L81-1 assume true; 8285#func_to_recursive_line_25_to_26_0EXIT >#117#return; 8292#L81-1 assume true; 8318#func_to_recursive_line_25_to_26_0EXIT >#123#return; 8321#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 8329#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 8291#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 8303#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 8301#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 8271#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8272#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8295#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8268#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8279#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8283#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 8277#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8294#L25-1 assume true; 8307#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8308#L25-1 assume true; 8333#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8332#L25-1 assume true; 8331#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8330#L25-1 assume true; 8328#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8327#L25-1 assume true; 8326#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8311#L25-1 assume true; 8310#func_to_recursive_line_28_to_28_0EXIT >#119#return; 8267#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8269#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8279#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8283#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 8277#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8294#L25-1 assume true; 8307#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8308#L25-1 assume true; 8333#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8332#L25-1 assume true; 8331#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8330#L25-1 assume true; 8328#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8327#L25-1 assume true; 8326#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8311#L25-1 assume true; 8310#func_to_recursive_line_28_to_28_0EXIT >#119#return; 8267#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8269#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8279#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8283#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8284#L41-1 assume true; 8293#func_to_recursive_line_27_to_28_0EXIT >#121#return; 8300#L41-1 assume true; 8315#func_to_recursive_line_27_to_28_0EXIT >#121#return; 8313#L41-1 assume true; 8312#func_to_recursive_line_27_to_28_0EXIT >#125#return; 8304#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8270#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8272#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8295#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8297#L61-1 assume true; 8298#func_to_recursive_line_26_to_27_0EXIT >#127#return; 8299#L61-1 assume true; 8314#func_to_recursive_line_26_to_27_0EXIT >#115#return; 8302#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 8288#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8303#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 8301#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 8296#L81-1 assume true; 8285#func_to_recursive_line_25_to_26_0EXIT >#117#return; 8292#L81-1 assume true; 8318#func_to_recursive_line_25_to_26_0EXIT >#123#return; 8322#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 8325#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 8286#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 8303#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 8301#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 8271#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8272#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8295#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8268#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8279#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8283#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 8277#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8294#L25-1 assume true; 8307#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8308#L25-1 assume true; 8333#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8332#L25-1 assume true; 8331#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8330#L25-1 assume true; 8328#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8327#L25-1 assume true; 8326#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8311#L25-1 assume true; 8310#func_to_recursive_line_28_to_28_0EXIT >#119#return; 8267#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8269#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8279#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8283#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 8277#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8294#L25-1 assume true; 8307#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8308#L25-1 assume true; 8333#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8332#L25-1 assume true; 8331#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8330#L25-1 assume true; 8328#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8327#L25-1 assume true; 8326#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8311#L25-1 assume true; 8310#func_to_recursive_line_28_to_28_0EXIT >#119#return; 8267#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8269#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8279#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8283#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8284#L41-1 assume true; 8293#func_to_recursive_line_27_to_28_0EXIT >#121#return; 8300#L41-1 assume true; 8315#func_to_recursive_line_27_to_28_0EXIT >#121#return; 8313#L41-1 assume true; 8312#func_to_recursive_line_27_to_28_0EXIT >#125#return; 8304#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8270#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8272#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8295#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8297#L61-1 assume true; 8298#func_to_recursive_line_26_to_27_0EXIT >#127#return; 8299#L61-1 assume true; 8314#func_to_recursive_line_26_to_27_0EXIT >#115#return; 8302#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 8288#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8303#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 8301#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 8296#L81-1 assume true; 8285#func_to_recursive_line_25_to_26_0EXIT >#117#return; 8292#L81-1 assume true; 8318#func_to_recursive_line_25_to_26_0EXIT >#123#return; 8319#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 8324#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 8287#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 8303#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 8301#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 8271#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8272#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8295#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8268#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8279#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8283#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 8277#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8294#L25-1 assume true; 8307#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8308#L25-1 assume true; 8333#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8332#L25-1 assume true; 8331#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8330#L25-1 assume true; 8328#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8327#L25-1 assume true; 8326#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8311#L25-1 assume true; 8310#func_to_recursive_line_28_to_28_0EXIT >#119#return; 8267#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8269#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8279#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8283#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 8277#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8294#L25-1 assume true; 8307#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8308#L25-1 assume true; 8333#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8332#L25-1 assume true; 8331#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8330#L25-1 assume true; 8328#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8327#L25-1 assume true; 8326#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8311#L25-1 assume true; 8310#func_to_recursive_line_28_to_28_0EXIT >#119#return; 8267#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8269#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8279#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8283#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8284#L41-1 assume true; 8293#func_to_recursive_line_27_to_28_0EXIT >#121#return; 8300#L41-1 assume true; 8315#func_to_recursive_line_27_to_28_0EXIT >#121#return; 8313#L41-1 assume true; 8312#func_to_recursive_line_27_to_28_0EXIT >#125#return; 8304#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8270#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8272#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8295#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8297#L61-1 assume true; 8298#func_to_recursive_line_26_to_27_0EXIT >#127#return; 8299#L61-1 assume true; 8314#func_to_recursive_line_26_to_27_0EXIT >#115#return; 8302#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 8288#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8303#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 8301#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 8296#L81-1 assume true; 8285#func_to_recursive_line_25_to_26_0EXIT >#117#return; 8292#L81-1 assume true; 8318#func_to_recursive_line_25_to_26_0EXIT >#123#return; 8320#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 8323#L114-2 assume !!(main_~b~0#1 < 6);call write~int#1(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 8289#L119 call func_to_recursive_line_25_to_26_0(main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#f~0#1.base, main_~#f~0#1.offset);< 8303#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 8301#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~d.base, ~d.offset, 4); 8271#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8272#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8295#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~e.base, ~e.offset, 4); 8268#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8279#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8283#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 8277#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8294#L25-1 assume true; 8307#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8308#L25-1 assume true; 8333#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8332#L25-1 assume true; 8331#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8330#L25-1 assume true; 8328#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8327#L25-1 assume true; 8326#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8311#L25-1 assume true; 8310#func_to_recursive_line_28_to_28_0EXIT >#119#return; 8267#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8269#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8279#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8283#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~f.base, ~f.offset, 4); 8277#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 8276#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 8275#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int#4(~f.base, ~f.offset, 4); 8278#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8294#L25-1 assume true; 8307#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8308#L25-1 assume true; 8333#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8332#L25-1 assume true; 8331#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8330#L25-1 assume true; 8328#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8327#L25-1 assume true; 8326#func_to_recursive_line_28_to_28_0EXIT >#113#return; 8311#L25-1 assume true; 8310#func_to_recursive_line_28_to_28_0EXIT >#119#return; 8267#L47-1 call #t~mem8 := read~int#2(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 8269#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 8279#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem7 := read~int#2(~e.base, ~e.offset, 4); 8283#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8284#L41-1 assume true; 8293#func_to_recursive_line_27_to_28_0EXIT >#121#return; 8300#L41-1 assume true; 8315#func_to_recursive_line_27_to_28_0EXIT >#121#return; 8313#L41-1 assume true; 8312#func_to_recursive_line_27_to_28_0EXIT >#125#return; 8304#L67-1 call #t~mem11 := read~int#3(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 8270#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8272#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem10 := read~int#3(~d.base, ~d.offset, 4); 8295#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8297#L61-1 assume true; 8298#func_to_recursive_line_26_to_27_0EXIT >#127#return; 8299#L61-1 assume true; 8314#func_to_recursive_line_26_to_27_0EXIT >#115#return; 8302#L87-1 call #t~mem14 := read~int#1(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 8288#L92 call func_to_recursive_line_25_to_26_0(~d.base, ~d.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 8303#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem13 := read~int#1(~c.base, ~c.offset, 4); 8301#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 8296#L81-1 assume true; 8285#func_to_recursive_line_25_to_26_0EXIT >#117#return; 8292#L81-1 assume true; 8318#func_to_recursive_line_25_to_26_0EXIT >#123#return; 8317#L119-1 main_#t~pre16#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre16#1; 8316#L114-2 assume !(main_~b~0#1 < 6); 8273#L114-3 main_#t~pre17#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre17#1; 8274#L109-2 [2023-11-23 22:27:55,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:55,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 9 times [2023-11-23 22:27:55,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:55,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591955123] [2023-11-23 22:27:55,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:55,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:27:55,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:27:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:27:55,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:27:55,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:27:55,079 INFO L85 PathProgramCache]: Analyzing trace with hash 512789329, now seen corresponding path program 4 times [2023-11-23 22:27:55,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:27:55,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280600294] [2023-11-23 22:27:55,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:27:55,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:27:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:27:59,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:27:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:00,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:01,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:02,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:02,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:02,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:02,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:02,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:02,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:02,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 22:28:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:03,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:03,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:03,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:03,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 22:28:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 22:28:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 22:28:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-23 22:28:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 22:28:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 22:28:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 22:28:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 22:28:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2023-11-23 22:28:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 22:28:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 22:28:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 22:28:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 22:28:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2023-11-23 22:28:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:04,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 22:28:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 22:28:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 22:28:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 22:28:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 406 [2023-11-23 22:28:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 22:28:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 22:28:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 22:28:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 22:28:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 507 [2023-11-23 22:28:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 22:28:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:28:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 22:28:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 22:28:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-23 22:28:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:28:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 13473 backedges. 163 proven. 1515 refuted. 0 times theorem prover too weak. 11795 trivial. 0 not checked. [2023-11-23 22:28:05,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:28:05,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280600294] [2023-11-23 22:28:05,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280600294] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:28:05,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182031070] [2023-11-23 22:28:05,773 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-23 22:28:05,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:28:05,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:28:05,775 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:28:05,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04b20b7-6005-430f-8a40-cb459d856684/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 22:28:06,923 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-23 22:28:06,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 22:28:06,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 4640 conjuncts, 163 conjunts are in the unsatisfiable core [2023-11-23 22:28:06,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:28:07,048 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