./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/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_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/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_b3a3d52f-ff8c-46a1-9613-7b84802537b2/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 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:01:08,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:01:08,882 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 05:01:08,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:01:08,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:01:08,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:01:08,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:01:08,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:01:08,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:01:08,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:01:08,947 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:01:08,948 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:01:08,948 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:01:08,950 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:01:08,950 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:01:08,951 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:01:08,951 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:01:08,952 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:01:08,952 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:01:08,953 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:01:08,953 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:01:08,954 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:01:08,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:01:08,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 05:01:08,956 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:01:08,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:01:08,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:01:08,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:01:08,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 05:01:08,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:01:08,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 05:01:08,959 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:01:08,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 05:01:08,959 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:01:08,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:01:08,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:01:08,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:01:08,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:01:08,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:01:08,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 05:01:08,961 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:01:08,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:01:08,962 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 05:01:08,962 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:01:08,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:01:08,963 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_b3a3d52f-ff8c-46a1-9613-7b84802537b2/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_b3a3d52f-ff8c-46a1-9613-7b84802537b2/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 -> 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b [2023-11-19 05:01:09,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:01:09,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:01:09,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:01:09,258 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:01:09,258 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:01:09,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2023-11-19 05:01:12,386 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:01:12,613 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:01:12,613 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2023-11-19 05:01:12,621 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/data/5716ca432/980865d7135d4113b8b4978040097026/FLAGbb3a17d46 [2023-11-19 05:01:12,636 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/data/5716ca432/980865d7135d4113b8b4978040097026 [2023-11-19 05:01:12,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:01:12,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:01:12,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:01:12,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:01:12,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:01:12,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43bbdbd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12, skipping insertion in model container [2023-11-19 05:01:12,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,672 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:01:12,845 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_b3a3d52f-ff8c-46a1-9613-7b84802537b2/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2023-11-19 05:01:12,849 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:01:12,861 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:01:12,884 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_b3a3d52f-ff8c-46a1-9613-7b84802537b2/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2023-11-19 05:01:12,885 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:01:12,896 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:01:12,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12 WrapperNode [2023-11-19 05:01:12,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:01:12,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:01:12,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:01:12,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:01:12,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,927 INFO L138 Inliner]: procedures = 13, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2023-11-19 05:01:12,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:01:12,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:01:12,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:01:12,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:01:12,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,942 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:01:12,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:01:12,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:01:12,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:01:12,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (1/1) ... [2023-11-19 05:01:12,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:01:12,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:12,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:01:13,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:01:13,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:01:13,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:01:13,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 05:01:13,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:01:13,047 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2023-11-19 05:01:13,047 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2023-11-19 05:01:13,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:01:13,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:01:13,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 05:01:13,048 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2023-11-19 05:01:13,048 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2023-11-19 05:01:13,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:01:13,122 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:01:13,124 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:01:13,289 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:01:13,324 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:01:13,324 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 05:01:13,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:01:13 BoogieIcfgContainer [2023-11-19 05:01:13,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:01:13,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:01:13,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:01:13,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:01:13,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:01:12" (1/3) ... [2023-11-19 05:01:13,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ffeac22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:01:13, skipping insertion in model container [2023-11-19 05:01:13,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:01:12" (2/3) ... [2023-11-19 05:01:13,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ffeac22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:01:13, skipping insertion in model container [2023-11-19 05:01:13,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:01:13" (3/3) ... [2023-11-19 05:01:13,339 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2023-11-19 05:01:13,362 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:01:13,363 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 05:01:13,411 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:01:13,419 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;@7fdc2031, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:01:13,419 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 05:01:13,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 05:01:13,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 05:01:13,432 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:13,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:13,433 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:01:13,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:13,439 INFO L85 PathProgramCache]: Analyzing trace with hash 852594062, now seen corresponding path program 1 times [2023-11-19 05:01:13,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:13,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879366841] [2023-11-19 05:01:13,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:13,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:14,065 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 05:01:14,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:14,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879366841] [2023-11-19 05:01:14,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879366841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:01:14,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:01:14,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:01:14,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958571691] [2023-11-19 05:01:14,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:14,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:01:14,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:14,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:01:14,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:01:14,119 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:01:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:14,233 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2023-11-19 05:01:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:01:14,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2023-11-19 05:01:14,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:14,244 INFO L225 Difference]: With dead ends: 30 [2023-11-19 05:01:14,244 INFO L226 Difference]: Without dead ends: 22 [2023-11-19 05:01:14,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:01:14,255 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:14,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 38 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:01:14,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-19 05:01:14,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2023-11-19 05:01:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-19 05:01:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-11-19 05:01:14,300 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 9 [2023-11-19 05:01:14,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:14,300 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-11-19 05:01:14,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:01:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-11-19 05:01:14,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 05:01:14,302 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:14,303 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:14,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:01:14,303 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:01:14,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:14,304 INFO L85 PathProgramCache]: Analyzing trace with hash -677642422, now seen corresponding path program 1 times [2023-11-19 05:01:14,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:14,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631325836] [2023-11-19 05:01:14,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:14,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:14,611 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 05:01:14,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:14,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631325836] [2023-11-19 05:01:14,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631325836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:01:14,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:01:14,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:01:14,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455526869] [2023-11-19 05:01:14,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:01:14,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:01:14,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:14,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:01:14,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:01:14,616 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:01:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:14,721 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2023-11-19 05:01:14,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:01:14,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2023-11-19 05:01:14,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:14,723 INFO L225 Difference]: With dead ends: 40 [2023-11-19 05:01:14,723 INFO L226 Difference]: Without dead ends: 22 [2023-11-19 05:01:14,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:01:14,731 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:14,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 37 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:01:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-19 05:01:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-19 05:01:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 05:01:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-19 05:01:14,745 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 20 [2023-11-19 05:01:14,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:14,746 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-19 05:01:14,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:01:14,747 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-19 05:01:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-19 05:01:14,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:14,750 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:14,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:01:14,750 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:01:14,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:14,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1417902324, now seen corresponding path program 1 times [2023-11-19 05:01:14,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:14,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512946390] [2023-11-19 05:01:14,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:14,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 05:01:15,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:15,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512946390] [2023-11-19 05:01:15,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512946390] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:15,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789881187] [2023-11-19 05:01:15,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:15,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:15,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:15,329 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:01:15,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:01:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:15,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-19 05:01:15,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:01:15,486 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 05:01:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 05:01:15,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:01:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 05:01:16,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789881187] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:01:16,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1439866032] [2023-11-19 05:01:16,433 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-19 05:01:16,434 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:01:16,440 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 05:01:16,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:01:16,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 21 [2023-11-19 05:01:16,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128319999] [2023-11-19 05:01:16,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:01:16,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-19 05:01:16,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:16,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-19 05:01:16,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-11-19 05:01:16,460 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 21 states, 16 states have (on average 1.875) internal successors, (30), 18 states have internal predecessors, (30), 7 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-19 05:01:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:16,745 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2023-11-19 05:01:16,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 05:01:16,746 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 1.875) internal successors, (30), 18 states have internal predecessors, (30), 7 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) Word has length 25 [2023-11-19 05:01:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:16,748 INFO L225 Difference]: With dead ends: 46 [2023-11-19 05:01:16,749 INFO L226 Difference]: Without dead ends: 26 [2023-11-19 05:01:16,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2023-11-19 05:01:16,753 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:16,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 80 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:01:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-19 05:01:16,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-19 05:01:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-19 05:01:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-11-19 05:01:16,764 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 25 [2023-11-19 05:01:16,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:16,765 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-11-19 05:01:16,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 1.875) internal successors, (30), 18 states have internal predecessors, (30), 7 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-19 05:01:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-11-19 05:01:16,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-19 05:01:16,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:16,766 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:16,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 05:01:16,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:16,967 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:01:16,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:16,968 INFO L85 PathProgramCache]: Analyzing trace with hash 99781820, now seen corresponding path program 2 times [2023-11-19 05:01:16,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:16,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013430019] [2023-11-19 05:01:16,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:16,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-19 05:01:17,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:17,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013430019] [2023-11-19 05:01:17,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013430019] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:17,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295480498] [2023-11-19 05:01:17,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 05:01:17,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:17,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:17,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:01:17,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:01:18,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-19 05:01:18,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:01:18,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-19 05:01:18,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:01:18,045 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 05:01:18,050 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 18 treesize of output 16 [2023-11-19 05:01:18,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:01:18,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2023-11-19 05:01:18,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 18 treesize of output 13 [2023-11-19 05:01:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-19 05:01:18,519 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:01:18,865 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_101 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_101) |c_ULTIMATE.start_main_~#a~0#1.base|) |c_ULTIMATE.start_main_~#a~0#1.offset|) 5)) is different from false [2023-11-19 05:01:18,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295480498] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:18,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1608058051] [2023-11-19 05:01:18,872 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-19 05:01:18,872 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:01:18,872 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 05:01:18,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:01:18,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2023-11-19 05:01:18,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203624564] [2023-11-19 05:01:18,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:01:18,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-19 05:01:18,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:18,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-19 05:01:18,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=1, NotChecked=46, Total=650 [2023-11-19 05:01:18,876 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 25 states, 18 states have (on average 2.0) internal successors, (36), 24 states have internal predecessors, (36), 9 states have call successors, (9), 2 states have call predecessors, (9), 10 states have return successors, (11), 7 states have call predecessors, (11), 9 states have call successors, (11) [2023-11-19 05:01:19,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:19,412 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2023-11-19 05:01:19,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 05:01:19,413 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 18 states have (on average 2.0) internal successors, (36), 24 states have internal predecessors, (36), 9 states have call successors, (9), 2 states have call predecessors, (9), 10 states have return successors, (11), 7 states have call predecessors, (11), 9 states have call successors, (11) Word has length 35 [2023-11-19 05:01:19,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:19,414 INFO L225 Difference]: With dead ends: 54 [2023-11-19 05:01:19,414 INFO L226 Difference]: Without dead ends: 30 [2023-11-19 05:01:19,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=958, Unknown=2, NotChecked=64, Total=1190 [2023-11-19 05:01:19,416 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 20 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:19,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 84 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:01:19,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-19 05:01:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-19 05:01:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 8 states have return successors, (10), 8 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-19 05:01:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-11-19 05:01:19,424 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 35 [2023-11-19 05:01:19,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:19,424 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-11-19 05:01:19,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 18 states have (on average 2.0) internal successors, (36), 24 states have internal predecessors, (36), 9 states have call successors, (9), 2 states have call predecessors, (9), 10 states have return successors, (11), 7 states have call predecessors, (11), 9 states have call successors, (11) [2023-11-19 05:01:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-11-19 05:01:19,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-19 05:01:19,427 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:19,427 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:19,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 05:01:19,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:19,649 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:01:19,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:19,650 INFO L85 PathProgramCache]: Analyzing trace with hash -281922874, now seen corresponding path program 3 times [2023-11-19 05:01:19,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:19,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872647986] [2023-11-19 05:01:19,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:19,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 11 proven. 144 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-11-19 05:01:20,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:20,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872647986] [2023-11-19 05:01:20,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872647986] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:21,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645640890] [2023-11-19 05:01:21,000 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 05:01:21,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:21,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:21,001 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:01:21,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 05:01:21,123 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 05:01:21,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:01:21,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-19 05:01:21,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:01:21,137 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 05:01:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 121 proven. 24 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-11-19 05:01:21,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:01:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 4 proven. 165 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-19 05:01:23,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645640890] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:01:23,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1311333137] [2023-11-19 05:01:23,720 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-19 05:01:23,720 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:01:23,720 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 05:01:23,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:01:23,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 22] total 38 [2023-11-19 05:01:23,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648544498] [2023-11-19 05:01:23,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:01:23,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-19 05:01:23,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:23,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-19 05:01:23,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1123, Unknown=0, NotChecked=0, Total=1406 [2023-11-19 05:01:23,725 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 38 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 32 states have internal predecessors, (56), 11 states have call successors, (17), 8 states have call predecessors, (17), 13 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) [2023-11-19 05:01:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:24,167 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2023-11-19 05:01:24,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 05:01:24,168 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 32 states have internal predecessors, (56), 11 states have call successors, (17), 8 states have call predecessors, (17), 13 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) Word has length 71 [2023-11-19 05:01:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:24,169 INFO L225 Difference]: With dead ends: 62 [2023-11-19 05:01:24,170 INFO L226 Difference]: Without dead ends: 34 [2023-11-19 05:01:24,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 123 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=390, Invalid=1590, Unknown=0, NotChecked=0, Total=1980 [2023-11-19 05:01:24,172 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:24,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 164 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:01:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-19 05:01:24,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-19 05:01:24,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-19 05:01:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2023-11-19 05:01:24,180 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 71 [2023-11-19 05:01:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:24,180 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2023-11-19 05:01:24,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 32 states have internal predecessors, (56), 11 states have call successors, (17), 8 states have call predecessors, (17), 13 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) [2023-11-19 05:01:24,181 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2023-11-19 05:01:24,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-19 05:01:24,182 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:24,182 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:24,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 05:01:24,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:24,399 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:01:24,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:24,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1096031430, now seen corresponding path program 4 times [2023-11-19 05:01:24,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:24,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802970973] [2023-11-19 05:01:24,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:24,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:33,820 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 18 proven. 64 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2023-11-19 05:01:33,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:01:33,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802970973] [2023-11-19 05:01:33,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802970973] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:33,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595635380] [2023-11-19 05:01:33,821 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-19 05:01:33,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:01:33,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:01:33,823 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:01:33,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 05:01:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:01:34,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 141 conjunts are in the unsatisfiable core [2023-11-19 05:01:34,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:01:34,065 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 10 treesize of output 8 [2023-11-19 05:01:34,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 05:01:36,425 WARN L854 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_28| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_28| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_21_to_21_0_#in~b.base|) (= |v_old(#memory_int)_AFTER_CALL_28| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_28| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))))) is different from false [2023-11-19 05:01:38,427 WARN L876 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_28| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_28| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_21_to_21_0_#in~b.base|) (= |v_old(#memory_int)_AFTER_CALL_28| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_28| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))))) is different from true [2023-11-19 05:01:40,473 WARN L854 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))) is different from false [2023-11-19 05:01:42,488 WARN L876 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))) is different from true [2023-11-19 05:01:44,825 WARN L854 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_60| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_60| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_21_to_21_0_#in~b.base|) (= (store |v_#memory_int_BEFORE_CALL_60| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_60| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_60|))))) is different from false [2023-11-19 05:01:46,828 WARN L876 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_60| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_60| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_21_to_21_0_#in~b.base|) (= (store |v_#memory_int_BEFORE_CALL_60| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_60| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_60|))))) is different from true [2023-11-19 05:01:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 21 proven. 75 refuted. 0 times theorem prover too weak. 313 trivial. 36 not checked. [2023-11-19 05:01:47,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:01:48,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595635380] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:01:48,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [194773536] [2023-11-19 05:01:48,076 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-19 05:01:48,077 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:01:48,077 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 05:01:48,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:01:48,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 28 [2023-11-19 05:01:48,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737751686] [2023-11-19 05:01:48,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:01:48,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-19 05:01:48,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:01:48,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-19 05:01:48,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=600, Unknown=6, NotChecked=156, Total=870 [2023-11-19 05:01:48,080 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 29 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (16), 13 states have call predecessors, (16), 10 states have call successors, (16) [2023-11-19 05:01:50,272 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|))) (and (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_60| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_60| |c_#memory_int|))) (and (= .cse1 |c_func_to_recursive_line_21_to_21_0_#in~b.base|) (= (store |v_#memory_int_BEFORE_CALL_60| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_60| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_60|))))) (= (store |c_old(#memory_int)| c_func_to_recursive_line_21_to_21_0_~b.base (select |c_#memory_int| c_func_to_recursive_line_21_to_21_0_~b.base)) |c_#memory_int|) (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse2 |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| c_func_to_recursive_line_21_to_21_0_~b.base) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_28| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_28| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= .cse3 |c_func_to_recursive_line_21_to_21_0_#in~b.base|) (= |v_old(#memory_int)_AFTER_CALL_28| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_28| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))))))) is different from false [2023-11-19 05:01:50,277 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|))) (and (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_60| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int_BEFORE_CALL_60| |c_#memory_int|))) (and (= .cse1 |c_func_to_recursive_line_21_to_21_0_#in~b.base|) (= (store |v_#memory_int_BEFORE_CALL_60| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_60| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_60|))))) (= (store |c_old(#memory_int)| c_func_to_recursive_line_21_to_21_0_~b.base (select |c_#memory_int| c_func_to_recursive_line_21_to_21_0_~b.base)) |c_#memory_int|) (or .cse0 (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse2 |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| c_func_to_recursive_line_21_to_21_0_~b.base) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_28| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_28| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_28| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= .cse3 |c_func_to_recursive_line_21_to_21_0_#in~b.base|) (= |v_old(#memory_int)_AFTER_CALL_28| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_28| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))))))) is different from true [2023-11-19 05:01:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:01:50,668 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2023-11-19 05:01:50,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-19 05:01:50,669 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (16), 13 states have call predecessors, (16), 10 states have call successors, (16) Word has length 91 [2023-11-19 05:01:50,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:01:50,671 INFO L225 Difference]: With dead ends: 42 [2023-11-19 05:01:50,671 INFO L226 Difference]: Without dead ends: 38 [2023-11-19 05:01:50,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 121 SyntacticMatches, 12 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=162, Invalid=838, Unknown=8, NotChecked=252, Total=1260 [2023-11-19 05:01:50,673 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:01:50,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 214 Invalid, 2 Unknown, 111 Unchecked, 0.3s Time] [2023-11-19 05:01:50,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-19 05:01:50,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-19 05:01:50,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 12 states have return successors, (14), 12 states have call predecessors, (14), 4 states have call successors, (14) [2023-11-19 05:01:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2023-11-19 05:01:50,683 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 91 [2023-11-19 05:01:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:01:50,684 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2023-11-19 05:01:50,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (16), 13 states have call predecessors, (16), 10 states have call successors, (16) [2023-11-19 05:01:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2023-11-19 05:01:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-11-19 05:01:50,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:01:50,687 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:01:50,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 05:01:50,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3a3d52f-ff8c-46a1-9613-7b84802537b2/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 05:01:50,901 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 05:01:50,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:01:50,902 INFO L85 PathProgramCache]: Analyzing trace with hash -485109762, now seen corresponding path program 5 times [2023-11-19 05:01:50,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:01:50,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295019367] [2023-11-19 05:01:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:01:50,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:01:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat