./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 0e0057cc 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_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/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_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh --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.4-dev-0e0057c [2023-12-02 19:38:11,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:38:11,877 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 19:38:11,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:38:11,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:38:11,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:38:11,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:38:11,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:38:11,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:38:11,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:38:11,910 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:38:11,910 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:38:11,911 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:38:11,912 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 19:38:11,912 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:38:11,913 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:38:11,913 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 19:38:11,914 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 19:38:11,914 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:38:11,915 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 19:38:11,915 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 19:38:11,916 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 19:38:11,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:38:11,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 19:38:11,918 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:38:11,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 19:38:11,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:38:11,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:38:11,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 19:38:11,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:38:11,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 19:38:11,921 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:38:11,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 19:38:11,921 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:38:11,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:38:11,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:38:11,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:38:11,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:38:11,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:38:11,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:38:11,923 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 19:38:11,923 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 19:38:11,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 19:38:11,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:38:11,924 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 19:38:11,924 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:38:11,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:38:11,925 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_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/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_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh 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-12-02 19:38:12,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:38:12,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:38:12,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:38:12,154 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:38:12,155 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:38:12,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2023-12-02 19:38:14,948 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:38:15,102 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:38:15,103 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2023-12-02 19:38:15,110 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/data/3c4b94ef7/e9d4d0d209f44f68b7d4334fbce6fad7/FLAGd155b3d37 [2023-12-02 19:38:15,124 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/data/3c4b94ef7/e9d4d0d209f44f68b7d4334fbce6fad7 [2023-12-02 19:38:15,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:38:15,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:38:15,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:38:15,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:38:15,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:38:15,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:38:15" (1/1) ... [2023-12-02 19:38:15,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6822164b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:15, skipping insertion in model container [2023-12-02 19:38:15,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:38:15" (1/1) ... [2023-12-02 19:38:15,155 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:38:15,284 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_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2023-12-02 19:38:15,288 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:38:15,298 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:38:15,312 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_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2023-12-02 19:38:15,314 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:38:15,326 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:38:15,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:15 WrapperNode [2023-12-02 19:38:15,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:38:15,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:38:15,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:38:15,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:38:15,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:15" (1/1) ... [2023-12-02 19:38:15,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:15" (1/1) ... [2023-12-02 19:38:15,356 INFO L138 Inliner]: procedures = 13, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2023-12-02 19:38:15,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:38:15,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:38:15,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:38:15,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:38:15,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:15" (1/1) ... [2023-12-02 19:38:15,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:15" (1/1) ... [2023-12-02 19:38:15,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:15" (1/1) ... [2023-12-02 19:38:15,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:15" (1/1) ... [2023-12-02 19:38:15,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:15" (1/1) ... [2023-12-02 19:38:15,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:15" (1/1) ... [2023-12-02 19:38:15,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:15" (1/1) ... [2023-12-02 19:38:15,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:15" (1/1) ... [2023-12-02 19:38:15,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:38:15,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:38:15,381 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:38:15,381 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:38:15,382 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:15" (1/1) ... [2023-12-02 19:38:15,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:38:15,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:38:15,411 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 19:38:15,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 19:38:15,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:38:15,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 19:38:15,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 19:38:15,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 19:38:15,445 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2023-12-02 19:38:15,445 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2023-12-02 19:38:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:38:15,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:38:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 19:38:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2023-12-02 19:38:15,446 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2023-12-02 19:38:15,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 19:38:15,516 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:38:15,519 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:38:15,666 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:38:15,703 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:38:15,704 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 19:38:15,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:38:15 BoogieIcfgContainer [2023-12-02 19:38:15,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:38:15,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:38:15,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:38:15,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:38:15,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:38:15" (1/3) ... [2023-12-02 19:38:15,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e822e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:38:15, skipping insertion in model container [2023-12-02 19:38:15,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:38:15" (2/3) ... [2023-12-02 19:38:15,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e822e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:38:15, skipping insertion in model container [2023-12-02 19:38:15,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:38:15" (3/3) ... [2023-12-02 19:38:15,715 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2023-12-02 19:38:15,730 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:38:15,731 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 19:38:15,775 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:38:15,781 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;@532e23ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:38:15,781 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 19:38:15,785 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-12-02 19:38:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 19:38:15,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:38:15,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:38:15,792 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:38:15,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:38:15,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1634918771, now seen corresponding path program 1 times [2023-12-02 19:38:15,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:38:15,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588790658] [2023-12-02 19:38:15,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:15,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:38:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:38:16,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:38:16,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588790658] [2023-12-02 19:38:16,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588790658] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:38:16,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:38:16,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:38:16,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309187326] [2023-12-02 19:38:16,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:38:16,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:38:16,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:38:16,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:38:16,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:38:16,308 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-12-02 19:38:16,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:38:16,415 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2023-12-02 19:38:16,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:38:16,418 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-12-02 19:38:16,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:38:16,426 INFO L225 Difference]: With dead ends: 30 [2023-12-02 19:38:16,426 INFO L226 Difference]: Without dead ends: 22 [2023-12-02 19:38:16,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 19:38:16,433 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-12-02 19:38:16,434 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-12-02 19:38:16,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-02 19:38:16,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2023-12-02 19:38:16,470 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-12-02 19:38:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-12-02 19:38:16,472 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 9 [2023-12-02 19:38:16,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:38:16,473 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-12-02 19:38:16,473 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-12-02 19:38:16,473 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-12-02 19:38:16,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 19:38:16,475 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:38:16,475 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:38:16,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 19:38:16,476 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:38:16,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:38:16,477 INFO L85 PathProgramCache]: Analyzing trace with hash -268818197, now seen corresponding path program 1 times [2023-12-02 19:38:16,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:38:16,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122268399] [2023-12-02 19:38:16,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:16,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:38:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:16,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 19:38:16,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:38:16,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122268399] [2023-12-02 19:38:16,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122268399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:38:16,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:38:16,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 19:38:16,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280698483] [2023-12-02 19:38:16,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:38:16,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:38:16,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:38:16,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:38:16,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:38:16,691 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-12-02 19:38:16,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:38:16,763 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2023-12-02 19:38:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:38:16,764 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-12-02 19:38:16,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:38:16,765 INFO L225 Difference]: With dead ends: 40 [2023-12-02 19:38:16,765 INFO L226 Difference]: Without dead ends: 22 [2023-12-02 19:38:16,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 19:38:16,768 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-02 19:38:16,768 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-12-02 19:38:16,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-02 19:38:16,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-02 19:38:16,774 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-12-02 19:38:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-12-02 19:38:16,776 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 20 [2023-12-02 19:38:16,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:38:16,776 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-12-02 19:38:16,777 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-12-02 19:38:16,777 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-12-02 19:38:16,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 19:38:16,778 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:38:16,778 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-12-02 19:38:16,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 19:38:16,779 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:38:16,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:38:16,780 INFO L85 PathProgramCache]: Analyzing trace with hash 659307019, now seen corresponding path program 1 times [2023-12-02 19:38:16,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:38:16,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143172966] [2023-12-02 19:38:16,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:16,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:38:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:17,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 19:38:17,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:38:17,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143172966] [2023-12-02 19:38:17,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143172966] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:38:17,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399757171] [2023-12-02 19:38:17,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:17,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:38:17,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:38:17,206 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:38:17,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 19:38:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:17,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 19:38:17,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:17,369 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-12-02 19:38:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 19:38:17,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:38:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 19:38:18,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399757171] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:38:18,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1723946988] [2023-12-02 19:38:18,133 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 19:38:18,133 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:38:18,138 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-12-02 19:38:18,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:38:18,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 21 [2023-12-02 19:38:18,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012473104] [2023-12-02 19:38:18,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:38:18,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 19:38:18,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:38:18,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 19:38:18,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-12-02 19:38:18,143 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-12-02 19:38:18,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:38:18,377 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2023-12-02 19:38:18,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 19:38:18,378 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-12-02 19:38:18,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:38:18,379 INFO L225 Difference]: With dead ends: 46 [2023-12-02 19:38:18,379 INFO L226 Difference]: Without dead ends: 26 [2023-12-02 19:38:18,380 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-12-02 19:38:18,382 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-12-02 19:38:18,382 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-12-02 19:38:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-02 19:38:18,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-02 19:38:18,389 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-12-02 19:38:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-02 19:38:18,390 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 25 [2023-12-02 19:38:18,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:38:18,391 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-02 19:38:18,391 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-12-02 19:38:18,391 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-02 19:38:18,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 19:38:18,393 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:38:18,393 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-12-02 19:38:18,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 19:38:18,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:38:18,596 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:38:18,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:38:18,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1625699077, now seen corresponding path program 2 times [2023-12-02 19:38:18,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:38:18,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722671183] [2023-12-02 19:38:18,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:18,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:38:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 19:38:19,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:38:19,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722671183] [2023-12-02 19:38:19,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722671183] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:38:19,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659774828] [2023-12-02 19:38:19,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:38:19,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:38:19,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:38:19,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:38:19,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 19:38:19,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 19:38:19,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:38:19,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-02 19:38:19,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:19,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 19:38:19,671 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 19:38:19,672 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:38:21,108 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 19:38:21,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659774828] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:38:21,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1564273380] [2023-12-02 19:38:21,111 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 19:38:21,111 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:38:21,112 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-12-02 19:38:21,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:38:21,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 18] total 35 [2023-12-02 19:38:21,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002491740] [2023-12-02 19:38:21,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:38:21,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 19:38:21,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:38:21,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 19:38:21,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=966, Unknown=0, NotChecked=0, Total=1190 [2023-12-02 19:38:21,116 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 35 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 30 states have internal predecessors, (43), 11 states have call successors, (12), 7 states have call predecessors, (12), 11 states have return successors, (15), 8 states have call predecessors, (15), 11 states have call successors, (15) [2023-12-02 19:38:21,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:38:21,486 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2023-12-02 19:38:21,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 19:38:21,487 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 30 states have internal predecessors, (43), 11 states have call successors, (12), 7 states have call predecessors, (12), 11 states have return successors, (15), 8 states have call predecessors, (15), 11 states have call successors, (15) Word has length 35 [2023-12-02 19:38:21,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:38:21,488 INFO L225 Difference]: With dead ends: 54 [2023-12-02 19:38:21,489 INFO L226 Difference]: Without dead ends: 30 [2023-12-02 19:38:21,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=314, Invalid=1408, Unknown=0, NotChecked=0, Total=1722 [2023-12-02 19:38:21,491 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:38:21,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 132 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:38:21,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-02 19:38:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-02 19:38:21,496 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-12-02 19:38:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-12-02 19:38:21,497 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 35 [2023-12-02 19:38:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:38:21,497 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-12-02 19:38:21,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 30 states have internal predecessors, (43), 11 states have call successors, (12), 7 states have call predecessors, (12), 11 states have return successors, (15), 8 states have call predecessors, (15), 11 states have call successors, (15) [2023-12-02 19:38:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-12-02 19:38:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 19:38:21,499 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:38:21,499 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:38:21,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 19:38:21,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:38:21,700 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:38:21,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:38:21,700 INFO L85 PathProgramCache]: Analyzing trace with hash 167978987, now seen corresponding path program 3 times [2023-12-02 19:38:21,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:38:21,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754868828] [2023-12-02 19:38:21,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:21,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:38:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 19:38:22,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:38:22,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754868828] [2023-12-02 19:38:22,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754868828] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:38:22,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763520548] [2023-12-02 19:38:22,620 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 19:38:22,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:38:22,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:38:22,621 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:38:22,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 19:38:22,711 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 19:38:22,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:38:22,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 80 conjunts are in the unsatisfiable core [2023-12-02 19:38:22,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:22,739 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-12-02 19:38:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 35 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-02 19:38:23,076 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:38:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 19:38:25,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763520548] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:38:25,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [139592016] [2023-12-02 19:38:25,360 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 19:38:25,360 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:38:25,360 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-12-02 19:38:25,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:38:25,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 26] total 45 [2023-12-02 19:38:25,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005379695] [2023-12-02 19:38:25,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:38:25,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-02 19:38:25,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:38:25,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-02 19:38:25,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1616, Unknown=0, NotChecked=0, Total=1980 [2023-12-02 19:38:25,364 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 45 states, 34 states have (on average 1.5) internal successors, (51), 38 states have internal predecessors, (51), 13 states have call successors, (14), 9 states have call predecessors, (14), 15 states have return successors, (21), 12 states have call predecessors, (21), 13 states have call successors, (21) [2023-12-02 19:38:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:38:25,828 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2023-12-02 19:38:25,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 19:38:25,829 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 34 states have (on average 1.5) internal successors, (51), 38 states have internal predecessors, (51), 13 states have call successors, (14), 9 states have call predecessors, (14), 15 states have return successors, (21), 12 states have call predecessors, (21), 13 states have call successors, (21) Word has length 45 [2023-12-02 19:38:25,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:38:25,830 INFO L225 Difference]: With dead ends: 60 [2023-12-02 19:38:25,830 INFO L226 Difference]: Without dead ends: 32 [2023-12-02 19:38:25,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=504, Invalid=2252, Unknown=0, NotChecked=0, Total=2756 [2023-12-02 19:38:25,833 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 33 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:38:25,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 171 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:38:25,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-02 19:38:25,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-02 19:38:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (11), 9 states have call predecessors, (11), 4 states have call successors, (11) [2023-12-02 19:38:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-12-02 19:38:25,840 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 45 [2023-12-02 19:38:25,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:38:25,841 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-12-02 19:38:25,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 34 states have (on average 1.5) internal successors, (51), 38 states have internal predecessors, (51), 13 states have call successors, (14), 9 states have call predecessors, (14), 15 states have return successors, (21), 12 states have call predecessors, (21), 13 states have call successors, (21) [2023-12-02 19:38:25,841 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-12-02 19:38:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 19:38:25,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:38:25,843 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:38:25,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 19:38:26,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:38:26,044 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:38:26,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:38:26,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1170219963, now seen corresponding path program 4 times [2023-12-02 19:38:26,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:38:26,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619734981] [2023-12-02 19:38:26,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:26,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:38:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-12-02 19:38:29,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:38:29,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619734981] [2023-12-02 19:38:29,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619734981] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:38:29,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134943455] [2023-12-02 19:38:29,804 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 19:38:29,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:38:29,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:38:29,805 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:38:29,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 19:38:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:29,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 83 conjunts are in the unsatisfiable core [2023-12-02 19:38:29,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:29,939 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-12-02 19:38:29,943 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 11 treesize of output 7 [2023-12-02 19:38:30,217 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_23| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_23| |c_#memory_int|))) (and (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_23| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_23| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))))) is different from false [2023-12-02 19:38:30,223 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_23| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_23| |c_#memory_int|))) (and (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_23| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_23| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))))) is different from true [2023-12-02 19:38:30,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:30,421 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-12-02 19:38:30,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:38:30,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 1 [2023-12-02 19:38:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 72 trivial. 6 not checked. [2023-12-02 19:38:30,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:38:30,763 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_240 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_240) |c_ULTIMATE.start_main_~#a~0#1.base|) |c_ULTIMATE.start_main_~#a~0#1.offset|) 5)) is different from false [2023-12-02 19:38:30,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134943455] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:38:30,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [63349346] [2023-12-02 19:38:30,766 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 19:38:30,766 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:38:30,767 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-12-02 19:38:30,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:38:30,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 20 [2023-12-02 19:38:30,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820182479] [2023-12-02 19:38:30,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:38:30,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 19:38:30,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:38:30,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 19:38:30,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=312, Unknown=3, NotChecked=74, Total=462 [2023-12-02 19:38:30,769 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 21 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 17 states have internal predecessors, (25), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-02 19:38:30,893 WARN L854 $PredicateComparison]: unable to prove that (and (= (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 (= (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_23| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_23| |c_#memory_int|))) (and (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_23| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_23| |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)) is different from false [2023-12-02 19:38:30,899 WARN L876 $PredicateComparison]: unable to prove that (and (= (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 (= (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_23| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_23| |c_#memory_int|))) (and (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_23| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_23| |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)) is different from true [2023-12-02 19:38:30,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:38:30,997 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2023-12-02 19:38:30,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 19:38:30,998 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 17 states have internal predecessors, (25), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) Word has length 50 [2023-12-02 19:38:30,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:38:30,999 INFO L225 Difference]: With dead ends: 38 [2023-12-02 19:38:30,999 INFO L226 Difference]: Without dead ends: 34 [2023-12-02 19:38:31,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=408, Unknown=5, NotChecked=132, Total=650 [2023-12-02 19:38:31,001 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:38:31,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 93 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 1 Unknown, 43 Unchecked, 0.2s Time] [2023-12-02 19:38:31,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-02 19:38:31,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-02 19:38:31,008 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-12-02 19:38:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2023-12-02 19:38:31,009 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 50 [2023-12-02 19:38:31,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:38:31,009 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2023-12-02 19:38:31,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 17 states have internal predecessors, (25), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-02 19:38:31,010 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2023-12-02 19:38:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-02 19:38:31,012 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:38:31,012 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-12-02 19:38:31,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 19:38:31,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:38:31,213 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:38:31,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:38:31,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2066322437, now seen corresponding path program 5 times [2023-12-02 19:38:31,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:38:31,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502271783] [2023-12-02 19:38:31,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:31,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:38:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 18 proven. 64 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2023-12-02 19:38:36,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:38:36,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502271783] [2023-12-02 19:38:36,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502271783] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:38:36,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555892197] [2023-12-02 19:38:36,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:38:36,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:38:36,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:38:36,397 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:38:36,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 19:38:36,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-12-02 19:38:36,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:38:36,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 158 conjunts are in the unsatisfiable core [2023-12-02 19:38:36,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:36,657 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-12-02 19:38:36,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9 [2023-12-02 19:38:37,577 INFO L349 Elim1Store]: treesize reduction 34, result has 47.7 percent of original size [2023-12-02 19:38:37,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 87 [2023-12-02 19:38:37,672 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:38:37,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 5 [2023-12-02 19:38:37,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 19:38:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 246 proven. 58 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2023-12-02 19:38:37,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:38:39,153 INFO L349 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2023-12-02 19:38:39,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 57 [2023-12-02 19:38:39,162 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:38:39,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2023-12-02 19:38:39,169 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 38 treesize of output 34 [2023-12-02 19:38:45,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555892197] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:38:45,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1287182074] [2023-12-02 19:38:45,666 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 19:38:45,666 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:38:45,666 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-12-02 19:38:45,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:38:45,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 27] total 40 [2023-12-02 19:38:45,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555945060] [2023-12-02 19:38:45,667 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:38:45,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-02 19:38:45,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:38:45,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-02 19:38:45,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1888, Unknown=4, NotChecked=0, Total=2070 [2023-12-02 19:38:45,670 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 40 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 36 states have internal predecessors, (49), 12 states have call successors, (13), 2 states have call predecessors, (13), 15 states have return successors, (19), 18 states have call predecessors, (19), 12 states have call successors, (19) [2023-12-02 19:38:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:38:47,134 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2023-12-02 19:38:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 19:38:47,134 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 36 states have internal predecessors, (49), 12 states have call successors, (13), 2 states have call predecessors, (13), 15 states have return successors, (19), 18 states have call predecessors, (19), 12 states have call successors, (19) Word has length 91 [2023-12-02 19:38:47,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:38:47,136 INFO L225 Difference]: With dead ends: 48 [2023-12-02 19:38:47,136 INFO L226 Difference]: Without dead ends: 44 [2023-12-02 19:38:47,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=353, Invalid=3802, Unknown=5, NotChecked=0, Total=4160 [2023-12-02 19:38:47,139 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 24 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:38:47,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 338 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 688 Invalid, 2 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 19:38:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-02 19:38:47,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2023-12-02 19:38:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (13), 11 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-02 19:38:47,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2023-12-02 19:38:47,148 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 91 [2023-12-02 19:38:47,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:38:47,149 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2023-12-02 19:38:47,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 36 states have internal predecessors, (49), 12 states have call successors, (13), 2 states have call predecessors, (13), 15 states have return successors, (19), 18 states have call predecessors, (19), 12 states have call successors, (19) [2023-12-02 19:38:47,149 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2023-12-02 19:38:47,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-02 19:38:47,151 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:38:47,151 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:38:47,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 19:38:47,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:38:47,352 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:38:47,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:38:47,352 INFO L85 PathProgramCache]: Analyzing trace with hash -4769101, now seen corresponding path program 6 times [2023-12-02 19:38:47,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:38:47,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703481723] [2023-12-02 19:38:47,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:38:47,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:38:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:38:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 56 proven. 127 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2023-12-02 19:38:54,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:38:54,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703481723] [2023-12-02 19:38:54,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703481723] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:38:54,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236032272] [2023-12-02 19:38:54,070 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 19:38:54,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:38:54,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:38:54,071 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:38:54,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 19:38:54,257 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 19:38:54,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:38:54,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 251 conjunts are in the unsatisfiable core [2023-12-02 19:38:54,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:38:54,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9 [2023-12-02 19:38:54,543 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2023-12-02 19:38:54,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 40 [2023-12-02 19:38:54,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9 [2023-12-02 19:38:55,430 INFO L349 Elim1Store]: treesize reduction 34, result has 47.7 percent of original size [2023-12-02 19:38:55,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 87 [2023-12-02 19:38:55,466 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-12-02 19:38:55,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 27 [2023-12-02 19:38:55,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 19:38:55,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:38:55,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2023-12-02 19:38:55,645 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 19:38:55,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 21 [2023-12-02 19:38:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 356 proven. 408 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2023-12-02 19:38:55,787 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:38:58,584 INFO L349 Elim1Store]: treesize reduction 142, result has 51.5 percent of original size [2023-12-02 19:38:58,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 1211 treesize of output 705 [2023-12-02 19:38:58,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:38:58,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 661 treesize of output 679 [2023-12-02 19:38:58,811 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 6 treesize of output 4 [2023-12-02 19:39:00,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:39:00,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 47 [2023-12-02 19:39:00,495 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 6 treesize of output 4 [2023-12-02 19:39:00,627 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 6 treesize of output 4 [2023-12-02 19:39:04,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:39:04,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 237 [2023-12-02 19:39:04,954 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-12-02 19:39:04,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 8 treesize of output 6 [2023-12-02 19:39:05,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 19:39:05,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 19:39:05,074 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 19:39:05,127 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 8 treesize of output 6 [2023-12-02 19:39:05,224 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 19:39:05,232 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 19:39:05,269 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-02 19:39:05,309 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 8 treesize of output 6 [2023-12-02 19:39:06,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 19:39:06,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:39:06,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 59 [2023-12-02 19:39:06,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 19:39:06,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:39:06,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2023-12-02 19:39:06,784 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 6 treesize of output 4 [2023-12-02 19:39:06,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 19:39:06,824 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-02 19:39:06,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2023-12-02 19:39:07,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 19:39:07,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:39:07,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 689 treesize of output 659 [2023-12-02 19:39:14,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:39:14,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 813 treesize of output 727 [2023-12-02 19:39:17,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236032272] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:39:17,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1318909050] [2023-12-02 19:39:17,106 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 19:39:17,106 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:39:17,106 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-12-02 19:39:17,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:39:17,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 32] total 47 [2023-12-02 19:39:17,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008443404] [2023-12-02 19:39:17,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:39:17,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-12-02 19:39:17,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:39:17,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-12-02 19:39:17,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2453, Unknown=0, NotChecked=0, Total=2652 [2023-12-02 19:39:17,110 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 47 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 42 states have internal predecessors, (58), 15 states have call successors, (18), 2 states have call predecessors, (18), 18 states have return successors, (26), 23 states have call predecessors, (26), 15 states have call successors, (26) [2023-12-02 19:39:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:39:18,849 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2023-12-02 19:39:18,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-02 19:39:18,850 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 42 states have internal predecessors, (58), 15 states have call successors, (18), 2 states have call predecessors, (18), 18 states have return successors, (26), 23 states have call predecessors, (26), 15 states have call successors, (26) Word has length 132 [2023-12-02 19:39:18,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:39:18,851 INFO L225 Difference]: With dead ends: 56 [2023-12-02 19:39:18,851 INFO L226 Difference]: Without dead ends: 42 [2023-12-02 19:39:18,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1632 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=501, Invalid=5199, Unknown=0, NotChecked=0, Total=5700 [2023-12-02 19:39:18,854 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 68 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:39:18,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 286 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 19:39:18,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-02 19:39:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-02 19:39:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 13 states have return successors, (20), 14 states have call predecessors, (20), 5 states have call successors, (20) [2023-12-02 19:39:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2023-12-02 19:39:18,860 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 132 [2023-12-02 19:39:18,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:39:18,861 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2023-12-02 19:39:18,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 42 states have internal predecessors, (58), 15 states have call successors, (18), 2 states have call predecessors, (18), 18 states have return successors, (26), 23 states have call predecessors, (26), 15 states have call successors, (26) [2023-12-02 19:39:18,861 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2023-12-02 19:39:18,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-02 19:39:18,863 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:39:18,863 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 25, 25, 25, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:39:18,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 19:39:19,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:39:19,064 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:39:19,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:39:19,064 INFO L85 PathProgramCache]: Analyzing trace with hash 116827393, now seen corresponding path program 7 times [2023-12-02 19:39:19,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:39:19,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325546391] [2023-12-02 19:39:19,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:39:19,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:39:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:39:20,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 786 proven. 32 refuted. 0 times theorem prover too weak. 1164 trivial. 0 not checked. [2023-12-02 19:39:20,441 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:39:20,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325546391] [2023-12-02 19:39:20,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325546391] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:39:20,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499568253] [2023-12-02 19:39:20,441 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 19:39:20,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:39:20,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:39:20,442 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:39:20,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 19:39:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:39:20,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 271 conjunts are in the unsatisfiable core [2023-12-02 19:39:20,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:39:20,710 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-12-02 19:39:20,716 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-12-02 19:39:24,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 144 proven. 270 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2023-12-02 19:39:24,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:39:26,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499568253] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:39:26,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1616372215] [2023-12-02 19:39:26,866 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 19:39:26,866 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:39:26,867 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-12-02 19:39:26,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:39:26,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2023-12-02 19:39:26,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312677394] [2023-12-02 19:39:26,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:39:26,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-02 19:39:26,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:39:26,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-02 19:39:26,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=890, Unknown=3, NotChecked=0, Total=992 [2023-12-02 19:39:26,870 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 31 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 30 states have internal predecessors, (47), 12 states have call successors, (15), 2 states have call predecessors, (15), 16 states have return successors, (22), 16 states have call predecessors, (22), 12 states have call successors, (22) [2023-12-02 19:39:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:39:27,964 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2023-12-02 19:39:27,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 19:39:27,965 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 30 states have internal predecessors, (47), 12 states have call successors, (15), 2 states have call predecessors, (15), 16 states have return successors, (22), 16 states have call predecessors, (22), 12 states have call successors, (22) Word has length 178 [2023-12-02 19:39:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:39:27,966 INFO L225 Difference]: With dead ends: 81 [2023-12-02 19:39:27,966 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 19:39:27,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 180 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=252, Invalid=1723, Unknown=5, NotChecked=0, Total=1980 [2023-12-02 19:39:27,969 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:39:27,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 74 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 348 Invalid, 1 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 19:39:27,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 19:39:27,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 19:39:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:39:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 19:39:27,970 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2023-12-02 19:39:27,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:39:27,970 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 19:39:27,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 30 states have internal predecessors, (47), 12 states have call successors, (15), 2 states have call predecessors, (15), 16 states have return successors, (22), 16 states have call predecessors, (22), 12 states have call successors, (22) [2023-12-02 19:39:27,971 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 19:39:27,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 19:39:27,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 19:39:27,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 19:39:28,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:39:28,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 19:39:28,358 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (= func_to_recursive_line_20_to_21_0_~a.base |func_to_recursive_line_20_to_21_0_#in~a.base|) (= |func_to_recursive_line_20_to_21_0_#in~a.offset| func_to_recursive_line_20_to_21_0_~a.offset) (= |func_to_recursive_line_20_to_21_0_#in~b.offset| func_to_recursive_line_20_to_21_0_~b.offset) (= |#memory_int| (store |old(#memory_int)| func_to_recursive_line_20_to_21_0_~b.base (store (select |old(#memory_int)| func_to_recursive_line_20_to_21_0_~b.base) func_to_recursive_line_20_to_21_0_~b.offset 0))) (<= (select (select |old(#memory_int)| func_to_recursive_line_20_to_21_0_~a.base) func_to_recursive_line_20_to_21_0_~a.offset) 5) (= func_to_recursive_line_20_to_21_0_~b.base |func_to_recursive_line_20_to_21_0_#in~b.base|)) [2023-12-02 19:39:28,358 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2023-12-02 19:39:28,358 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 39 57) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2023-12-02 19:39:28,358 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 56) no Hoare annotation was computed. [2023-12-02 19:39:28,358 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 39 57) no Hoare annotation was computed. [2023-12-02 19:39:28,359 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (= |#memory_int| (let ((.cse0 (store |old(#memory_int)| |func_to_recursive_line_20_to_21_0_#in~b.base| (store (select |old(#memory_int)| |func_to_recursive_line_20_to_21_0_#in~b.base|) |func_to_recursive_line_20_to_21_0_#in~b.offset| 6)))) (store .cse0 func_to_recursive_line_20_to_21_0_~a.base (let ((.cse1 (select .cse0 func_to_recursive_line_20_to_21_0_~a.base))) (store .cse1 func_to_recursive_line_20_to_21_0_~a.offset (+ (select .cse1 func_to_recursive_line_20_to_21_0_~a.offset) 1)))))) (= func_to_recursive_line_20_to_21_0_~a.base |func_to_recursive_line_20_to_21_0_#in~a.base|) (= |func_to_recursive_line_20_to_21_0_#in~a.offset| func_to_recursive_line_20_to_21_0_~a.offset) (= |func_to_recursive_line_20_to_21_0_#in~b.offset| func_to_recursive_line_20_to_21_0_~b.offset) (<= (select (select |old(#memory_int)| func_to_recursive_line_20_to_21_0_~a.base) func_to_recursive_line_20_to_21_0_~a.offset) 5) (= func_to_recursive_line_20_to_21_0_~b.base |func_to_recursive_line_20_to_21_0_#in~b.base|)) [2023-12-02 19:39:28,359 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_20_to_21_0EXIT(lines 39 57) no Hoare annotation was computed. [2023-12-02 19:39:28,359 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (and (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#a~0#1.offset| 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) [2023-12-02 19:39:28,359 INFO L899 garLoopResultBuilder]: For program point L67-2(lines 67 73) no Hoare annotation was computed. [2023-12-02 19:39:28,359 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 19:39:28,359 INFO L899 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2023-12-02 19:39:28,359 INFO L899 garLoopResultBuilder]: For program point L67-4(lines 67 73) no Hoare annotation was computed. [2023-12-02 19:39:28,359 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 69) no Hoare annotation was computed. [2023-12-02 19:39:28,359 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 19:39:28,359 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-12-02 19:39:28,360 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| func_to_recursive_line_21_to_21_0_~b.base))) (let ((.cse1 (select .cse0 func_to_recursive_line_21_to_21_0_~b.offset))) (and (= |#memory_int| (store |old(#memory_int)| func_to_recursive_line_21_to_21_0_~b.base (store .cse0 func_to_recursive_line_21_to_21_0_~b.offset (+ .cse1 1)))) (= |func_to_recursive_line_21_to_21_0_#in~b.offset| func_to_recursive_line_21_to_21_0_~b.offset) (= func_to_recursive_line_21_to_21_0_~b.base |func_to_recursive_line_21_to_21_0_#in~b.base|) (<= .cse1 5)))) [2023-12-02 19:39:28,360 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_21_to_21_0EXIT(lines 23 37) no Hoare annotation was computed. [2023-12-02 19:39:28,360 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 23 37) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2023-12-02 19:39:28,360 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 36) no Hoare annotation was computed. [2023-12-02 19:39:28,360 INFO L899 garLoopResultBuilder]: For program point L25-1(lines 23 37) no Hoare annotation was computed. [2023-12-02 19:39:28,362 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2023-12-02 19:39:28,364 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 19:39:28,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:39:28 BoogieIcfgContainer [2023-12-02 19:39:28,367 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 19:39:28,368 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 19:39:28,368 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 19:39:28,368 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 19:39:28,368 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:38:15" (3/4) ... [2023-12-02 19:39:28,370 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 19:39:28,372 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_21_0 [2023-12-02 19:39:28,373 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_21_to_21_0 [2023-12-02 19:39:28,377 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2023-12-02 19:39:28,377 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-12-02 19:39:28,377 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-12-02 19:39:28,377 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 19:39:28,454 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 19:39:28,455 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 19:39:28,455 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 19:39:28,455 INFO L158 Benchmark]: Toolchain (without parser) took 73327.68ms. Allocated memory was 169.9MB in the beginning and 796.9MB in the end (delta: 627.0MB). Free memory was 130.8MB in the beginning and 439.9MB in the end (delta: -309.1MB). Peak memory consumption was 320.4MB. Max. memory is 16.1GB. [2023-12-02 19:39:28,456 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 117.4MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:39:28,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.41ms. Allocated memory is still 169.9MB. Free memory was 130.8MB in the beginning and 120.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-02 19:39:28,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.67ms. Allocated memory is still 169.9MB. Free memory was 120.3MB in the beginning and 119.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 19:39:28,456 INFO L158 Benchmark]: Boogie Preprocessor took 22.46ms. Allocated memory is still 169.9MB. Free memory was 119.1MB in the beginning and 118.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:39:28,457 INFO L158 Benchmark]: RCFGBuilder took 325.12ms. Allocated memory is still 169.9MB. Free memory was 117.6MB in the beginning and 105.1MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 19:39:28,457 INFO L158 Benchmark]: TraceAbstraction took 72659.20ms. Allocated memory was 169.9MB in the beginning and 796.9MB in the end (delta: 627.0MB). Free memory was 104.5MB in the beginning and 445.2MB in the end (delta: -340.7MB). Peak memory consumption was 286.9MB. Max. memory is 16.1GB. [2023-12-02 19:39:28,457 INFO L158 Benchmark]: Witness Printer took 86.78ms. Allocated memory is still 796.9MB. Free memory was 444.1MB in the beginning and 439.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 19:39:28,459 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 117.4MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.41ms. Allocated memory is still 169.9MB. Free memory was 130.8MB in the beginning and 120.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.67ms. Allocated memory is still 169.9MB. Free memory was 120.3MB in the beginning and 119.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.46ms. Allocated memory is still 169.9MB. Free memory was 119.1MB in the beginning and 118.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 325.12ms. Allocated memory is still 169.9MB. Free memory was 117.6MB in the beginning and 105.1MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 72659.20ms. Allocated memory was 169.9MB in the beginning and 796.9MB in the end (delta: 627.0MB). Free memory was 104.5MB in the beginning and 445.2MB in the end (delta: -340.7MB). Peak memory consumption was 286.9MB. Max. memory is 16.1GB. * Witness Printer took 86.78ms. Allocated memory is still 796.9MB. Free memory was 444.1MB in the beginning and 439.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 69]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.6s, OverallIterations: 9, TraceHistogramMax: 29, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 206 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 202 mSDsluCounter, 1249 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 43 IncrementalHoareTripleChecker+Unchecked, 1127 mSDsCounter, 217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2650 IncrementalHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 217 mSolverCounterUnsat, 122 mSDtfsCounter, 2650 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1059 GetRequests, 715 SyntacticMatches, 15 SemanticMatches, 329 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5270 ImplicationChecksByTransitivity, 16.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=8, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 51 PreInvPairs, 53 NumberOfFragments, 147 HoareAnnotationTreeSize, 51 FomulaSimplifications, 153 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 313 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 63.4s InterpolantComputationTime, 1141 NumberOfCodeBlocks, 1134 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1227 ConstructedInterpolants, 21 QuantifiedInterpolants, 13198 SizeOfPredicates, 178 NumberOfNonLiveVariables, 2371 ConjunctsInSsa, 923 ConjunctsInUnsatCore, 19 InterpolantComputations, 2 PerfectInterpolantSequences, 6235/7455 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-02 19:39:28,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3abb2ad3-47c2-410a-8b57-0b8655fc2d58/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE