./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 9bd2c7ff 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_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/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_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu --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-9bd2c7f [2023-11-19 07:41:01,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:41:01,928 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-19 07:41:01,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:41:01,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:41:01,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:41:01,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:41:01,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:41:01,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:41:01,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:41:01,972 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:41:01,973 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-19 07:41:01,974 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-19 07:41:01,975 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-19 07:41:01,975 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-19 07:41:01,976 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-19 07:41:01,977 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-19 07:41:01,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:41:01,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-19 07:41:01,978 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:41:01,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:41:01,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:41:01,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:41:01,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-19 07:41:01,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-19 07:41:01,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-19 07:41:01,983 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:41:01,983 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:41:01,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:41:01,985 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-19 07:41:01,985 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:41:01,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:41:01,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:41:01,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:41:01,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:41:01,989 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-19 07:41:01,989 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_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/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_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu 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-19 07:41:02,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:41:02,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:41:02,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:41:02,313 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:41:02,314 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:41:02,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2023-11-19 07:41:05,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:41:06,083 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:41:06,084 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2023-11-19 07:41:06,091 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/data/08f459c7d/e36de56592364c49bfc8c4b12efa57f6/FLAG537751c73 [2023-11-19 07:41:06,103 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/data/08f459c7d/e36de56592364c49bfc8c4b12efa57f6 [2023-11-19 07:41:06,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:41:06,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:41:06,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:41:06,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:41:06,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:41:06,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:06" (1/1) ... [2023-11-19 07:41:06,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ac38f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:06, skipping insertion in model container [2023-11-19 07:41:06,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:06" (1/1) ... [2023-11-19 07:41:06,143 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:41:06,354 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:41:06,372 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:41:06,422 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:41:06,452 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:41:06,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:06 WrapperNode [2023-11-19 07:41:06,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:41:06,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:41:06,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:41:06,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:41:06,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:06" (1/1) ... [2023-11-19 07:41:06,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:06" (1/1) ... [2023-11-19 07:41:06,511 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2023-11-19 07:41:06,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:41:06,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:41:06,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:41:06,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:41:06,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:06" (1/1) ... [2023-11-19 07:41:06,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:06" (1/1) ... [2023-11-19 07:41:06,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:06" (1/1) ... [2023-11-19 07:41:06,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:06" (1/1) ... [2023-11-19 07:41:06,558 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:06" (1/1) ... [2023-11-19 07:41:06,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:06" (1/1) ... [2023-11-19 07:41:06,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:06" (1/1) ... [2023-11-19 07:41:06,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:06" (1/1) ... [2023-11-19 07:41:06,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:41:06,589 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:41:06,589 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:41:06,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:41:06,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:06" (1/1) ... [2023-11-19 07:41:06,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:41:06,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:06,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:41:06,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-19 07:41:06,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:41:06,703 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_28_0 [2023-11-19 07:41:06,703 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_28_0 [2023-11-19 07:41:06,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:41:06,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:41:06,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:41:06,705 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2023-11-19 07:41:06,705 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2023-11-19 07:41:06,705 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_28_0 [2023-11-19 07:41:06,706 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_28_0 [2023-11-19 07:41:06,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:41:06,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:41:06,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:41:06,707 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2023-11-19 07:41:06,707 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2023-11-19 07:41:06,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:41:06,808 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:41:06,810 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:41:07,138 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:41:07,162 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:41:07,162 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 07:41:07,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:07 BoogieIcfgContainer [2023-11-19 07:41:07,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:41:07,172 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-19 07:41:07,173 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-19 07:41:07,177 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-19 07:41:07,178 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:41:07,179 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 07:41:06" (1/3) ... [2023-11-19 07:41:07,180 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60bdebe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:41:07, skipping insertion in model container [2023-11-19 07:41:07,181 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:41:07,181 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:06" (2/3) ... [2023-11-19 07:41:07,183 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60bdebe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:41:07, skipping insertion in model container [2023-11-19 07:41:07,184 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:41:07,184 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:07" (3/3) ... [2023-11-19 07:41:07,186 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_6.c [2023-11-19 07:41:07,263 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-19 07:41:07,263 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-19 07:41:07,263 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-19 07:41:07,263 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-19 07:41:07,263 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-19 07:41:07,264 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-19 07:41:07,264 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-19 07:41:07,264 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-19 07:41:07,270 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-19 07:41:07,299 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:41:07,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:41:07,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:41:07,306 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:41:07,306 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-19 07:41:07,307 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-19 07:41:07,307 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-19 07:41:07,319 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:41:07,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:41:07,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:41:07,320 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:41:07,320 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-19 07:41:07,328 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(48, 1, 0, 1);call write~init~int(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(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(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(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(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 34#L109-2true [2023-11-19 07:41:07,328 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-19 07:41:07,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:07,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2023-11-19 07:41:07,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:07,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878658082] [2023-11-19 07:41:07,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:07,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:07,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:41:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:07,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:41:07,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:07,634 INFO L85 PathProgramCache]: Analyzing trace with hash 71729, now seen corresponding path program 1 times [2023-11-19 07:41:07,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:07,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953501288] [2023-11-19 07:41:07,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:07,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:07,745 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-19 07:41:07,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:07,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953501288] [2023-11-19 07:41:07,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953501288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:07,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:07,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:41:07,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583545228] [2023-11-19 07:41:07,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:07,754 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:41:07,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:07,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:41:07,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:41:07,810 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-19 07:41:07,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:07,952 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2023-11-19 07:41:07,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. [2023-11-19 07:41:07,967 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2023-11-19 07:41:07,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 36 states and 46 transitions. [2023-11-19 07:41:07,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2023-11-19 07:41:07,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2023-11-19 07:41:07,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2023-11-19 07:41:07,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:41:07,985 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2023-11-19 07:41:08,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2023-11-19 07:41:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2023-11-19 07:41:08,015 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-19 07:41:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2023-11-19 07:41:08,018 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 43 transitions. [2023-11-19 07:41:08,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:41:08,023 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2023-11-19 07:41:08,023 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-19 07:41:08,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2023-11-19 07:41:08,025 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-19 07:41:08,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:41:08,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:41:08,026 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:41:08,027 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:41:08,027 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(48, 1, 0, 1);call write~init~int(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(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(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(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(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 109#L109-2 [2023-11-19 07:41:08,027 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(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(~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-19 07:41:08,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:08,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2023-11-19 07:41:08,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:08,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878130146] [2023-11-19 07:41:08,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:08,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:08,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:41:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:08,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:41:08,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:08,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1371427203, now seen corresponding path program 1 times [2023-11-19 07:41:08,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:08,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374266806] [2023-11-19 07:41:08,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:08,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:08,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:08,478 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-19 07:41:08,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:08,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374266806] [2023-11-19 07:41:08,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374266806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:08,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:08,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:41:08,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460332260] [2023-11-19 07:41:08,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:08,482 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:41:08,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:08,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:41:08,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:41:08,484 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-19 07:41:08,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:08,728 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2023-11-19 07:41:08,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 54 transitions. [2023-11-19 07:41:08,734 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-19 07:41:08,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 54 transitions. [2023-11-19 07:41:08,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-19 07:41:08,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-19 07:41:08,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2023-11-19 07:41:08,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:41:08,748 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 54 transitions. [2023-11-19 07:41:08,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2023-11-19 07:41:08,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2023-11-19 07:41:08,761 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-19 07:41:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2023-11-19 07:41:08,765 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2023-11-19 07:41:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:41:08,767 INFO L428 stractBuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2023-11-19 07:41:08,768 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-19 07:41:08,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2023-11-19 07:41:08,771 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-19 07:41:08,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:41:08,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:41:08,775 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:41:08,775 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-19 07:41:08,776 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(48, 1, 0, 1);call write~init~int(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(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(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(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(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 205#L109-2 [2023-11-19 07:41:08,776 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(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(~c.base, ~c.offset, 4); 227#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(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(~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(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(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(~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-19 07:41:08,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:08,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 3 times [2023-11-19 07:41:08,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:08,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848056266] [2023-11-19 07:41:08,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:08,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:08,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:41:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:08,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:41:08,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:08,803 INFO L85 PathProgramCache]: Analyzing trace with hash 182328154, now seen corresponding path program 1 times [2023-11-19 07:41:08,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:08,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398387594] [2023-11-19 07:41:08,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:08,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:08,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:09,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:09,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:41:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:09,233 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-19 07:41:09,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:09,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398387594] [2023-11-19 07:41:09,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398387594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:09,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:09,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:41:09,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047941158] [2023-11-19 07:41:09,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:09,236 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:41:09,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:09,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:41:09,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:41:09,237 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-19 07:41:09,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:09,394 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2023-11-19 07:41:09,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2023-11-19 07:41:09,399 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-19 07:41:09,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 53 transitions. [2023-11-19 07:41:09,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-19 07:41:09,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-19 07:41:09,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2023-11-19 07:41:09,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:41:09,406 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2023-11-19 07:41:09,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2023-11-19 07:41:09,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2023-11-19 07:41:09,415 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-19 07:41:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2023-11-19 07:41:09,436 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2023-11-19 07:41:09,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:41:09,437 INFO L428 stractBuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2023-11-19 07:41:09,437 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-19 07:41:09,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2023-11-19 07:41:09,438 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-19 07:41:09,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:41:09,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:41:09,440 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:41:09,440 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-19 07:41:09,440 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(48, 1, 0, 1);call write~init~int(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(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(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(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(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 319#L109-2 [2023-11-19 07:41:09,440 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(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(~c.base, ~c.offset, 4); 341#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(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(~d.base, ~d.offset, 4); 334#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(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(~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(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(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(~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(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(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(~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-19 07:41:09,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:09,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 4 times [2023-11-19 07:41:09,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:09,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518559039] [2023-11-19 07:41:09,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:09,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:09,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:41:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:09,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:41:09,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:09,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2098832724, now seen corresponding path program 1 times [2023-11-19 07:41:09,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:09,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723357296] [2023-11-19 07:41:09,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:09,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:09,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:09,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:09,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:09,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:41:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:09,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-19 07:41:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:09,995 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-19 07:41:09,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:09,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723357296] [2023-11-19 07:41:09,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723357296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:09,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:09,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:41:09,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130366946] [2023-11-19 07:41:09,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:09,999 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:41:09,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:09,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:41:10,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:41:10,000 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-19 07:41:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:10,143 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2023-11-19 07:41:10,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2023-11-19 07:41:10,149 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-19 07:41:10,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2023-11-19 07:41:10,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-19 07:41:10,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-19 07:41:10,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2023-11-19 07:41:10,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:41:10,159 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2023-11-19 07:41:10,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2023-11-19 07:41:10,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2023-11-19 07:41:10,167 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-19 07:41:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2023-11-19 07:41:10,169 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2023-11-19 07:41:10,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:41:10,173 INFO L428 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2023-11-19 07:41:10,173 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-19 07:41:10,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2023-11-19 07:41:10,174 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-19 07:41:10,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:41:10,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:41:10,176 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:41:10,176 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-19 07:41:10,177 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(48, 1, 0, 1);call write~init~int(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(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(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(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(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 465#L109-2 [2023-11-19 07:41:10,177 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(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(~c.base, ~c.offset, 4); 487#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(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(~d.base, ~d.offset, 4); 480#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(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(~e.base, ~e.offset, 4); 477#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(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(~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(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(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(~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(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(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(~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(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(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(~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-19 07:41:10,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:10,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 5 times [2023-11-19 07:41:10,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:10,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139780134] [2023-11-19 07:41:10,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:10,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:10,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:41:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:10,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:41:10,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:10,201 INFO L85 PathProgramCache]: Analyzing trace with hash 500602406, now seen corresponding path program 1 times [2023-11-19 07:41:10,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:10,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721221277] [2023-11-19 07:41:10,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:10,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:10,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:10,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:10,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:10,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:10,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:41:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:10,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-19 07:41:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:10,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-19 07:41:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:10,878 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-19 07:41:10,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:10,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721221277] [2023-11-19 07:41:10,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721221277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:10,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:10,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:41:10,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701929955] [2023-11-19 07:41:10,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:10,886 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:41:10,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:10,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:41:10,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:41:10,887 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-19 07:41:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:11,027 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2023-11-19 07:41:11,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2023-11-19 07:41:11,031 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-19 07:41:11,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2023-11-19 07:41:11,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-19 07:41:11,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-19 07:41:11,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2023-11-19 07:41:11,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:41:11,036 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-11-19 07:41:11,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2023-11-19 07:41:11,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-19 07:41:11,045 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-19 07:41:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2023-11-19 07:41:11,045 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-11-19 07:41:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:41:11,049 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-11-19 07:41:11,049 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-19 07:41:11,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 51 transitions. [2023-11-19 07:41:11,051 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2023-11-19 07:41:11,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:41:11,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:41:11,053 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:41:11,053 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-19 07:41:11,054 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(48, 1, 0, 1);call write~init~int(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(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(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(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(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 651#L109-2 [2023-11-19 07:41:11,054 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(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(~c.base, ~c.offset, 4); 676#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(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(~d.base, ~d.offset, 4); 669#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(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(~e.base, ~e.offset, 4); 666#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(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(~f.base, ~f.offset, 4); 658#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(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(~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(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(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(~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(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(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(~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(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(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(~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-19 07:41:11,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:11,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 6 times [2023-11-19 07:41:11,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:11,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704083825] [2023-11-19 07:41:11,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:11,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:11,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:41:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:11,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:41:11,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:11,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1994055486, now seen corresponding path program 1 times [2023-11-19 07:41:11,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:11,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322651603] [2023-11-19 07:41:11,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:11,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:11,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:11,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:11,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:11,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:11,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:11,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-19 07:41:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:11,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-19 07:41:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:11,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:41:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:11,321 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-19 07:41:11,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:11,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322651603] [2023-11-19 07:41:11,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322651603] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:41:11,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964084616] [2023-11-19 07:41:11,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:11,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:11,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:11,328 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:41:11,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:41:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:11,520 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 07:41:11,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:41:11,607 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-19 07:41:11,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:41:11,792 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-19 07:41:11,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964084616] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:41:11,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:41:11,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2023-11-19 07:41:11,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714156610] [2023-11-19 07:41:11,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:41:11,794 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:41:11,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:11,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:41:11,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:41:11,795 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. cyclomatic complexity: 14 Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-19 07:41:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:11,953 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2023-11-19 07:41:11,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2023-11-19 07:41:11,955 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2023-11-19 07:41:11,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 63 transitions. [2023-11-19 07:41:11,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2023-11-19 07:41:11,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2023-11-19 07:41:11,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2023-11-19 07:41:11,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:41:11,958 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-11-19 07:41:11,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2023-11-19 07:41:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-19 07:41:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.15625) internal successors, (37), 35 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2023-11-19 07:41:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2023-11-19 07:41:11,964 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-11-19 07:41:11,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:41:11,966 INFO L428 stractBuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-11-19 07:41:11,966 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-19 07:41:11,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 63 transitions. [2023-11-19 07:41:11,967 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2023-11-19 07:41:11,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:41:11,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:41:11,972 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:41:11,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [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, 4, 4, 4, 1, 1, 1] [2023-11-19 07:41:11,972 INFO L748 eck$LassoCheckResult]: Stem: 1191#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1163#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(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(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(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(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 1157#L109-2 [2023-11-19 07:41:11,973 INFO L750 eck$LassoCheckResult]: Loop: 1157#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1164#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1165#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);< 1184#$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(~c.base, ~c.offset, 4); 1182#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 1154#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1155#$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(~d.base, ~d.offset, 4); 1175#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 1151#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1162#$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(~e.base, ~e.offset, 4); 1172#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 1160#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1158#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 1161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1159#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1158#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 1161#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1176#L25-1 assume true; 1190#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1188#L25-1 assume true; 1189#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1150#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1152#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1162#$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(~e.base, ~e.offset, 4); 1172#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1173#L41-1 assume true; 1174#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1181#L41-1 assume true; 1193#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1185#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1153#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1155#$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(~d.base, ~d.offset, 4); 1175#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1178#L61-1 assume true; 1179#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1180#L61-1 assume true; 1192#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1183#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1169#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);< 1184#$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(~c.base, ~c.offset, 4); 1182#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1177#L81-1 assume true; 1166#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1171#L81-1 assume true; 1196#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1186#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; 1187#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1168#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);< 1184#$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(~c.base, ~c.offset, 4); 1182#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 1154#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1155#$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(~d.base, ~d.offset, 4); 1175#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 1151#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1162#$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(~e.base, ~e.offset, 4); 1172#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 1160#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1158#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 1161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1159#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1158#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 1161#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1176#L25-1 assume true; 1190#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1188#L25-1 assume true; 1189#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1150#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1152#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1162#$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(~e.base, ~e.offset, 4); 1172#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1173#L41-1 assume true; 1174#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1181#L41-1 assume true; 1193#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1185#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1153#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1155#$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(~d.base, ~d.offset, 4); 1175#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1178#L61-1 assume true; 1179#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1180#L61-1 assume true; 1192#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1183#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1169#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);< 1184#$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(~c.base, ~c.offset, 4); 1182#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1177#L81-1 assume true; 1166#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1171#L81-1 assume true; 1196#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1197#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; 1200#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1170#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);< 1184#$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(~c.base, ~c.offset, 4); 1182#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 1154#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1155#$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(~d.base, ~d.offset, 4); 1175#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 1151#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1162#$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(~e.base, ~e.offset, 4); 1172#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 1160#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1158#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 1161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1159#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1158#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 1161#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1176#L25-1 assume true; 1190#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1188#L25-1 assume true; 1189#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1150#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1152#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1162#$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(~e.base, ~e.offset, 4); 1172#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1173#L41-1 assume true; 1174#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1181#L41-1 assume true; 1193#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1185#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1153#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1155#$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(~d.base, ~d.offset, 4); 1175#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1178#L61-1 assume true; 1179#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1180#L61-1 assume true; 1192#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1183#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1169#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);< 1184#$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(~c.base, ~c.offset, 4); 1182#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1177#L81-1 assume true; 1166#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1171#L81-1 assume true; 1196#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1198#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; 1199#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 1167#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);< 1184#$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(~c.base, ~c.offset, 4); 1182#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 1154#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1155#$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(~d.base, ~d.offset, 4); 1175#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 1151#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1162#$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(~e.base, ~e.offset, 4); 1172#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 1160#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1158#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 1161#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 1159#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 1158#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 1161#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1176#L25-1 assume true; 1190#func_to_recursive_line_28_to_28_0EXIT >#113#return; 1188#L25-1 assume true; 1189#func_to_recursive_line_28_to_28_0EXIT >#119#return; 1150#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 1152#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 1162#$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(~e.base, ~e.offset, 4); 1172#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1173#L41-1 assume true; 1174#func_to_recursive_line_27_to_28_0EXIT >#121#return; 1181#L41-1 assume true; 1193#func_to_recursive_line_27_to_28_0EXIT >#125#return; 1185#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 1153#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 1155#$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(~d.base, ~d.offset, 4); 1175#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1178#L61-1 assume true; 1179#func_to_recursive_line_26_to_27_0EXIT >#127#return; 1180#L61-1 assume true; 1192#func_to_recursive_line_26_to_27_0EXIT >#115#return; 1183#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 1169#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);< 1184#$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(~c.base, ~c.offset, 4); 1182#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1177#L81-1 assume true; 1166#func_to_recursive_line_25_to_26_0EXIT >#117#return; 1171#L81-1 assume true; 1196#func_to_recursive_line_25_to_26_0EXIT >#123#return; 1195#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; 1194#L114-2 assume !(main_~b~0#1 < 6); 1156#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; 1157#L109-2 [2023-11-19 07:41:11,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:11,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 7 times [2023-11-19 07:41:11,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:11,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117525018] [2023-11-19 07:41:11,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:11,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:11,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:41:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:11,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:41:11,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:11,994 INFO L85 PathProgramCache]: Analyzing trace with hash -2143273103, now seen corresponding path program 2 times [2023-11-19 07:41:11,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:11,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618174576] [2023-11-19 07:41:11,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:11,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:13,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:13,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:13,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:13,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:13,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:13,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-19 07:41:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:13,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-19 07:41:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:13,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:41:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:13,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-19 07:41:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:13,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:13,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:13,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:13,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:13,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-19 07:41:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:13,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-19 07:41:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:13,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:41:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:13,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-19 07:41:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:13,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:14,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:14,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:14,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:14,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-19 07:41:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:14,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-19 07:41:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:14,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:41:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:14,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-19 07:41:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:14,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:14,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:14,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:14,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:14,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-19 07:41:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:14,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-19 07:41:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:14,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:41:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 13 proven. 99 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2023-11-19 07:41:14,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:14,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618174576] [2023-11-19 07:41:14,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618174576] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:41:14,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406261963] [2023-11-19 07:41:14,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:41:14,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:14,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:14,209 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:41:14,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:41:14,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:41:14,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:41:14,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 07:41:14,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:41:14,711 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2023-11-19 07:41:14,712 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:41:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2023-11-19 07:41:15,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406261963] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:41:15,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:41:15,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2023-11-19 07:41:15,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961122256] [2023-11-19 07:41:15,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:41:15,129 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:41:15,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:15,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-19 07:41:15,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-19 07:41:15,130 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. cyclomatic complexity: 17 Second operand has 15 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 states have internal predecessors, (56), 9 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2023-11-19 07:41:15,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:15,448 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2023-11-19 07:41:15,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 73 transitions. [2023-11-19 07:41:15,450 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2023-11-19 07:41:15,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 73 transitions. [2023-11-19 07:41:15,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2023-11-19 07:41:15,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2023-11-19 07:41:15,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 73 transitions. [2023-11-19 07:41:15,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:41:15,454 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 73 transitions. [2023-11-19 07:41:15,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 73 transitions. [2023-11-19 07:41:15,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-19 07:41:15,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 13 states have call successors, (13), 4 states have call predecessors, (13), 9 states have return successors, (18), 14 states have call predecessors, (18), 13 states have call successors, (18) [2023-11-19 07:41:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2023-11-19 07:41:15,460 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 73 transitions. [2023-11-19 07:41:15,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-19 07:41:15,462 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 73 transitions. [2023-11-19 07:41:15,462 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-19 07:41:15,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 73 transitions. [2023-11-19 07:41:15,463 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2023-11-19 07:41:15,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:41:15,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:41:15,470 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:41:15,470 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 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, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1] [2023-11-19 07:41:15,470 INFO L748 eck$LassoCheckResult]: Stem: 2890#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 2863#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(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(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(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(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 2855#L109-2 [2023-11-19 07:41:15,471 INFO L750 eck$LassoCheckResult]: Loop: 2855#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 2861#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2862#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);< 2884#$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(~c.base, ~c.offset, 4); 2882#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 2852#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2853#$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(~d.base, ~d.offset, 4); 2875#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 2849#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2860#$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(~e.base, ~e.offset, 4); 2872#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 2857#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2856#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 2859#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2858#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2856#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 2859#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2858#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2856#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 2859#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2876#L25-1 assume true; 2888#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2889#L25-1 assume true; 2897#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2892#L25-1 assume true; 2891#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2848#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2850#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2860#$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(~e.base, ~e.offset, 4); 2872#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2873#L41-1 assume true; 2874#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2881#L41-1 assume true; 2893#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2885#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2851#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2853#$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(~d.base, ~d.offset, 4); 2875#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2878#L61-1 assume true; 2879#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2880#L61-1 assume true; 2894#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2883#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2869#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);< 2884#$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(~c.base, ~c.offset, 4); 2882#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2877#L81-1 assume true; 2864#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2871#L81-1 assume true; 2898#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2886#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; 2887#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2865#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);< 2884#$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(~c.base, ~c.offset, 4); 2882#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 2852#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2853#$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(~d.base, ~d.offset, 4); 2875#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 2849#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2860#$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(~e.base, ~e.offset, 4); 2872#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 2857#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2856#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 2859#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2858#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2856#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 2859#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2858#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2856#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 2859#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2876#L25-1 assume true; 2888#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2889#L25-1 assume true; 2897#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2892#L25-1 assume true; 2891#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2848#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2850#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2860#$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(~e.base, ~e.offset, 4); 2872#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2873#L41-1 assume true; 2874#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2881#L41-1 assume true; 2893#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2885#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2851#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2853#$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(~d.base, ~d.offset, 4); 2875#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2878#L61-1 assume true; 2879#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2880#L61-1 assume true; 2894#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2883#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2869#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);< 2884#$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(~c.base, ~c.offset, 4); 2882#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2877#L81-1 assume true; 2864#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2871#L81-1 assume true; 2898#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2899#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; 2906#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2866#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);< 2884#$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(~c.base, ~c.offset, 4); 2882#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 2852#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2853#$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(~d.base, ~d.offset, 4); 2875#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 2849#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2860#$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(~e.base, ~e.offset, 4); 2872#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 2857#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2856#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 2859#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2858#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2856#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 2859#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2858#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2856#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 2859#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2876#L25-1 assume true; 2888#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2889#L25-1 assume true; 2897#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2892#L25-1 assume true; 2891#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2848#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2850#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2860#$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(~e.base, ~e.offset, 4); 2872#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2873#L41-1 assume true; 2874#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2881#L41-1 assume true; 2893#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2885#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2851#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2853#$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(~d.base, ~d.offset, 4); 2875#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2878#L61-1 assume true; 2879#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2880#L61-1 assume true; 2894#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2883#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2869#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);< 2884#$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(~c.base, ~c.offset, 4); 2882#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2877#L81-1 assume true; 2864#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2871#L81-1 assume true; 2898#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2900#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; 2905#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2867#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);< 2884#$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(~c.base, ~c.offset, 4); 2882#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 2852#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2853#$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(~d.base, ~d.offset, 4); 2875#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 2849#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2860#$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(~e.base, ~e.offset, 4); 2872#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 2857#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2856#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 2859#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2858#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2856#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 2859#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2858#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2856#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 2859#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2876#L25-1 assume true; 2888#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2889#L25-1 assume true; 2897#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2892#L25-1 assume true; 2891#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2848#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2850#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2860#$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(~e.base, ~e.offset, 4); 2872#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2873#L41-1 assume true; 2874#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2881#L41-1 assume true; 2893#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2885#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2851#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2853#$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(~d.base, ~d.offset, 4); 2875#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2878#L61-1 assume true; 2879#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2880#L61-1 assume true; 2894#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2883#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2869#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);< 2884#$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(~c.base, ~c.offset, 4); 2882#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2877#L81-1 assume true; 2864#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2871#L81-1 assume true; 2898#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2901#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; 2904#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2868#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);< 2884#$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(~c.base, ~c.offset, 4); 2882#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 2852#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2853#$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(~d.base, ~d.offset, 4); 2875#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 2849#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2860#$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(~e.base, ~e.offset, 4); 2872#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 2857#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2856#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 2859#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2858#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2856#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 2859#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2858#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2856#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 2859#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2876#L25-1 assume true; 2888#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2889#L25-1 assume true; 2897#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2892#L25-1 assume true; 2891#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2848#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2850#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2860#$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(~e.base, ~e.offset, 4); 2872#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2873#L41-1 assume true; 2874#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2881#L41-1 assume true; 2893#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2885#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2851#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2853#$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(~d.base, ~d.offset, 4); 2875#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2878#L61-1 assume true; 2879#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2880#L61-1 assume true; 2894#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2883#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2869#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);< 2884#$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(~c.base, ~c.offset, 4); 2882#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2877#L81-1 assume true; 2864#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2871#L81-1 assume true; 2898#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2902#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; 2903#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 2870#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);< 2884#$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(~c.base, ~c.offset, 4); 2882#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 2852#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2853#$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(~d.base, ~d.offset, 4); 2875#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 2849#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2860#$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(~e.base, ~e.offset, 4); 2872#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 2857#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2856#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 2859#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2858#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2856#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 2859#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 2858#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 2856#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 2859#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2876#L25-1 assume true; 2888#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2889#L25-1 assume true; 2897#func_to_recursive_line_28_to_28_0EXIT >#113#return; 2892#L25-1 assume true; 2891#func_to_recursive_line_28_to_28_0EXIT >#119#return; 2848#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 2850#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 2860#$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(~e.base, ~e.offset, 4); 2872#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2873#L41-1 assume true; 2874#func_to_recursive_line_27_to_28_0EXIT >#121#return; 2881#L41-1 assume true; 2893#func_to_recursive_line_27_to_28_0EXIT >#125#return; 2885#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 2851#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 2853#$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(~d.base, ~d.offset, 4); 2875#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2878#L61-1 assume true; 2879#func_to_recursive_line_26_to_27_0EXIT >#127#return; 2880#L61-1 assume true; 2894#func_to_recursive_line_26_to_27_0EXIT >#115#return; 2883#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 2869#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);< 2884#$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(~c.base, ~c.offset, 4); 2882#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2877#L81-1 assume true; 2864#func_to_recursive_line_25_to_26_0EXIT >#117#return; 2871#L81-1 assume true; 2898#func_to_recursive_line_25_to_26_0EXIT >#123#return; 2896#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; 2895#L114-2 assume !(main_~b~0#1 < 6); 2854#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; 2855#L109-2 [2023-11-19 07:41:15,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:15,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 8 times [2023-11-19 07:41:15,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:15,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113042697] [2023-11-19 07:41:15,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:15,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:15,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:41:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:15,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:41:15,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:15,490 INFO L85 PathProgramCache]: Analyzing trace with hash -889787645, now seen corresponding path program 3 times [2023-11-19 07:41:15,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:15,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271452510] [2023-11-19 07:41:15,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:15,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:17,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:17,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:41:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:41:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:41:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-19 07:41:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:41:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:41:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:41:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-19 07:41:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:41:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:41:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:41:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-19 07:41:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:41:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:41:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:41:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-11-19 07:41:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:41:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:41:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:41:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-11-19 07:41:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 07:41:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-19 07:41:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-19 07:41:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 19 proven. 258 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2023-11-19 07:41:19,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:19,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271452510] [2023-11-19 07:41:19,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271452510] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:41:19,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475774994] [2023-11-19 07:41:19,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 07:41:19,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:19,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:19,232 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:41:19,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:41:20,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-11-19 07:41:20,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:41:20,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-19 07:41:20,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:41:20,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:41:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 472 proven. 8 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2023-11-19 07:41:21,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:41:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 312 proven. 13 refuted. 0 times theorem prover too weak. 1331 trivial. 0 not checked. [2023-11-19 07:41:23,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475774994] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:41:23,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:41:23,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 31 [2023-11-19 07:41:23,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136109667] [2023-11-19 07:41:23,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:41:23,132 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:41:23,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:23,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-19 07:41:23,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2023-11-19 07:41:23,135 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. cyclomatic complexity: 19 Second operand has 31 states, 23 states have (on average 3.130434782608696) internal successors, (72), 27 states have internal predecessors, (72), 12 states have call successors, (36), 6 states have call predecessors, (36), 9 states have return successors, (29), 7 states have call predecessors, (29), 12 states have call successors, (29) [2023-11-19 07:41:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:23,776 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2023-11-19 07:41:23,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. [2023-11-19 07:41:23,778 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2023-11-19 07:41:23,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 63 states and 77 transitions. [2023-11-19 07:41:23,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2023-11-19 07:41:23,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2023-11-19 07:41:23,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 77 transitions. [2023-11-19 07:41:23,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:41:23,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 77 transitions. [2023-11-19 07:41:23,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 77 transitions. [2023-11-19 07:41:23,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-11-19 07:41:23,796 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-19 07:41:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2023-11-19 07:41:23,801 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 77 transitions. [2023-11-19 07:41:23,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-19 07:41:23,803 INFO L428 stractBuchiCegarLoop]: Abstraction has 63 states and 77 transitions. [2023-11-19 07:41:23,804 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-19 07:41:23,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 77 transitions. [2023-11-19 07:41:23,805 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2023-11-19 07:41:23,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:41:23,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:41:23,816 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:41:23,817 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 24, 24, 24, 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, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1] [2023-11-19 07:41:23,817 INFO L748 eck$LassoCheckResult]: Stem: 5762#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 5733#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(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(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(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(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 5727#L109-2 [2023-11-19 07:41:23,818 INFO L750 eck$LassoCheckResult]: Loop: 5727#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 5734#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 5735#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);< 5756#$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(~c.base, ~c.offset, 4); 5754#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 5724#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5725#$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(~d.base, ~d.offset, 4); 5747#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 5721#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5732#$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(~e.base, ~e.offset, 4); 5744#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 5729#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5748#L25-1 assume true; 5760#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5761#L25-1 assume true; 5769#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5768#L25-1 assume true; 5767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5766#L25-1 assume true; 5765#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5764#L25-1 assume true; 5763#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5720#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5722#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5732#$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(~e.base, ~e.offset, 4); 5744#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5745#L41-1 assume true; 5746#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5753#L41-1 assume true; 5770#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5757#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5723#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5725#$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(~d.base, ~d.offset, 4); 5747#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5750#L61-1 assume true; 5751#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5752#L61-1 assume true; 5771#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5755#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5738#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);< 5756#$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(~c.base, ~c.offset, 4); 5754#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 5749#L81-1 assume true; 5736#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5743#L81-1 assume true; 5774#func_to_recursive_line_25_to_26_0EXIT >#123#return; 5758#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; 5759#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 5740#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);< 5756#$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(~c.base, ~c.offset, 4); 5754#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 5724#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5725#$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(~d.base, ~d.offset, 4); 5747#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 5721#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5732#$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(~e.base, ~e.offset, 4); 5744#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 5729#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5748#L25-1 assume true; 5760#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5761#L25-1 assume true; 5769#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5768#L25-1 assume true; 5767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5766#L25-1 assume true; 5765#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5764#L25-1 assume true; 5763#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5720#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5722#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5732#$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(~e.base, ~e.offset, 4); 5744#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5745#L41-1 assume true; 5746#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5753#L41-1 assume true; 5770#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5757#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5723#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5725#$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(~d.base, ~d.offset, 4); 5747#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5750#L61-1 assume true; 5751#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5752#L61-1 assume true; 5771#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5755#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5738#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);< 5756#$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(~c.base, ~c.offset, 4); 5754#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 5749#L81-1 assume true; 5736#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5743#L81-1 assume true; 5774#func_to_recursive_line_25_to_26_0EXIT >#123#return; 5776#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; 5782#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 5741#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);< 5756#$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(~c.base, ~c.offset, 4); 5754#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 5724#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5725#$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(~d.base, ~d.offset, 4); 5747#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 5721#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5732#$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(~e.base, ~e.offset, 4); 5744#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 5729#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5748#L25-1 assume true; 5760#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5761#L25-1 assume true; 5769#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5768#L25-1 assume true; 5767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5766#L25-1 assume true; 5765#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5764#L25-1 assume true; 5763#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5720#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5722#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5732#$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(~e.base, ~e.offset, 4); 5744#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5745#L41-1 assume true; 5746#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5753#L41-1 assume true; 5770#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5757#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5723#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5725#$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(~d.base, ~d.offset, 4); 5747#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5750#L61-1 assume true; 5751#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5752#L61-1 assume true; 5771#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5755#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5738#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);< 5756#$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(~c.base, ~c.offset, 4); 5754#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 5749#L81-1 assume true; 5736#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5743#L81-1 assume true; 5774#func_to_recursive_line_25_to_26_0EXIT >#123#return; 5777#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; 5781#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 5742#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);< 5756#$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(~c.base, ~c.offset, 4); 5754#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 5724#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5725#$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(~d.base, ~d.offset, 4); 5747#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 5721#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5732#$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(~e.base, ~e.offset, 4); 5744#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 5729#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5748#L25-1 assume true; 5760#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5761#L25-1 assume true; 5769#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5768#L25-1 assume true; 5767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5766#L25-1 assume true; 5765#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5764#L25-1 assume true; 5763#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5720#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5722#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5732#$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(~e.base, ~e.offset, 4); 5744#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5745#L41-1 assume true; 5746#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5753#L41-1 assume true; 5770#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5757#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5723#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5725#$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(~d.base, ~d.offset, 4); 5747#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5750#L61-1 assume true; 5751#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5752#L61-1 assume true; 5771#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5755#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5738#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);< 5756#$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(~c.base, ~c.offset, 4); 5754#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 5749#L81-1 assume true; 5736#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5743#L81-1 assume true; 5774#func_to_recursive_line_25_to_26_0EXIT >#123#return; 5778#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; 5780#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 5737#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);< 5756#$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(~c.base, ~c.offset, 4); 5754#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 5724#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5725#$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(~d.base, ~d.offset, 4); 5747#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 5721#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5732#$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(~e.base, ~e.offset, 4); 5744#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 5729#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5748#L25-1 assume true; 5760#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5761#L25-1 assume true; 5769#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5768#L25-1 assume true; 5767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5766#L25-1 assume true; 5765#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5764#L25-1 assume true; 5763#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5720#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5722#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5732#$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(~e.base, ~e.offset, 4); 5744#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5745#L41-1 assume true; 5746#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5753#L41-1 assume true; 5770#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5757#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5723#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5725#$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(~d.base, ~d.offset, 4); 5747#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5750#L61-1 assume true; 5751#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5752#L61-1 assume true; 5771#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5755#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5738#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);< 5756#$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(~c.base, ~c.offset, 4); 5754#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 5749#L81-1 assume true; 5736#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5743#L81-1 assume true; 5774#func_to_recursive_line_25_to_26_0EXIT >#123#return; 5775#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; 5779#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 5739#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);< 5756#$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(~c.base, ~c.offset, 4); 5754#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 5724#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5725#$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(~d.base, ~d.offset, 4); 5747#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 5721#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5732#$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(~e.base, ~e.offset, 4); 5744#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 5729#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 5730#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 5728#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 5731#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5748#L25-1 assume true; 5760#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5761#L25-1 assume true; 5769#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5768#L25-1 assume true; 5767#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5766#L25-1 assume true; 5765#func_to_recursive_line_28_to_28_0EXIT >#113#return; 5764#L25-1 assume true; 5763#func_to_recursive_line_28_to_28_0EXIT >#119#return; 5720#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 5722#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 5732#$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(~e.base, ~e.offset, 4); 5744#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 5745#L41-1 assume true; 5746#func_to_recursive_line_27_to_28_0EXIT >#121#return; 5753#L41-1 assume true; 5770#func_to_recursive_line_27_to_28_0EXIT >#125#return; 5757#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 5723#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 5725#$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(~d.base, ~d.offset, 4); 5747#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 5750#L61-1 assume true; 5751#func_to_recursive_line_26_to_27_0EXIT >#127#return; 5752#L61-1 assume true; 5771#func_to_recursive_line_26_to_27_0EXIT >#115#return; 5755#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 5738#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);< 5756#$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(~c.base, ~c.offset, 4); 5754#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 5749#L81-1 assume true; 5736#func_to_recursive_line_25_to_26_0EXIT >#117#return; 5743#L81-1 assume true; 5774#func_to_recursive_line_25_to_26_0EXIT >#123#return; 5773#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; 5772#L114-2 assume !(main_~b~0#1 < 6); 5726#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; 5727#L109-2 [2023-11-19 07:41:23,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:23,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 9 times [2023-11-19 07:41:23,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:23,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698162009] [2023-11-19 07:41:23,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:23,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:23,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:41:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:23,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:41:23,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:23,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1006688791, now seen corresponding path program 4 times [2023-11-19 07:41:23,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:23,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276847451] [2023-11-19 07:41:23,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:23,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:27,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:27,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:28,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:28,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:41:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:41:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:41:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:41:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:41:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:41:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:41:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-19 07:41:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:41:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:41:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:41:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2023-11-19 07:41:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:41:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:41:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:41:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-11-19 07:41:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:41:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:41:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:41:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2023-11-19 07:41:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:41:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:41:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:41:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2994 backedges. 23 proven. 574 refuted. 0 times theorem prover too weak. 2397 trivial. 0 not checked. [2023-11-19 07:41:30,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:30,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276847451] [2023-11-19 07:41:30,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276847451] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:41:30,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896910253] [2023-11-19 07:41:30,256 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 07:41:30,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:41:30,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:30,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:41:30,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_344cc5e3-3146-4b51-ae9d-2866e702acd6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 07:41:30,887 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 07:41:30,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:41:30,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 2384 conjuncts, 90 conjunts are in the unsatisfiable core [2023-11-19 07:41:30,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:41:30,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:41:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2994 backedges. 672 proven. 24 refuted. 0 times theorem prover too weak. 2298 trivial. 0 not checked. [2023-11-19 07:41:31,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:41:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2994 backedges. 17 proven. 721 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2023-11-19 07:41:35,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896910253] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:41:35,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:41:35,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 22] total 41 [2023-11-19 07:41:35,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503933636] [2023-11-19 07:41:35,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:41:35,282 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:41:35,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:35,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-19 07:41:35,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1365, Unknown=0, NotChecked=0, Total=1640 [2023-11-19 07:41:35,285 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. cyclomatic complexity: 19 Second operand has 41 states, 31 states have (on average 2.774193548387097) internal successors, (86), 35 states have internal predecessors, (86), 14 states have call successors, (44), 8 states have call predecessors, (44), 13 states have return successors, (39), 11 states have call predecessors, (39), 14 states have call successors, (39) [2023-11-19 07:41:36,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:36,215 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2023-11-19 07:41:36,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 81 transitions. [2023-11-19 07:41:36,219 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2023-11-19 07:41:36,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 81 transitions. [2023-11-19 07:41:36,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2023-11-19 07:41:36,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2023-11-19 07:41:36,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 81 transitions. [2023-11-19 07:41:36,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:41:36,223 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 81 transitions. [2023-11-19 07:41:36,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 81 transitions. [2023-11-19 07:41:36,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-19 07:41:36,244 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-19 07:41:36,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2023-11-19 07:41:36,250 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 81 transitions. [2023-11-19 07:41:36,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-19 07:41:36,251 INFO L428 stractBuchiCegarLoop]: Abstraction has 67 states and 81 transitions. [2023-11-19 07:41:36,253 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-19 07:41:36,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 81 transitions. [2023-11-19 07:41:36,254 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 39 [2023-11-19 07:41:36,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:41:36,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:41:36,258 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:41:36,259 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 42, 36, 36, 36, 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, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1] [2023-11-19 07:41:36,259 INFO L748 eck$LassoCheckResult]: Stem: 9454#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 9427#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(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(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(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(6, main_~#f~0#1.base, main_~#f~0#1.offset, 4);main_~a~0#1 := 0; 9419#L109-2 [2023-11-19 07:41:36,260 INFO L750 eck$LassoCheckResult]: Loop: 9419#L109-2 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 9425#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 9426#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);< 9448#$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(~c.base, ~c.offset, 4); 9446#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 9416#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 9417#$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(~d.base, ~d.offset, 4); 9440#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 9413#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 9424#$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(~e.base, ~e.offset, 4); 9428#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 9421#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 9439#L25-1 assume true; 9452#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9453#L25-1 assume true; 9478#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9477#L25-1 assume true; 9476#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9474#L25-1 assume true; 9473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9472#L25-1 assume true; 9470#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9469#L25-1 assume true; 9468#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9456#L25-1 assume true; 9455#func_to_recursive_line_28_to_28_0EXIT >#119#return; 9412#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 9414#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 9424#$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(~e.base, ~e.offset, 4); 9428#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 9429#L41-1 assume true; 9438#func_to_recursive_line_27_to_28_0EXIT >#121#return; 9445#L41-1 assume true; 9457#func_to_recursive_line_27_to_28_0EXIT >#125#return; 9449#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 9415#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 9417#$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(~d.base, ~d.offset, 4); 9440#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 9442#L61-1 assume true; 9443#func_to_recursive_line_26_to_27_0EXIT >#127#return; 9444#L61-1 assume true; 9458#func_to_recursive_line_26_to_27_0EXIT >#115#return; 9447#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 9436#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);< 9448#$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(~c.base, ~c.offset, 4); 9446#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 9441#L81-1 assume true; 9430#func_to_recursive_line_25_to_26_0EXIT >#117#return; 9437#L81-1 assume true; 9461#func_to_recursive_line_25_to_26_0EXIT >#123#return; 9450#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; 9451#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 9432#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);< 9448#$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(~c.base, ~c.offset, 4); 9446#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 9416#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 9417#$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(~d.base, ~d.offset, 4); 9440#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 9413#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 9424#$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(~e.base, ~e.offset, 4); 9428#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 9421#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 9439#L25-1 assume true; 9452#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9453#L25-1 assume true; 9478#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9477#L25-1 assume true; 9476#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9474#L25-1 assume true; 9473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9472#L25-1 assume true; 9470#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9469#L25-1 assume true; 9468#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9456#L25-1 assume true; 9455#func_to_recursive_line_28_to_28_0EXIT >#119#return; 9412#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 9414#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 9424#$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(~e.base, ~e.offset, 4); 9428#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 9429#L41-1 assume true; 9438#func_to_recursive_line_27_to_28_0EXIT >#121#return; 9445#L41-1 assume true; 9457#func_to_recursive_line_27_to_28_0EXIT >#125#return; 9449#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 9415#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 9417#$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(~d.base, ~d.offset, 4); 9440#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 9442#L61-1 assume true; 9443#func_to_recursive_line_26_to_27_0EXIT >#127#return; 9444#L61-1 assume true; 9458#func_to_recursive_line_26_to_27_0EXIT >#115#return; 9447#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 9436#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);< 9448#$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(~c.base, ~c.offset, 4); 9446#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 9441#L81-1 assume true; 9430#func_to_recursive_line_25_to_26_0EXIT >#117#return; 9437#L81-1 assume true; 9461#func_to_recursive_line_25_to_26_0EXIT >#123#return; 9462#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; 9475#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 9433#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);< 9448#$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(~c.base, ~c.offset, 4); 9446#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 9416#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 9417#$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(~d.base, ~d.offset, 4); 9440#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 9413#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 9424#$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(~e.base, ~e.offset, 4); 9428#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 9421#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 9439#L25-1 assume true; 9452#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9453#L25-1 assume true; 9478#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9477#L25-1 assume true; 9476#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9474#L25-1 assume true; 9473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9472#L25-1 assume true; 9470#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9469#L25-1 assume true; 9468#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9456#L25-1 assume true; 9455#func_to_recursive_line_28_to_28_0EXIT >#119#return; 9412#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 9414#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 9424#$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(~e.base, ~e.offset, 4); 9428#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 9429#L41-1 assume true; 9438#func_to_recursive_line_27_to_28_0EXIT >#121#return; 9445#L41-1 assume true; 9457#func_to_recursive_line_27_to_28_0EXIT >#125#return; 9449#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 9415#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 9417#$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(~d.base, ~d.offset, 4); 9440#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 9442#L61-1 assume true; 9443#func_to_recursive_line_26_to_27_0EXIT >#127#return; 9444#L61-1 assume true; 9458#func_to_recursive_line_26_to_27_0EXIT >#115#return; 9447#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 9436#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);< 9448#$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(~c.base, ~c.offset, 4); 9446#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 9441#L81-1 assume true; 9430#func_to_recursive_line_25_to_26_0EXIT >#117#return; 9437#L81-1 assume true; 9461#func_to_recursive_line_25_to_26_0EXIT >#123#return; 9463#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; 9471#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 9434#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);< 9448#$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(~c.base, ~c.offset, 4); 9446#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 9416#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 9417#$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(~d.base, ~d.offset, 4); 9440#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 9413#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 9424#$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(~e.base, ~e.offset, 4); 9428#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 9421#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 9439#L25-1 assume true; 9452#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9453#L25-1 assume true; 9478#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9477#L25-1 assume true; 9476#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9474#L25-1 assume true; 9473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9472#L25-1 assume true; 9470#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9469#L25-1 assume true; 9468#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9456#L25-1 assume true; 9455#func_to_recursive_line_28_to_28_0EXIT >#119#return; 9412#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 9414#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 9424#$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(~e.base, ~e.offset, 4); 9428#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 9429#L41-1 assume true; 9438#func_to_recursive_line_27_to_28_0EXIT >#121#return; 9445#L41-1 assume true; 9457#func_to_recursive_line_27_to_28_0EXIT >#125#return; 9449#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 9415#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 9417#$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(~d.base, ~d.offset, 4); 9440#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 9442#L61-1 assume true; 9443#func_to_recursive_line_26_to_27_0EXIT >#127#return; 9444#L61-1 assume true; 9458#func_to_recursive_line_26_to_27_0EXIT >#115#return; 9447#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 9436#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);< 9448#$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(~c.base, ~c.offset, 4); 9446#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 9441#L81-1 assume true; 9430#func_to_recursive_line_25_to_26_0EXIT >#117#return; 9437#L81-1 assume true; 9461#func_to_recursive_line_25_to_26_0EXIT >#123#return; 9464#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; 9467#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 9435#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);< 9448#$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(~c.base, ~c.offset, 4); 9446#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 9416#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 9417#$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(~d.base, ~d.offset, 4); 9440#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 9413#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 9424#$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(~e.base, ~e.offset, 4); 9428#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 9421#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 9439#L25-1 assume true; 9452#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9453#L25-1 assume true; 9478#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9477#L25-1 assume true; 9476#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9474#L25-1 assume true; 9473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9472#L25-1 assume true; 9470#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9469#L25-1 assume true; 9468#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9456#L25-1 assume true; 9455#func_to_recursive_line_28_to_28_0EXIT >#119#return; 9412#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 9414#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 9424#$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(~e.base, ~e.offset, 4); 9428#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 9429#L41-1 assume true; 9438#func_to_recursive_line_27_to_28_0EXIT >#121#return; 9445#L41-1 assume true; 9457#func_to_recursive_line_27_to_28_0EXIT >#125#return; 9449#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 9415#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 9417#$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(~d.base, ~d.offset, 4); 9440#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 9442#L61-1 assume true; 9443#func_to_recursive_line_26_to_27_0EXIT >#127#return; 9444#L61-1 assume true; 9458#func_to_recursive_line_26_to_27_0EXIT >#115#return; 9447#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 9436#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);< 9448#$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(~c.base, ~c.offset, 4); 9446#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 9441#L81-1 assume true; 9430#func_to_recursive_line_25_to_26_0EXIT >#117#return; 9437#L81-1 assume true; 9461#func_to_recursive_line_25_to_26_0EXIT >#123#return; 9465#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; 9466#L114-2 assume !!(main_~b~0#1 < 6);call write~int(0, main_~#c~0#1.base, main_~#c~0#1.offset, 4); 9431#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);< 9448#$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(~c.base, ~c.offset, 4); 9446#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~d.base, ~d.offset, 4); 9416#L87 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 9417#$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(~d.base, ~d.offset, 4); 9440#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~e.base, ~e.offset, 4); 9413#L67 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 9424#$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(~e.base, ~e.offset, 4); 9428#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~f.base, ~f.offset, 4); 9421#L47 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~f.base, ~f.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~f.base, ~f.offset, 4);havoc #t~mem5;havoc #t~pre6; 9422#L32 call func_to_recursive_line_28_to_28_0(~f.base, ~f.offset);< 9420#$Ultimate##0 ~f.base, ~f.offset := #in~f.base, #in~f.offset;call #t~mem4 := read~int(~f.base, ~f.offset, 4); 9423#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 9439#L25-1 assume true; 9452#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9453#L25-1 assume true; 9478#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9477#L25-1 assume true; 9476#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9474#L25-1 assume true; 9473#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9472#L25-1 assume true; 9470#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9469#L25-1 assume true; 9468#func_to_recursive_line_28_to_28_0EXIT >#113#return; 9456#L25-1 assume true; 9455#func_to_recursive_line_28_to_28_0EXIT >#119#return; 9412#L47-1 call #t~mem8 := read~int(~e.base, ~e.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~e.base, ~e.offset, 4);havoc #t~mem8;havoc #t~pre9; 9414#L52 call func_to_recursive_line_27_to_28_0(~e.base, ~e.offset, ~f.base, ~f.offset);< 9424#$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(~e.base, ~e.offset, 4); 9428#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 9429#L41-1 assume true; 9438#func_to_recursive_line_27_to_28_0EXIT >#121#return; 9445#L41-1 assume true; 9457#func_to_recursive_line_27_to_28_0EXIT >#125#return; 9449#L67-1 call #t~mem11 := read~int(~d.base, ~d.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~d.base, ~d.offset, 4);havoc #t~mem11;havoc #t~pre12; 9415#L72 call func_to_recursive_line_26_to_27_0(~d.base, ~d.offset, ~e.base, ~e.offset, ~f.base, ~f.offset);< 9417#$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(~d.base, ~d.offset, 4); 9440#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 9442#L61-1 assume true; 9443#func_to_recursive_line_26_to_27_0EXIT >#127#return; 9444#L61-1 assume true; 9458#func_to_recursive_line_26_to_27_0EXIT >#115#return; 9447#L87-1 call #t~mem14 := read~int(~c.base, ~c.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~c.base, ~c.offset, 4);havoc #t~mem14;havoc #t~pre15; 9436#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);< 9448#$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(~c.base, ~c.offset, 4); 9446#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 9441#L81-1 assume true; 9430#func_to_recursive_line_25_to_26_0EXIT >#117#return; 9437#L81-1 assume true; 9461#func_to_recursive_line_25_to_26_0EXIT >#123#return; 9460#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; 9459#L114-2 assume !(main_~b~0#1 < 6); 9418#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; 9419#L109-2 [2023-11-19 07:41:36,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:36,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 10 times [2023-11-19 07:41:36,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:36,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616506179] [2023-11-19 07:41:36,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:36,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:36,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:41:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:36,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:41:36,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:36,284 INFO L85 PathProgramCache]: Analyzing trace with hash 265306667, now seen corresponding path program 5 times [2023-11-19 07:41:36,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:36,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972868359] [2023-11-19 07:41:36,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:36,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:36,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:41:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:41:37,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:41:37,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:37,247 INFO L85 PathProgramCache]: Analyzing trace with hash 39397449, now seen corresponding path program 1 times [2023-11-19 07:41:37,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:37,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770614919] [2023-11-19 07:41:37,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:37,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:41,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:41:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:42,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:43,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:43,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:44,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:44,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:44,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:44,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:41:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 07:41:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-19 07:41:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:41:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:41:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 07:41:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-19 07:41:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-19 07:41:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:41:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 07:41:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-19 07:41:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-11-19 07:41:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:41:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 07:41:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-19 07:41:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2023-11-19 07:41:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:41:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 07:41:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-19 07:41:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2023-11-19 07:41:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:41:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat