./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.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_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/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_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/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_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/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 c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:34:39,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:34:39,615 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-19 07:34:39,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:34:39,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:34:39,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:34:39,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:34:39,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:34:39,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:34:39,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:34:39,650 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:34:39,650 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-19 07:34:39,651 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-19 07:34:39,651 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-19 07:34:39,652 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-19 07:34:39,653 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-19 07:34:39,653 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-19 07:34:39,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:34:39,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-19 07:34:39,655 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:34:39,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:34:39,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:34:39,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:34:39,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-19 07:34:39,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-19 07:34:39,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-19 07:34:39,659 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:34:39,660 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:34:39,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:34:39,661 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-19 07:34:39,661 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:34:39,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:34:39,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:34:39,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:34:39,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:34:39,664 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-19 07:34:39,664 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_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/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_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/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 -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2023-11-19 07:34:39,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:34:39,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:34:39,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:34:39,998 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:34:39,999 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:34:40,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2023-11-19 07:34:43,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:34:43,452 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:34:43,452 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2023-11-19 07:34:43,465 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/data/2f786636b/0afdb1dbb57e46438406d966b895cefb/FLAGac7c211af [2023-11-19 07:34:43,486 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/data/2f786636b/0afdb1dbb57e46438406d966b895cefb [2023-11-19 07:34:43,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:34:43,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:34:43,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:34:43,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:34:43,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:34:43,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:34:43" (1/1) ... [2023-11-19 07:34:43,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506b2695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:43, skipping insertion in model container [2023-11-19 07:34:43,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:34:43" (1/1) ... [2023-11-19 07:34:43,553 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:34:43,798 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:34:43,816 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:34:43,867 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:34:43,886 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:34:43,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:43 WrapperNode [2023-11-19 07:34:43,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:34:43,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:34:43,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:34:43,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:34:43,899 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:34:43" (1/1) ... [2023-11-19 07:34:43,922 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:34:43" (1/1) ... [2023-11-19 07:34:43,954 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2023-11-19 07:34:43,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:34:43,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:34:43,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:34:43,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:34:43,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:43" (1/1) ... [2023-11-19 07:34:43,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:43" (1/1) ... [2023-11-19 07:34:43,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:43" (1/1) ... [2023-11-19 07:34:43,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:43" (1/1) ... [2023-11-19 07:34:43,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:43" (1/1) ... [2023-11-19 07:34:43,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:43" (1/1) ... [2023-11-19 07:34:43,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:43" (1/1) ... [2023-11-19 07:34:43,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:43" (1/1) ... [2023-11-19 07:34:43,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:34:43,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:34:43,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:34:43,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:34:43,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:43" (1/1) ... [2023-11-19 07:34:44,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:34:44,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:34:44,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/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:34:44,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/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:34:44,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:34:44,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:34:44,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:34:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:34:44,087 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2023-11-19 07:34:44,087 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2023-11-19 07:34:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2023-11-19 07:34:44,088 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2023-11-19 07:34:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2023-11-19 07:34:44,088 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2023-11-19 07:34:44,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:34:44,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:34:44,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:34:44,089 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2023-11-19 07:34:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2023-11-19 07:34:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2023-11-19 07:34:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2023-11-19 07:34:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:34:44,188 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:34:44,191 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:34:44,606 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:34:44,627 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:34:44,652 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:34:44,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:34:44 BoogieIcfgContainer [2023-11-19 07:34:44,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:34:44,669 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-19 07:34:44,673 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-19 07:34:44,693 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-19 07:34:44,695 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:34:44,696 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 07:34:43" (1/3) ... [2023-11-19 07:34:44,697 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7910e646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:34:44, skipping insertion in model container [2023-11-19 07:34:44,698 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:34:44,698 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:43" (2/3) ... [2023-11-19 07:34:44,700 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7910e646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:34:44, skipping insertion in model container [2023-11-19 07:34:44,700 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:34:44,702 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:34:44" (3/3) ... [2023-11-19 07:34:44,704 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_5.c [2023-11-19 07:34:44,774 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-19 07:34:44,774 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-19 07:34:44,774 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-19 07:34:44,774 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-19 07:34:44,775 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-19 07:34:44,775 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-19 07:34:44,775 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-19 07:34:44,775 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-19 07:34:44,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-19 07:34:44,812 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:34:44,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:34:44,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:34:44,819 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:34:44,819 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:34:44,820 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-19 07:34:44,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-19 07:34:44,826 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:34:44,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:34:44,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:34:44,827 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:34:44,827 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:34:44,835 INFO L748 eck$LassoCheckResult]: Stem: 19#$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); 26#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(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 write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 39#L128true call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 29#$Ultimate##0true [2023-11-19 07:34:44,836 INFO L750 eck$LassoCheckResult]: Loop: 29#$Ultimate##0true ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int(~a.base, ~a.offset, 4); 5#L101true assume #t~mem16 < 6;havoc #t~mem16;call write~int(0, ~b.base, ~b.offset, 4); 6#L107true call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 42#$Ultimate##0true ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int(~b.base, ~b.offset, 4); 25#L81true assume !(#t~mem13 < 6);havoc #t~mem13; 21#L81-1true assume true; 20#func_to_recursive_line_24_to_25_0EXITtrue >#102#return; 3#L107-1true call #t~mem17 := read~int(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 34#L112true call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 29#$Ultimate##0true [2023-11-19 07:34:44,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash 62698, now seen corresponding path program 1 times [2023-11-19 07:34:44,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:44,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563692438] [2023-11-19 07:34:44,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:44,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:34:45,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:34:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:34:45,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:34:45,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:45,159 INFO L85 PathProgramCache]: Analyzing trace with hash -522791940, now seen corresponding path program 1 times [2023-11-19 07:34:45,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:45,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105626161] [2023-11-19 07:34:45,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:45,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:45,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:45,698 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:34:45,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:45,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105626161] [2023-11-19 07:34:45,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105626161] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:45,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:45,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:34:45,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969945093] [2023-11-19 07:34:45,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:45,705 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:34:45,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:45,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:34:45,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:34:45,754 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:34:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:46,036 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2023-11-19 07:34:46,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2023-11-19 07:34:46,051 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:34:46,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 42 states and 53 transitions. [2023-11-19 07:34:46,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-19 07:34:46,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-19 07:34:46,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2023-11-19 07:34:46,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:34:46,070 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2023-11-19 07:34:46,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2023-11-19 07:34:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2023-11-19 07:34:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 25 states have internal predecessors, (25), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-19 07:34:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2023-11-19 07:34:46,107 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2023-11-19 07:34:46,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:34:46,112 INFO L428 stractBuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2023-11-19 07:34:46,112 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-19 07:34:46,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2023-11-19 07:34:46,114 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:34:46,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:34:46,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:34:46,115 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:34:46,115 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:34:46,116 INFO L748 eck$LassoCheckResult]: Stem: 161#$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); 145#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(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 write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 134#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 158#$Ultimate##0 [2023-11-19 07:34:46,116 INFO L750 eck$LassoCheckResult]: Loop: 158#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int(~a.base, ~a.offset, 4); 143#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int(0, ~b.base, ~b.offset, 4); 139#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int(~b.base, ~b.offset, 4); 138#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~c.base, ~c.offset, 4); 141#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 159#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~c.base, ~c.offset, 4); 160#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 149#L61-1 assume true; 146#func_to_recursive_line_25_to_26_0EXIT >#98#return; 148#L87-1 call #t~mem14 := read~int(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 140#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int(~b.base, ~b.offset, 4); 138#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 142#L81-1 assume true; 162#func_to_recursive_line_24_to_25_0EXIT >#100#return; 163#L81-1 assume true; 164#func_to_recursive_line_24_to_25_0EXIT >#102#return; 133#L107-1 call #t~mem17 := read~int(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 135#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 158#$Ultimate##0 [2023-11-19 07:34:46,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:46,117 INFO L85 PathProgramCache]: Analyzing trace with hash 62698, now seen corresponding path program 2 times [2023-11-19 07:34:46,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:46,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985478161] [2023-11-19 07:34:46,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:46,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:34:46,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:34:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:34:46,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:34:46,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:46,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1440713286, now seen corresponding path program 1 times [2023-11-19 07:34:46,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:46,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647071695] [2023-11-19 07:34:46,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:46,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:46,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:46,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:46,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:34:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 07:34:46,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:46,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647071695] [2023-11-19 07:34:46,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647071695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:46,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:46,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:34:46,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344264450] [2023-11-19 07:34:46,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:46,664 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:34:46,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:46,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:34:46,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:34:46,665 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. cyclomatic complexity: 13 Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:34:46,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:46,836 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2023-11-19 07:34:46,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2023-11-19 07:34:46,844 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:34:46,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2023-11-19 07:34:46,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-19 07:34:46,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-19 07:34:46,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2023-11-19 07:34:46,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:34:46,854 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2023-11-19 07:34:46,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2023-11-19 07:34:46,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2023-11-19 07:34:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 26 states have internal predecessors, (26), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-11-19 07:34:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2023-11-19 07:34:46,870 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2023-11-19 07:34:46,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:34:46,872 INFO L428 stractBuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2023-11-19 07:34:46,873 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-19 07:34:46,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2023-11-19 07:34:46,876 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:34:46,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:34:46,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:34:46,881 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:34:46,882 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:34:46,882 INFO L748 eck$LassoCheckResult]: Stem: 277#$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); 259#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(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 write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 249#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 271#$Ultimate##0 [2023-11-19 07:34:46,883 INFO L750 eck$LassoCheckResult]: Loop: 271#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int(~a.base, ~a.offset, 4); 257#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int(0, ~b.base, ~b.offset, 4); 254#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 258#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int(~b.base, ~b.offset, 4); 252#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~c.base, ~c.offset, 4); 255#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 272#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~c.base, ~c.offset, 4); 275#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~d.base, ~d.offset, 4); 265#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 264#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int(~d.base, ~d.offset, 4); 267#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 270#L41-1 assume true; 268#func_to_recursive_line_26_to_27_0EXIT >#106#return; 269#L67-1 call #t~mem11 := read~int(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 261#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 272#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~c.base, ~c.offset, 4); 275#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 276#L61-1 assume true; 260#func_to_recursive_line_25_to_26_0EXIT >#108#return; 262#L61-1 assume true; 274#func_to_recursive_line_25_to_26_0EXIT >#98#return; 273#L87-1 call #t~mem14 := read~int(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 253#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 258#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int(~b.base, ~b.offset, 4); 252#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 256#L81-1 assume true; 278#func_to_recursive_line_24_to_25_0EXIT >#100#return; 279#L81-1 assume true; 280#func_to_recursive_line_24_to_25_0EXIT >#102#return; 247#L107-1 call #t~mem17 := read~int(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 248#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 271#$Ultimate##0 [2023-11-19 07:34:46,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:46,884 INFO L85 PathProgramCache]: Analyzing trace with hash 62698, now seen corresponding path program 3 times [2023-11-19 07:34:46,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:46,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154264957] [2023-11-19 07:34:46,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:46,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:34:46,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:34:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:34:46,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:34:46,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:46,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1736383028, now seen corresponding path program 1 times [2023-11-19 07:34:46,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:46,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144825919] [2023-11-19 07:34:46,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:46,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:47,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:47,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:47,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:47,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:34:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:47,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-19 07:34:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 07:34:47,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:47,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144825919] [2023-11-19 07:34:47,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144825919] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:47,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:47,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:34:47,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467743052] [2023-11-19 07:34:47,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:47,559 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:34:47,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:47,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:34:47,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:34:47,560 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. cyclomatic complexity: 13 Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-19 07:34:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:47,728 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2023-11-19 07:34:47,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2023-11-19 07:34:47,731 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:34:47,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2023-11-19 07:34:47,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-19 07:34:47,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-19 07:34:47,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2023-11-19 07:34:47,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:34:47,736 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-11-19 07:34:47,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2023-11-19 07:34:47,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2023-11-19 07:34:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.173913043478261) internal successors, (27), 27 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2023-11-19 07:34:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2023-11-19 07:34:47,753 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2023-11-19 07:34:47,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:34:47,756 INFO L428 stractBuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2023-11-19 07:34:47,756 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-19 07:34:47,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2023-11-19 07:34:47,757 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:34:47,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:34:47,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:34:47,762 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:34:47,763 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] [2023-11-19 07:34:47,763 INFO L748 eck$LassoCheckResult]: Stem: 425#$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); 405#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(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 write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 391#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 416#$Ultimate##0 [2023-11-19 07:34:47,763 INFO L750 eck$LassoCheckResult]: Loop: 416#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int(~a.base, ~a.offset, 4); 403#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int(0, ~b.base, ~b.offset, 4); 399#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 404#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int(~b.base, ~b.offset, 4); 398#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~c.base, ~c.offset, 4); 401#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 418#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~c.base, ~c.offset, 4); 422#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~d.base, ~d.offset, 4); 411#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 410#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int(~d.base, ~d.offset, 4); 413#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~e.base, ~e.offset, 4); 394#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 396#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 397#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 392#L25-1 assume true; 395#func_to_recursive_line_27_to_27_0EXIT >#114#return; 409#L47-1 call #t~mem8 := read~int(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 412#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 410#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int(~d.base, ~d.offset, 4); 413#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 417#L41-1 assume true; 414#func_to_recursive_line_26_to_27_0EXIT >#116#return; 415#L41-1 assume true; 428#func_to_recursive_line_26_to_27_0EXIT >#106#return; 420#L67-1 call #t~mem11 := read~int(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 407#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 418#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~c.base, ~c.offset, 4); 422#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 421#L61-1 assume true; 406#func_to_recursive_line_25_to_26_0EXIT >#108#return; 408#L61-1 assume true; 427#func_to_recursive_line_25_to_26_0EXIT >#98#return; 419#L87-1 call #t~mem14 := read~int(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 400#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 404#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int(~b.base, ~b.offset, 4); 398#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 402#L81-1 assume true; 423#func_to_recursive_line_24_to_25_0EXIT >#100#return; 424#L81-1 assume true; 426#func_to_recursive_line_24_to_25_0EXIT >#102#return; 389#L107-1 call #t~mem17 := read~int(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 390#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 416#$Ultimate##0 [2023-11-19 07:34:47,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:47,765 INFO L85 PathProgramCache]: Analyzing trace with hash 62698, now seen corresponding path program 4 times [2023-11-19 07:34:47,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:47,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849378520] [2023-11-19 07:34:47,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:47,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:34:47,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:34:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:34:47,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:34:47,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:47,824 INFO L85 PathProgramCache]: Analyzing trace with hash 170448703, now seen corresponding path program 1 times [2023-11-19 07:34:47,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:47,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870057801] [2023-11-19 07:34:47,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:47,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:48,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:48,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:48,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:48,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:48,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 07:34:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:48,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-19 07:34:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:48,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-19 07:34:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 07:34:48,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:48,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870057801] [2023-11-19 07:34:48,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870057801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:48,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:48,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:34:48,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145297511] [2023-11-19 07:34:48,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:48,680 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:34:48,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:48,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:34:48,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:34:48,682 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 13 Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-19 07:34:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:48,826 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-11-19 07:34:48,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2023-11-19 07:34:48,830 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:34:48,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 50 transitions. [2023-11-19 07:34:48,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-19 07:34:48,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-19 07:34:48,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 50 transitions. [2023-11-19 07:34:48,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:34:48,842 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2023-11-19 07:34:48,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 50 transitions. [2023-11-19 07:34:48,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-19 07:34:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 28 states have internal predecessors, (28), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-19 07:34:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2023-11-19 07:34:48,848 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2023-11-19 07:34:48,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:34:48,849 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2023-11-19 07:34:48,849 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-19 07:34:48,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2023-11-19 07:34:48,850 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:34:48,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:34:48,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:34:48,852 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:34:48,852 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] [2023-11-19 07:34:48,853 INFO L748 eck$LassoCheckResult]: Stem: 613#$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); 594#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(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 write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 580#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 605#$Ultimate##0 [2023-11-19 07:34:48,853 INFO L750 eck$LassoCheckResult]: Loop: 605#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int(~a.base, ~a.offset, 4); 592#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int(0, ~b.base, ~b.offset, 4); 588#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 593#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int(~b.base, ~b.offset, 4); 587#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~c.base, ~c.offset, 4); 590#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 607#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~c.base, ~c.offset, 4); 611#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~d.base, ~d.offset, 4); 600#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 599#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int(~d.base, ~d.offset, 4); 602#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~e.base, ~e.offset, 4); 583#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 585#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 586#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 582#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 585#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 586#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 581#L25-1 assume true; 584#func_to_recursive_line_27_to_27_0EXIT >#112#return; 598#L25-1 assume true; 618#func_to_recursive_line_27_to_27_0EXIT >#114#return; 616#L47-1 call #t~mem8 := read~int(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 601#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 599#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int(~d.base, ~d.offset, 4); 602#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 606#L41-1 assume true; 603#func_to_recursive_line_26_to_27_0EXIT >#116#return; 604#L41-1 assume true; 619#func_to_recursive_line_26_to_27_0EXIT >#106#return; 609#L67-1 call #t~mem11 := read~int(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 596#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 607#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~c.base, ~c.offset, 4); 611#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 612#L61-1 assume true; 595#func_to_recursive_line_25_to_26_0EXIT >#108#return; 597#L61-1 assume true; 610#func_to_recursive_line_25_to_26_0EXIT >#98#return; 608#L87-1 call #t~mem14 := read~int(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 589#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 593#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int(~b.base, ~b.offset, 4); 587#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 591#L81-1 assume true; 614#func_to_recursive_line_24_to_25_0EXIT >#100#return; 615#L81-1 assume true; 617#func_to_recursive_line_24_to_25_0EXIT >#102#return; 578#L107-1 call #t~mem17 := read~int(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 579#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 605#$Ultimate##0 [2023-11-19 07:34:48,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:48,854 INFO L85 PathProgramCache]: Analyzing trace with hash 62698, now seen corresponding path program 5 times [2023-11-19 07:34:48,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:48,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768363942] [2023-11-19 07:34:48,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:48,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:34:48,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:34:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:34:48,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:34:48,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:48,884 INFO L85 PathProgramCache]: Analyzing trace with hash 219723260, now seen corresponding path program 1 times [2023-11-19 07:34:48,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:48,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54583781] [2023-11-19 07:34:48,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:48,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:49,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:49,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:49,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:49,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:50,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:50,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-19 07:34:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:50,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-19 07:34:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:50,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-19 07:34:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 07:34:50,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:50,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54583781] [2023-11-19 07:34:50,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54583781] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:34:50,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622912407] [2023-11-19 07:34:50,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:50,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:34:50,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:34:50,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:34:50,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:34:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:50,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-19 07:34:50,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:34:50,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 07:34:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 07:34:50,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:34:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 07:34:51,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622912407] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:34:51,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:34:51,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2023-11-19 07:34:51,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684195126] [2023-11-19 07:34:51,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:34:51,564 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:34:51,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:51,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-19 07:34:51,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2023-11-19 07:34:51,566 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. cyclomatic complexity: 13 Second operand has 22 states, 16 states have (on average 3.0625) internal successors, (49), 19 states have internal predecessors, (49), 8 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (15), 4 states have call predecessors, (15), 8 states have call successors, (15) [2023-11-19 07:34:52,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:52,026 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2023-11-19 07:34:52,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2023-11-19 07:34:52,028 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:34:52,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 54 transitions. [2023-11-19 07:34:52,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2023-11-19 07:34:52,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2023-11-19 07:34:52,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 54 transitions. [2023-11-19 07:34:52,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:34:52,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-11-19 07:34:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 54 transitions. [2023-11-19 07:34:52,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-19 07:34:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 30 states have internal predecessors, (30), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2023-11-19 07:34:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2023-11-19 07:34:52,036 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-11-19 07:34:52,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:34:52,037 INFO L428 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-11-19 07:34:52,037 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-19 07:34:52,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2023-11-19 07:34:52,038 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:34:52,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:34:52,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:34:52,040 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:34:52,040 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 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] [2023-11-19 07:34:52,041 INFO L748 eck$LassoCheckResult]: Stem: 1133#$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); 1113#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(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 write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1099#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 1124#$Ultimate##0 [2023-11-19 07:34:52,041 INFO L750 eck$LassoCheckResult]: Loop: 1124#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int(~a.base, ~a.offset, 4); 1111#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int(0, ~b.base, ~b.offset, 4); 1108#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1112#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int(~b.base, ~b.offset, 4); 1106#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~c.base, ~c.offset, 4); 1109#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1126#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~c.base, ~c.offset, 4); 1130#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~d.base, ~d.offset, 4); 1120#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1118#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int(~d.base, ~d.offset, 4); 1121#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~e.base, ~e.offset, 4); 1102#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1104#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 1105#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1101#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1104#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 1105#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1101#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1104#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 1105#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1101#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1104#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 1105#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1100#L25-1 assume true; 1103#func_to_recursive_line_27_to_27_0EXIT >#112#return; 1117#L25-1 assume true; 1142#func_to_recursive_line_27_to_27_0EXIT >#112#return; 1141#L25-1 assume true; 1140#func_to_recursive_line_27_to_27_0EXIT >#112#return; 1139#L25-1 assume true; 1138#func_to_recursive_line_27_to_27_0EXIT >#114#return; 1135#L47-1 call #t~mem8 := read~int(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1119#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1118#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int(~d.base, ~d.offset, 4); 1121#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1125#L41-1 assume true; 1122#func_to_recursive_line_26_to_27_0EXIT >#116#return; 1123#L41-1 assume true; 1134#func_to_recursive_line_26_to_27_0EXIT >#106#return; 1128#L67-1 call #t~mem11 := read~int(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 1115#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1126#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~c.base, ~c.offset, 4); 1130#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1129#L61-1 assume true; 1114#func_to_recursive_line_25_to_26_0EXIT >#108#return; 1116#L61-1 assume true; 1137#func_to_recursive_line_25_to_26_0EXIT >#98#return; 1127#L87-1 call #t~mem14 := read~int(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 1107#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1112#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int(~b.base, ~b.offset, 4); 1106#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1110#L81-1 assume true; 1131#func_to_recursive_line_24_to_25_0EXIT >#100#return; 1132#L81-1 assume true; 1136#func_to_recursive_line_24_to_25_0EXIT >#102#return; 1097#L107-1 call #t~mem17 := read~int(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 1098#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1124#$Ultimate##0 [2023-11-19 07:34:52,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:52,042 INFO L85 PathProgramCache]: Analyzing trace with hash 62698, now seen corresponding path program 6 times [2023-11-19 07:34:52,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:52,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304405781] [2023-11-19 07:34:52,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:52,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:34:52,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:34:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:34:52,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:34:52,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash 64438002, now seen corresponding path program 2 times [2023-11-19 07:34:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:52,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479073312] [2023-11-19 07:34:52,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:52,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:52,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:53,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:53,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:54,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:54,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:54,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:54,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:54,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-19 07:34:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:54,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-19 07:34:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:54,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-19 07:34:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-19 07:34:54,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:54,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479073312] [2023-11-19 07:34:54,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479073312] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:34:54,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671421756] [2023-11-19 07:34:54,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:34:54,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:34:54,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:34:54,614 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:34:54,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:34:54,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:34:54,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:34:54,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 81 conjunts are in the unsatisfiable core [2023-11-19 07:34:54,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:34:54,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 07:34:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-19 07:34:55,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:34:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 07:34:57,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671421756] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:34:57,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:34:57,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 18] total 33 [2023-11-19 07:34:57,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793814530] [2023-11-19 07:34:57,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:34:57,263 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:34:57,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:57,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-19 07:34:57,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2023-11-19 07:34:57,267 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 13 Second operand has 33 states, 25 states have (on average 2.4) internal successors, (60), 28 states have internal predecessors, (60), 12 states have call successors, (26), 7 states have call predecessors, (26), 10 states have return successors, (23), 7 states have call predecessors, (23), 12 states have call successors, (23) [2023-11-19 07:34:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:58,068 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2023-11-19 07:34:58,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2023-11-19 07:34:58,069 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:34:58,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 56 transitions. [2023-11-19 07:34:58,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2023-11-19 07:34:58,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2023-11-19 07:34:58,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 56 transitions. [2023-11-19 07:34:58,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:34:58,072 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 56 transitions. [2023-11-19 07:34:58,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 56 transitions. [2023-11-19 07:34:58,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-11-19 07:34:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 31 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 11 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2023-11-19 07:34:58,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2023-11-19 07:34:58,076 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 56 transitions. [2023-11-19 07:34:58,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-19 07:34:58,078 INFO L428 stractBuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2023-11-19 07:34:58,078 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-19 07:34:58,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 56 transitions. [2023-11-19 07:34:58,079 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:34:58,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:34:58,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:34:58,081 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:34:58,081 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 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] [2023-11-19 07:34:58,081 INFO L748 eck$LassoCheckResult]: Stem: 1798#$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); 1780#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(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 write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1769#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 1791#$Ultimate##0 [2023-11-19 07:34:58,082 INFO L750 eck$LassoCheckResult]: Loop: 1791#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int(~a.base, ~a.offset, 4); 1778#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int(0, ~b.base, ~b.offset, 4); 1774#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1779#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int(~b.base, ~b.offset, 4); 1773#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~c.base, ~c.offset, 4); 1776#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1793#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~c.base, ~c.offset, 4); 1797#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~d.base, ~d.offset, 4); 1786#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1785#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int(~d.base, ~d.offset, 4); 1788#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~e.base, ~e.offset, 4); 1765#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1771#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 1772#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1766#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1771#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 1772#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1766#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1771#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 1772#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1766#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1771#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 1772#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1766#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1771#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 1772#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1764#L25-1 assume true; 1767#func_to_recursive_line_27_to_27_0EXIT >#112#return; 1781#L25-1 assume true; 1811#func_to_recursive_line_27_to_27_0EXIT >#112#return; 1810#L25-1 assume true; 1809#func_to_recursive_line_27_to_27_0EXIT >#112#return; 1808#L25-1 assume true; 1807#func_to_recursive_line_27_to_27_0EXIT >#112#return; 1806#L25-1 assume true; 1805#func_to_recursive_line_27_to_27_0EXIT >#114#return; 1802#L47-1 call #t~mem8 := read~int(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1787#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1785#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int(~d.base, ~d.offset, 4); 1788#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1792#L41-1 assume true; 1789#func_to_recursive_line_26_to_27_0EXIT >#116#return; 1790#L41-1 assume true; 1801#func_to_recursive_line_26_to_27_0EXIT >#106#return; 1795#L67-1 call #t~mem11 := read~int(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 1783#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1793#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~c.base, ~c.offset, 4); 1797#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1796#L61-1 assume true; 1782#func_to_recursive_line_25_to_26_0EXIT >#108#return; 1784#L61-1 assume true; 1804#func_to_recursive_line_25_to_26_0EXIT >#98#return; 1794#L87-1 call #t~mem14 := read~int(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 1775#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1779#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int(~b.base, ~b.offset, 4); 1773#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1777#L81-1 assume true; 1799#func_to_recursive_line_24_to_25_0EXIT >#100#return; 1800#L81-1 assume true; 1803#func_to_recursive_line_24_to_25_0EXIT >#102#return; 1768#L107-1 call #t~mem17 := read~int(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 1770#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1791#$Ultimate##0 [2023-11-19 07:34:58,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:58,082 INFO L85 PathProgramCache]: Analyzing trace with hash 62698, now seen corresponding path program 7 times [2023-11-19 07:34:58,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:58,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896744598] [2023-11-19 07:34:58,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:58,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:34:58,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:34:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:34:58,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:34:58,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:58,107 INFO L85 PathProgramCache]: Analyzing trace with hash -858149333, now seen corresponding path program 3 times [2023-11-19 07:34:58,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:58,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776597928] [2023-11-19 07:34:58,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:58,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:58,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:59,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:59,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:34:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:00,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:00,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:00,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:00,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:00,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:01,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 07:35:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:01,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:35:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:01,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:35:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-19 07:35:01,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:01,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776597928] [2023-11-19 07:35:01,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776597928] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:35:01,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518677959] [2023-11-19 07:35:01,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 07:35:01,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:35:01,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:35:01,044 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:35:01,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:35:01,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-19 07:35:01,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:35:01,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-19 07:35:01,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:35:01,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 07:35:01,716 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-19 07:35:01,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:35:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 07:35:04,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518677959] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:35:04,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:35:04,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 22] total 34 [2023-11-19 07:35:04,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508476195] [2023-11-19 07:35:04,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:35:04,404 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:35:04,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:04,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-19 07:35:04,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2023-11-19 07:35:04,406 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. cyclomatic complexity: 13 Second operand has 34 states, 26 states have (on average 2.230769230769231) internal successors, (58), 28 states have internal predecessors, (58), 10 states have call successors, (24), 8 states have call predecessors, (24), 12 states have return successors, (24), 9 states have call predecessors, (24), 10 states have call successors, (24) [2023-11-19 07:35:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:05,085 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-11-19 07:35:05,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2023-11-19 07:35:05,086 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:35:05,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 58 transitions. [2023-11-19 07:35:05,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2023-11-19 07:35:05,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2023-11-19 07:35:05,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2023-11-19 07:35:05,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:05,089 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2023-11-19 07:35:05,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2023-11-19 07:35:05,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-19 07:35:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 32 states have internal predecessors, (32), 10 states have call successors, (10), 5 states have call predecessors, (10), 12 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2023-11-19 07:35:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2023-11-19 07:35:05,093 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2023-11-19 07:35:05,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:35:05,095 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2023-11-19 07:35:05,095 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-19 07:35:05,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 58 transitions. [2023-11-19 07:35:05,096 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:35:05,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:35:05,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:35:05,097 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:35:05,098 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 5, 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] [2023-11-19 07:35:05,098 INFO L748 eck$LassoCheckResult]: Stem: 2529#$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); 2511#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(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 write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 2500#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 2522#$Ultimate##0 [2023-11-19 07:35:05,098 INFO L750 eck$LassoCheckResult]: Loop: 2522#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int(~a.base, ~a.offset, 4); 2509#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int(0, ~b.base, ~b.offset, 4); 2505#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2510#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int(~b.base, ~b.offset, 4); 2504#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~c.base, ~c.offset, 4); 2507#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2524#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~c.base, ~c.offset, 4); 2528#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~d.base, ~d.offset, 4); 2517#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2516#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int(~d.base, ~d.offset, 4); 2519#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~e.base, ~e.offset, 4); 2497#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2502#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 2503#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2496#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2502#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 2503#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2496#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2502#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 2503#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2496#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2502#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 2503#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2496#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2502#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 2503#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2496#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2502#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 2503#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2495#L25-1 assume true; 2498#func_to_recursive_line_27_to_27_0EXIT >#112#return; 2515#L25-1 assume true; 2544#func_to_recursive_line_27_to_27_0EXIT >#112#return; 2543#L25-1 assume true; 2542#func_to_recursive_line_27_to_27_0EXIT >#112#return; 2541#L25-1 assume true; 2540#func_to_recursive_line_27_to_27_0EXIT >#112#return; 2539#L25-1 assume true; 2538#func_to_recursive_line_27_to_27_0EXIT >#112#return; 2537#L25-1 assume true; 2536#func_to_recursive_line_27_to_27_0EXIT >#114#return; 2533#L47-1 call #t~mem8 := read~int(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2518#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2516#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int(~d.base, ~d.offset, 4); 2519#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2523#L41-1 assume true; 2520#func_to_recursive_line_26_to_27_0EXIT >#116#return; 2521#L41-1 assume true; 2532#func_to_recursive_line_26_to_27_0EXIT >#106#return; 2526#L67-1 call #t~mem11 := read~int(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 2513#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2524#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~c.base, ~c.offset, 4); 2528#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2527#L61-1 assume true; 2512#func_to_recursive_line_25_to_26_0EXIT >#108#return; 2514#L61-1 assume true; 2535#func_to_recursive_line_25_to_26_0EXIT >#98#return; 2525#L87-1 call #t~mem14 := read~int(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 2506#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2510#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int(~b.base, ~b.offset, 4); 2504#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2508#L81-1 assume true; 2530#func_to_recursive_line_24_to_25_0EXIT >#100#return; 2531#L81-1 assume true; 2534#func_to_recursive_line_24_to_25_0EXIT >#102#return; 2499#L107-1 call #t~mem17 := read~int(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 2501#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 2522#$Ultimate##0 [2023-11-19 07:35:05,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:05,099 INFO L85 PathProgramCache]: Analyzing trace with hash 62698, now seen corresponding path program 8 times [2023-11-19 07:35:05,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:05,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852973485] [2023-11-19 07:35:05,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:05,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:05,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:35:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:05,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:35:05,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:05,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1222882072, now seen corresponding path program 4 times [2023-11-19 07:35:05,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:05,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376827968] [2023-11-19 07:35:05,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:05,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:05,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:06,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:07,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:07,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:07,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:08,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:08,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:08,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:08,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:08,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:35:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:08,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:35:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:08,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-19 07:35:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 35 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-19 07:35:08,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:08,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376827968] [2023-11-19 07:35:08,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376827968] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:35:08,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035395205] [2023-11-19 07:35:08,665 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 07:35:08,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:35:08,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:35:08,667 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:35:08,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 07:35:08,883 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 07:35:08,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:35:08,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-19 07:35:08,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:35:08,922 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:35:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-19 07:35:09,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:35:12,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035395205] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:35:12,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:35:12,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2023-11-19 07:35:12,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376838110] [2023-11-19 07:35:12,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:35:12,306 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:35:12,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:12,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-19 07:35:12,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1055, Unknown=0, NotChecked=0, Total=1190 [2023-11-19 07:35:12,308 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. cyclomatic complexity: 13 Second operand has 27 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 26 states have internal predecessors, (53), 8 states have call successors, (18), 3 states have call predecessors, (18), 14 states have return successors, (22), 11 states have call predecessors, (22), 8 states have call successors, (22) [2023-11-19 07:35:12,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:12,913 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2023-11-19 07:35:12,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 60 transitions. [2023-11-19 07:35:12,914 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:35:12,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 60 transitions. [2023-11-19 07:35:12,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2023-11-19 07:35:12,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2023-11-19 07:35:12,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 60 transitions. [2023-11-19 07:35:12,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:35:12,919 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 60 transitions. [2023-11-19 07:35:12,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 60 transitions. [2023-11-19 07:35:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-11-19 07:35:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 33 states have internal predecessors, (33), 10 states have call successors, (10), 5 states have call predecessors, (10), 13 states have return successors, (17), 13 states have call predecessors, (17), 8 states have call successors, (17) [2023-11-19 07:35:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2023-11-19 07:35:12,933 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 60 transitions. [2023-11-19 07:35:12,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 07:35:12,936 INFO L428 stractBuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2023-11-19 07:35:12,937 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-19 07:35:12,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2023-11-19 07:35:12,937 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-19 07:35:12,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:35:12,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:35:12,939 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-19 07:35:12,939 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 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] [2023-11-19 07:35:12,939 INFO L748 eck$LassoCheckResult]: Stem: 3250#$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); 3230#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#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_#t~mem26#1, main_#t~short27#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int(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 write~int(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 3216#L128 call func_to_recursive_line_23_to_24_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 3241#$Ultimate##0 [2023-11-19 07:35:12,939 INFO L750 eck$LassoCheckResult]: Loop: 3241#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int(~a.base, ~a.offset, 4); 3228#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int(0, ~b.base, ~b.offset, 4); 3224#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3229#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int(~b.base, ~b.offset, 4); 3223#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int(0, ~c.base, ~c.offset, 4); 3226#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3243#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~c.base, ~c.offset, 4); 3247#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int(0, ~d.base, ~d.offset, 4); 3237#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int(~d.base, ~d.offset, 4); 3238#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int(0, ~e.base, ~e.offset, 4); 3219#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3221#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 3222#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3218#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3221#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 3222#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3218#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3221#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 3222#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3218#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3221#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 3222#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3218#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3221#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 3222#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3218#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3221#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 3222#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3218#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3221#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int(~e.base, ~e.offset, 4); 3222#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3217#L25-1 assume true; 3220#func_to_recursive_line_27_to_27_0EXIT >#112#return; 3234#L25-1 assume true; 3265#func_to_recursive_line_27_to_27_0EXIT >#112#return; 3264#L25-1 assume true; 3263#func_to_recursive_line_27_to_27_0EXIT >#112#return; 3262#L25-1 assume true; 3261#func_to_recursive_line_27_to_27_0EXIT >#112#return; 3260#L25-1 assume true; 3259#func_to_recursive_line_27_to_27_0EXIT >#112#return; 3258#L25-1 assume true; 3257#func_to_recursive_line_27_to_27_0EXIT >#112#return; 3256#L25-1 assume true; 3255#func_to_recursive_line_27_to_27_0EXIT >#114#return; 3252#L47-1 call #t~mem8 := read~int(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3236#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3235#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int(~d.base, ~d.offset, 4); 3238#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3242#L41-1 assume true; 3239#func_to_recursive_line_26_to_27_0EXIT >#116#return; 3240#L41-1 assume true; 3251#func_to_recursive_line_26_to_27_0EXIT >#106#return; 3245#L67-1 call #t~mem11 := read~int(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3232#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3243#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int(~c.base, ~c.offset, 4); 3247#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3246#L61-1 assume true; 3231#func_to_recursive_line_25_to_26_0EXIT >#108#return; 3233#L61-1 assume true; 3254#func_to_recursive_line_25_to_26_0EXIT >#98#return; 3244#L87-1 call #t~mem14 := read~int(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 3225#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3229#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int(~b.base, ~b.offset, 4); 3223#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3227#L81-1 assume true; 3248#func_to_recursive_line_24_to_25_0EXIT >#100#return; 3249#L81-1 assume true; 3253#func_to_recursive_line_24_to_25_0EXIT >#102#return; 3214#L107-1 call #t~mem17 := read~int(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 3215#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 3241#$Ultimate##0 [2023-11-19 07:35:12,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:12,940 INFO L85 PathProgramCache]: Analyzing trace with hash 62698, now seen corresponding path program 9 times [2023-11-19 07:35:12,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:12,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859438077] [2023-11-19 07:35:12,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:12,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:12,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:35:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:12,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:35:12,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:12,959 INFO L85 PathProgramCache]: Analyzing trace with hash -166686431, now seen corresponding path program 5 times [2023-11-19 07:35:12,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:12,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559956940] [2023-11-19 07:35:12,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:12,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:12,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:35:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:35:13,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:35:13,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:13,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2014496010, now seen corresponding path program 1 times [2023-11-19 07:35:13,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:13,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22906972] [2023-11-19 07:35:13,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:13,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:13,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:35:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:14,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:15,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:15,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:16,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:16,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:16,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:16,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:16,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:16,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:35:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:16,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:35:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:16,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 07:35:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:16,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-19 07:35:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-19 07:35:16,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:16,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22906972] [2023-11-19 07:35:16,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22906972] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:35:16,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794404552] [2023-11-19 07:35:16,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:16,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:35:16,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:35:16,828 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:35:16,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4ac66a-ad33-41ac-b3ef-db1d03f22e3b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 07:35:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:17,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 104 conjunts are in the unsatisfiable core [2023-11-19 07:35:17,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:35:17,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 502 treesize of output 494 [2023-11-19 07:35:17,153 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:35:29,398 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_61| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_61| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_61| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_61| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_61|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false