./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dea78793c7130d873f751539350d9a84f129d659be765f9ed3f85c683976c43a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:53:13,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:53:13,640 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 04:53:13,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:53:13,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:53:13,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:53:13,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:53:13,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:53:13,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:53:13,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:53:13,711 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:53:13,713 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:53:13,713 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:53:13,715 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:53:13,716 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:53:13,717 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:53:13,717 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:53:13,718 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:53:13,718 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:53:13,719 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:53:13,720 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:53:13,720 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:53:13,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:53:13,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 04:53:13,722 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:53:13,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:53:13,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:53:13,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:53:13,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 04:53:13,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:53:13,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 04:53:13,726 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:53:13,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 04:53:13,727 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:53:13,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:53:13,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:53:13,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:53:13,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:53:13,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:53:13,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 04:53:13,729 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:53:13,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:53:13,730 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 04:53:13,730 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:53:13,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:53:13,731 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_91e33922-314b-4b23-8233-815afda477ce/bin/utaipan-verify-t7M7D8N6sZ/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_91e33922-314b-4b23-8233-815afda477ce/bin/utaipan-verify-t7M7D8N6sZ 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(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> dea78793c7130d873f751539350d9a84f129d659be765f9ed3f85c683976c43a [2023-11-19 04:53:14,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:53:14,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:53:14,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:53:14,089 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:53:14,090 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:53:14,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c [2023-11-19 04:53:17,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:53:18,089 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:53:18,093 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c [2023-11-19 04:53:18,104 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/bin/utaipan-verify-t7M7D8N6sZ/data/f56d11f91/84ddc0969d5c43c4bda44b0afaab7239/FLAGa2da60011 [2023-11-19 04:53:18,128 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/bin/utaipan-verify-t7M7D8N6sZ/data/f56d11f91/84ddc0969d5c43c4bda44b0afaab7239 [2023-11-19 04:53:18,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:53:18,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:53:18,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:53:18,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:53:18,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:53:18,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:53:18" (1/1) ... [2023-11-19 04:53:18,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d65f9d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:53:18, skipping insertion in model container [2023-11-19 04:53:18,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:53:18" (1/1) ... [2023-11-19 04:53:18,201 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:53:18,384 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c[1440,1453] [2023-11-19 04:53:18,413 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:53:18,426 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:53:18,443 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c[1440,1453] [2023-11-19 04:53:18,462 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:53:18,481 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:53:18,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:53:18 WrapperNode [2023-11-19 04:53:18,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:53:18,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:53:18,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:53:18,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:53:18,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:53:18" (1/1) ... [2023-11-19 04:53:18,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:53:18" (1/1) ... [2023-11-19 04:53:18,532 INFO L138 Inliner]: procedures = 16, calls = 71, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2023-11-19 04:53:18,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:53:18,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:53:18,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:53:18,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:53:18,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:53:18" (1/1) ... [2023-11-19 04:53:18,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:53:18" (1/1) ... [2023-11-19 04:53:18,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:53:18" (1/1) ... [2023-11-19 04:53:18,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:53:18" (1/1) ... [2023-11-19 04:53:18,584 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:53:18" (1/1) ... [2023-11-19 04:53:18,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:53:18" (1/1) ... [2023-11-19 04:53:18,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:53:18" (1/1) ... [2023-11-19 04:53:18,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:53:18" (1/1) ... [2023-11-19 04:53:18,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:53:18,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:53:18,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:53:18,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:53:18,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:53:18" (1/1) ... [2023-11-19 04:53:18,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:53:18,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:53:18,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:53:18,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:53:18,686 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_12_to_13_0 [2023-11-19 04:53:18,686 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_12_to_13_0 [2023-11-19 04:53:18,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:53:18,687 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_13_to_14_0 [2023-11-19 04:53:18,687 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_13_to_14_0 [2023-11-19 04:53:18,687 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_11_to_12_0 [2023-11-19 04:53:18,687 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_11_to_12_0 [2023-11-19 04:53:18,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:53:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_14_to_16_0 [2023-11-19 04:53:18,688 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_14_to_16_0 [2023-11-19 04:53:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_10_to_11_0 [2023-11-19 04:53:18,688 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_10_to_11_0 [2023-11-19 04:53:18,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:53:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:53:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:53:18,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:53:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 04:53:18,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:53:18,825 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:53:18,829 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:53:19,259 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:53:19,390 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:53:19,390 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 04:53:19,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:53:19 BoogieIcfgContainer [2023-11-19 04:53:19,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:53:19,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:53:19,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:53:19,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:53:19,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:53:18" (1/3) ... [2023-11-19 04:53:19,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63be049d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:53:19, skipping insertion in model container [2023-11-19 04:53:19,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:53:18" (2/3) ... [2023-11-19 04:53:19,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63be049d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:53:19, skipping insertion in model container [2023-11-19 04:53:19,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:53:19" (3/3) ... [2023-11-19 04:53:19,425 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_deep-nested.c [2023-11-19 04:53:19,450 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:53:19,450 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 04:53:19,508 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:53:19,516 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5afdaceb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:53:19,517 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 04:53:19,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 30 states have internal predecessors, (31), 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 04:53:19,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 04:53:19,533 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:53:19,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:53:19,535 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:53:19,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:53:19,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1180642830, now seen corresponding path program 1 times [2023-11-19 04:53:19,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:53:19,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546939954] [2023-11-19 04:53:19,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:53:19,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:53:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:53:24,123 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 04:53:24,124 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:53:24,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546939954] [2023-11-19 04:53:24,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546939954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:53:24,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:53:24,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-19 04:53:24,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703865073] [2023-11-19 04:53:24,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:53:24,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-19 04:53:24,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:53:24,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-19 04:53:24,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2023-11-19 04:53:24,199 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 30 states have internal predecessors, (31), 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 16 states, 13 states have (on average 1.0) internal successors, (13), 10 states have internal predecessors, (13), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:53:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:53:25,198 INFO L93 Difference]: Finished difference Result 111 states and 154 transitions. [2023-11-19 04:53:25,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-19 04:53:25,202 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.0) internal successors, (13), 10 states have internal predecessors, (13), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-19 04:53:25,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:53:25,213 INFO L225 Difference]: With dead ends: 111 [2023-11-19 04:53:25,214 INFO L226 Difference]: Without dead ends: 65 [2023-11-19 04:53:25,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2023-11-19 04:53:25,223 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 04:53:25,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 292 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-19 04:53:25,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-19 04:53:25,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2023-11-19 04:53:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 45 states have internal predecessors, (46), 14 states have call successors, (14), 10 states have call predecessors, (14), 8 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16) [2023-11-19 04:53:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2023-11-19 04:53:25,288 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 18 [2023-11-19 04:53:25,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:53:25,289 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2023-11-19 04:53:25,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.0) internal successors, (13), 10 states have internal predecessors, (13), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:53:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2023-11-19 04:53:25,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 04:53:25,293 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:53:25,293 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:53:25,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:53:25,294 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_14_to_16_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 04:53:25,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:53:25,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1445156922, now seen corresponding path program 1 times [2023-11-19 04:53:25,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:53:25,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003196250] [2023-11-19 04:53:25,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:53:25,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:53:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:53:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:53:27,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:53:27,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003196250] [2023-11-19 04:53:27,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003196250] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:53:27,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059080682] [2023-11-19 04:53:27,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:53:27,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:53:27,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:53:27,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:53:27,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91e33922-314b-4b23-8233-815afda477ce/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 04:53:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:53:27,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 223 conjunts are in the unsatisfiable core [2023-11-19 04:53:28,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:53:28,147 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2023-11-19 04:53:28,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 76 [2023-11-19 04:53:28,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-19 04:53:28,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 04:53:28,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-19 04:53:29,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-19 04:53:29,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-19 04:53:29,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-19 04:53:30,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2023-11-19 04:53:30,236 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 5 treesize of output 3 [2023-11-19 04:53:30,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 04:53:30,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 186 treesize of output 242 [2023-11-19 04:53:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:53:31,061 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:53:37,098 WARN L854 $PredicateComparison]: unable to prove that (forall ((func_to_recursive_line_14_to_16_0_~c.base Int) (v_ArrVal_87 (Array Int Int)) (v_func_to_recursive_line_14_to_16_0_~e.base_18 Int) (func_to_recursive_line_14_to_16_0_~c.offset Int) (func_to_recursive_line_10_to_11_0_~b.offset Int) (func_to_recursive_line_13_to_14_0_~e.offset Int) (func_to_recursive_line_12_to_13_0_~d.offset Int) (v_ArrVal_90 (Array Int Int))) (let ((.cse0 (store (let ((.cse4 (store (store |c_#memory_int| c_func_to_recursive_line_10_to_11_0_~b.base (store (select |c_#memory_int| c_func_to_recursive_line_10_to_11_0_~b.base) func_to_recursive_line_10_to_11_0_~b.offset 0)) c_func_to_recursive_line_10_to_11_0_~c.base v_ArrVal_87))) (store .cse4 c_func_to_recursive_line_10_to_11_0_~d.base (store (select .cse4 c_func_to_recursive_line_10_to_11_0_~d.base) func_to_recursive_line_12_to_13_0_~d.offset 0))) c_func_to_recursive_line_10_to_11_0_~e.base v_ArrVal_90))) (let ((.cse2 (mod (select (select .cse0 func_to_recursive_line_14_to_16_0_~c.base) func_to_recursive_line_14_to_16_0_~c.offset) 4294967296)) (.cse3 (mod (select (select .cse0 c_func_to_recursive_line_10_to_11_0_~d.base) func_to_recursive_line_12_to_13_0_~d.offset) 4294967296)) (.cse1 (mod (select (select .cse0 v_func_to_recursive_line_14_to_16_0_~e.base_18) func_to_recursive_line_13_to_14_0_~e.offset) 4294967296))) (or (not (= (mod (+ 4294967294 (select (select .cse0 c_func_to_recursive_line_10_to_11_0_~uint32_max.base) c_func_to_recursive_line_10_to_11_0_~uint32_max.offset)) 4294967296) .cse1)) (not (= .cse2 (mod (select (select .cse0 c_func_to_recursive_line_10_to_11_0_~b.base) func_to_recursive_line_10_to_11_0_~b.offset) 4294967296))) (not (= .cse2 .cse3)) (not (= .cse3 .cse1)))))) is different from false [2023-11-19 04:53:37,179 WARN L854 $PredicateComparison]: unable to prove that (forall ((func_to_recursive_line_14_to_16_0_~c.base Int) (v_ArrVal_87 (Array Int Int)) (v_func_to_recursive_line_14_to_16_0_~e.base_18 Int) (func_to_recursive_line_14_to_16_0_~c.offset Int) (func_to_recursive_line_10_to_11_0_~b.offset Int) (func_to_recursive_line_13_to_14_0_~e.offset Int) (func_to_recursive_line_12_to_13_0_~d.offset Int) (v_ArrVal_90 (Array Int Int))) (let ((.cse0 (store (let ((.cse4 (store (store |c_#memory_int| |c_func_to_recursive_line_10_to_11_0_#in~b.base| (store (select |c_#memory_int| |c_func_to_recursive_line_10_to_11_0_#in~b.base|) func_to_recursive_line_10_to_11_0_~b.offset 0)) |c_func_to_recursive_line_10_to_11_0_#in~c.base| v_ArrVal_87))) (store .cse4 |c_func_to_recursive_line_10_to_11_0_#in~d.base| (store (select .cse4 |c_func_to_recursive_line_10_to_11_0_#in~d.base|) func_to_recursive_line_12_to_13_0_~d.offset 0))) |c_func_to_recursive_line_10_to_11_0_#in~e.base| v_ArrVal_90))) (let ((.cse3 (mod (select (select .cse0 func_to_recursive_line_14_to_16_0_~c.base) func_to_recursive_line_14_to_16_0_~c.offset) 4294967296)) (.cse2 (mod (select (select .cse0 |c_func_to_recursive_line_10_to_11_0_#in~d.base|) func_to_recursive_line_12_to_13_0_~d.offset) 4294967296)) (.cse1 (mod (select (select .cse0 v_func_to_recursive_line_14_to_16_0_~e.base_18) func_to_recursive_line_13_to_14_0_~e.offset) 4294967296))) (or (not (= (mod (+ (select (select .cse0 |c_func_to_recursive_line_10_to_11_0_#in~uint32_max.base|) |c_func_to_recursive_line_10_to_11_0_#in~uint32_max.offset|) 4294967294) 4294967296) .cse1)) (not (= .cse2 .cse3)) (not (= .cse3 (mod (select (select .cse0 |c_func_to_recursive_line_10_to_11_0_#in~b.base|) func_to_recursive_line_10_to_11_0_~b.offset) 4294967296))) (not (= .cse2 .cse1)))))) is different from false [2023-11-19 04:53:37,262 WARN L854 $PredicateComparison]: unable to prove that (forall ((func_to_recursive_line_14_to_16_0_~c.base Int) (v_ArrVal_87 (Array Int Int)) (v_func_to_recursive_line_14_to_16_0_~e.base_18 Int) (func_to_recursive_line_14_to_16_0_~c.offset Int) (func_to_recursive_line_10_to_11_0_~b.offset Int) (func_to_recursive_line_13_to_14_0_~e.offset Int) (func_to_recursive_line_12_to_13_0_~d.offset Int) (v_ArrVal_90 (Array Int Int))) (let ((.cse1 (store (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) func_to_recursive_line_10_to_11_0_~b.offset 0)) |c_ULTIMATE.start_main_~#c~0#1.base| v_ArrVal_87))) (store .cse4 |c_ULTIMATE.start_main_~#d~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#d~0#1.base|) func_to_recursive_line_12_to_13_0_~d.offset 0))) |c_ULTIMATE.start_main_~#e~0#1.base| v_ArrVal_90))) (let ((.cse0 (mod (select (select .cse1 func_to_recursive_line_14_to_16_0_~c.base) func_to_recursive_line_14_to_16_0_~c.offset) 4294967296)) (.cse3 (mod (select (select .cse1 v_func_to_recursive_line_14_to_16_0_~e.base_18) func_to_recursive_line_13_to_14_0_~e.offset) 4294967296)) (.cse2 (mod (select (select .cse1 |c_ULTIMATE.start_main_~#d~0#1.base|) func_to_recursive_line_12_to_13_0_~d.offset) 4294967296))) (or (not (= .cse0 (mod (select (select .cse1 |c_ULTIMATE.start_main_~#b~0#1.base|) func_to_recursive_line_10_to_11_0_~b.offset) 4294967296))) (not (= .cse0 .cse2)) (not (= .cse3 (mod (+ 4294967294 (select (select .cse1 |c_ULTIMATE.start_main_~#uint32_max~0#1.base|) |c_ULTIMATE.start_main_~#uint32_max~0#1.offset|)) 4294967296))) (not (= .cse3 .cse2)))))) is different from false [2023-11-19 04:53:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:53:37,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059080682] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:53:37,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1343665648] [2023-11-19 04:53:37,299 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-11-19 04:53:37,300 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:53:37,305 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-19 04:53:37,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:53:37,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 53 [2023-11-19 04:53:37,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521875171] [2023-11-19 04:53:37,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:53:37,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-11-19 04:53:37,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:53:37,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-19 04:53:37,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2398, Unknown=9, NotChecked=300, Total=2862 [2023-11-19 04:53:37,321 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand has 54 states, 40 states have (on average 1.175) internal successors, (47), 35 states have internal predecessors, (47), 18 states have call successors, (18), 18 states have call predecessors, (18), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:53:42,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 04:53:44,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 04:53:47,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 04:53:49,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 04:53:58,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 04:54:02,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 04:54:04,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 04:54:06,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 04:54:11,867 WARN L854 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~b.base) c_func_to_recursive_line_14_to_16_0_~b.offset) 0) (= 4294967295 (select (select |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~uint32_max.base) c_func_to_recursive_line_14_to_16_0_~uint32_max.offset)) (= (select (select |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~d.base) c_func_to_recursive_line_14_to_16_0_~d.offset) 0) (let ((.cse1 (mod (select (select |c_#memory_int| |c_func_to_recursive_line_14_to_16_0_#in~d.base|) |c_func_to_recursive_line_14_to_16_0_#in~d.offset|) 4294967296))) (or (forall ((func_to_recursive_line_14_to_16_0_~c.base Int) (func_to_recursive_line_14_to_16_0_~c.offset Int)) (let ((.cse0 (mod (select (select |c_#memory_int| func_to_recursive_line_14_to_16_0_~c.base) func_to_recursive_line_14_to_16_0_~c.offset) 4294967296))) (or (not (= .cse0 .cse1)) (not (= .cse0 (mod (select (select |c_#memory_int| |c_func_to_recursive_line_14_to_16_0_#in~b.base|) |c_func_to_recursive_line_14_to_16_0_#in~b.offset|) 4294967296)))))) (forall ((func_to_recursive_line_14_to_16_0_~e.base Int)) (let ((.cse2 (mod (select (select |c_#memory_int| func_to_recursive_line_14_to_16_0_~e.base) |c_func_to_recursive_line_14_to_16_0_#in~e.offset|) 4294967296))) (or (not (= (mod (+ (select (select |c_#memory_int| |c_func_to_recursive_line_14_to_16_0_#in~uint32_max.base|) |c_func_to_recursive_line_14_to_16_0_#in~uint32_max.offset|) 4294967294) 4294967296) .cse2)) (not (= .cse2 .cse1))))))) (not (= c_func_to_recursive_line_14_to_16_0_~e.base c_func_to_recursive_line_14_to_16_0_~d.base)) (= (select (select |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~e.base) c_func_to_recursive_line_14_to_16_0_~e.offset) 1) (not (= c_func_to_recursive_line_14_to_16_0_~b.base c_func_to_recursive_line_14_to_16_0_~uint32_max.base)) (not (= c_func_to_recursive_line_14_to_16_0_~d.base c_func_to_recursive_line_14_to_16_0_~uint32_max.base)) (forall ((func_to_recursive_line_14_to_16_0_~c.base Int) (v_func_to_recursive_line_14_to_16_0_~e.base_18 Int) (func_to_recursive_line_14_to_16_0_~c.offset Int) (v_ArrVal_90 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| c_func_to_recursive_line_14_to_16_0_~e.base v_ArrVal_90))) (let ((.cse3 (mod (select (select .cse4 func_to_recursive_line_14_to_16_0_~c.base) func_to_recursive_line_14_to_16_0_~c.offset) 4294967296)) (.cse5 (mod (select (select .cse4 c_func_to_recursive_line_14_to_16_0_~d.base) c_func_to_recursive_line_14_to_16_0_~d.offset) 4294967296)) (.cse6 (mod (select (select .cse4 v_func_to_recursive_line_14_to_16_0_~e.base_18) c_func_to_recursive_line_14_to_16_0_~e.offset) 4294967296))) (or (not (= .cse3 (mod (select (select .cse4 c_func_to_recursive_line_14_to_16_0_~b.base) c_func_to_recursive_line_14_to_16_0_~b.offset) 4294967296))) (not (= .cse5 .cse3)) (not (= .cse5 .cse6)) (not (= (mod (+ (select (select .cse4 c_func_to_recursive_line_14_to_16_0_~uint32_max.base) c_func_to_recursive_line_14_to_16_0_~uint32_max.offset) 4294967294) 4294967296) .cse6)))))) (forall ((func_to_recursive_line_14_to_16_0_~c.base Int) (v_func_to_recursive_line_14_to_16_0_~e.base_18 Int) (func_to_recursive_line_14_to_16_0_~c.offset Int) (v_ArrVal_90 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_func_to_recursive_line_14_to_16_0_#in~e.base| v_ArrVal_90))) (let ((.cse7 (mod (select (select .cse10 |c_func_to_recursive_line_14_to_16_0_#in~d.base|) |c_func_to_recursive_line_14_to_16_0_#in~d.offset|) 4294967296)) (.cse8 (mod (select (select .cse10 v_func_to_recursive_line_14_to_16_0_~e.base_18) |c_func_to_recursive_line_14_to_16_0_#in~e.offset|) 4294967296)) (.cse9 (mod (select (select .cse10 func_to_recursive_line_14_to_16_0_~c.base) func_to_recursive_line_14_to_16_0_~c.offset) 4294967296))) (or (not (= .cse7 .cse8)) (not (= .cse7 .cse9)) (not (= .cse8 (mod (+ 4294967294 (select (select .cse10 |c_func_to_recursive_line_14_to_16_0_#in~uint32_max.base|) |c_func_to_recursive_line_14_to_16_0_#in~uint32_max.offset|)) 4294967296))) (not (= (mod (select (select .cse10 |c_func_to_recursive_line_14_to_16_0_#in~b.base|) |c_func_to_recursive_line_14_to_16_0_#in~b.offset|) 4294967296) .cse9)))))) (not (= c_func_to_recursive_line_14_to_16_0_~b.base c_func_to_recursive_line_14_to_16_0_~d.base))) is different from false