./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire --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 c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 20:35:17,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 20:35:17,220 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-23 20:35:17,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 20:35:17,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 20:35:17,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 20:35:17,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 20:35:17,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 20:35:17,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 20:35:17,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 20:35:17,260 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 20:35:17,260 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 20:35:17,261 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 20:35:17,261 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 20:35:17,262 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 20:35:17,263 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 20:35:17,263 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 20:35:17,264 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 20:35:17,264 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 20:35:17,265 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 20:35:17,266 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 20:35:17,266 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 20:35:17,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 20:35:17,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 20:35:17,268 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 20:35:17,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 20:35:17,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 20:35:17,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 20:35:17,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 20:35:17,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 20:35:17,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 20:35:17,272 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 20:35:17,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 20:35:17,273 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 20:35:17,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 20:35:17,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 20:35:17,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 20:35:17,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:35:17,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 20:35:17,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 20:35:17,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 20:35:17,277 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 20:35:17,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 20:35:17,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 20:35:17,278 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 20:35:17,279 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 20:35:17,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 20:35:17,279 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_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/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_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire 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 -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2023-11-23 20:35:17,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 20:35:17,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 20:35:17,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 20:35:17,598 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 20:35:17,598 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 20:35:17,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2023-11-23 20:35:20,785 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 20:35:21,079 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 20:35:21,080 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2023-11-23 20:35:21,089 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/data/ca2882521/d863032c3ff84056a30e73aef6ed4a38/FLAGaef519369 [2023-11-23 20:35:21,106 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/data/ca2882521/d863032c3ff84056a30e73aef6ed4a38 [2023-11-23 20:35:21,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 20:35:21,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 20:35:21,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 20:35:21,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 20:35:21,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 20:35:21,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:35:21" (1/1) ... [2023-11-23 20:35:21,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31bf7739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:21, skipping insertion in model container [2023-11-23 20:35:21,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:35:21" (1/1) ... [2023-11-23 20:35:21,146 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 20:35:21,309 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_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c[2721,2734] [2023-11-23 20:35:21,314 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:35:21,325 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 20:35:21,349 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_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c[2721,2734] [2023-11-23 20:35:21,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:35:21,365 INFO L206 MainTranslator]: Completed translation [2023-11-23 20:35:21,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:21 WrapperNode [2023-11-23 20:35:21,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 20:35:21,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 20:35:21,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 20:35:21,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 20:35:21,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:21" (1/1) ... [2023-11-23 20:35:21,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:21" (1/1) ... [2023-11-23 20:35:21,408 INFO L138 Inliner]: procedures = 16, calls = 62, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2023-11-23 20:35:21,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 20:35:21,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 20:35:21,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 20:35:21,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 20:35:21,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:21" (1/1) ... [2023-11-23 20:35:21,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:21" (1/1) ... [2023-11-23 20:35:21,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:21" (1/1) ... [2023-11-23 20:35:21,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:21" (1/1) ... [2023-11-23 20:35:21,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:21" (1/1) ... [2023-11-23 20:35:21,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:21" (1/1) ... [2023-11-23 20:35:21,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:21" (1/1) ... [2023-11-23 20:35:21,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:21" (1/1) ... [2023-11-23 20:35:21,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 20:35:21,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 20:35:21,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 20:35:21,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 20:35:21,445 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:21" (1/1) ... [2023-11-23 20:35:21,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:35:21,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:35:21,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 20:35:21,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 20:35:21,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 20:35:21,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 20:35:21,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 20:35:21,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 20:35:21,532 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2023-11-23 20:35:21,533 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2023-11-23 20:35:21,533 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2023-11-23 20:35:21,534 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2023-11-23 20:35:21,534 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2023-11-23 20:35:21,534 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2023-11-23 20:35:21,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 20:35:21,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 20:35:21,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 20:35:21,535 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2023-11-23 20:35:21,535 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2023-11-23 20:35:21,536 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2023-11-23 20:35:21,536 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2023-11-23 20:35:21,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 20:35:21,633 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 20:35:21,635 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 20:35:21,946 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 20:35:22,038 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 20:35:22,038 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 20:35:22,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:35:22 BoogieIcfgContainer [2023-11-23 20:35:22,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 20:35:22,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 20:35:22,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 20:35:22,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 20:35:22,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:35:21" (1/3) ... [2023-11-23 20:35:22,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86852a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:35:22, skipping insertion in model container [2023-11-23 20:35:22,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:21" (2/3) ... [2023-11-23 20:35:22,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86852a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:35:22, skipping insertion in model container [2023-11-23 20:35:22,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:35:22" (3/3) ... [2023-11-23 20:35:22,052 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_5.c [2023-11-23 20:35:22,071 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 20:35:22,071 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 20:35:22,124 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 20:35:22,132 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;@2958ee1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 20:35:22,132 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 20:35:22,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 30 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-23 20:35:22,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 20:35:22,147 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:22,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:22,148 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 20:35:22,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash -295619350, now seen corresponding path program 1 times [2023-11-23 20:35:22,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:22,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443564132] [2023-11-23 20:35:22,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:22,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:22,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:22,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443564132] [2023-11-23 20:35:22,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443564132] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:22,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:22,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 20:35:22,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75018368] [2023-11-23 20:35:22,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:22,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:35:22,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:23,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:35:23,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:35:23,023 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 30 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 20:35:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:23,319 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2023-11-23 20:35:23,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:35:23,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2023-11-23 20:35:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:23,332 INFO L225 Difference]: With dead ends: 57 [2023-11-23 20:35:23,332 INFO L226 Difference]: Without dead ends: 49 [2023-11-23 20:35:23,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 20:35:23,340 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:23,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 91 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:35:23,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-23 20:35:23,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2023-11-23 20:35:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 29 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-11-23 20:35:23,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2023-11-23 20:35:23,407 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 9 [2023-11-23 20:35:23,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:23,408 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2023-11-23 20:35:23,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-23 20:35:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2023-11-23 20:35:23,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 20:35:23,414 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:23,414 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:23,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 20:35:23,416 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 20:35:23,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:23,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1675804554, now seen corresponding path program 1 times [2023-11-23 20:35:23,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:23,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347614196] [2023-11-23 20:35:23,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:23,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:23,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 20:35:23,732 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:23,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347614196] [2023-11-23 20:35:23,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347614196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:23,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:23,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 20:35:23,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504690816] [2023-11-23 20:35:23,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:23,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:35:23,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:23,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:35:23,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:35:23,736 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 20:35:23,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:23,892 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2023-11-23 20:35:23,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:35:23,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2023-11-23 20:35:23,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:23,895 INFO L225 Difference]: With dead ends: 88 [2023-11-23 20:35:23,895 INFO L226 Difference]: Without dead ends: 49 [2023-11-23 20:35:23,896 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-11-23 20:35:23,898 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:23,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 85 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:23,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-23 20:35:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2023-11-23 20:35:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.2) internal successors, (30), 30 states have internal predecessors, (30), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-11-23 20:35:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2023-11-23 20:35:23,909 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 20 [2023-11-23 20:35:23,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:23,910 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2023-11-23 20:35:23,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 20:35:23,910 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2023-11-23 20:35:23,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-23 20:35:23,912 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:23,912 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, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:23,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 20:35:23,913 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 20:35:23,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:23,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1520575934, now seen corresponding path program 1 times [2023-11-23 20:35:23,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:23,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450336410] [2023-11-23 20:35:23,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:23,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 20:35:24,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:24,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450336410] [2023-11-23 20:35:24,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450336410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:24,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:24,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 20:35:24,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408186222] [2023-11-23 20:35:24,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:24,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:35:24,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:24,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:35:24,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:35:24,262 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-23 20:35:24,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:24,420 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2023-11-23 20:35:24,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:35:24,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2023-11-23 20:35:24,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:24,422 INFO L225 Difference]: With dead ends: 90 [2023-11-23 20:35:24,422 INFO L226 Difference]: Without dead ends: 49 [2023-11-23 20:35:24,423 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-11-23 20:35:24,425 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:24,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 94 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:24,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-23 20:35:24,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2023-11-23 20:35:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 31 states have internal predecessors, (31), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2023-11-23 20:35:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2023-11-23 20:35:24,436 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 31 [2023-11-23 20:35:24,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:24,436 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-11-23 20:35:24,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-23 20:35:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2023-11-23 20:35:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-23 20:35:24,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:24,439 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:24,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 20:35:24,439 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 20:35:24,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1805714706, now seen corresponding path program 1 times [2023-11-23 20:35:24,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:24,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56454791] [2023-11-23 20:35:24,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:24,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:24,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 20:35:24,759 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:24,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56454791] [2023-11-23 20:35:24,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56454791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:24,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:24,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 20:35:24,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621215624] [2023-11-23 20:35:24,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:24,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:35:24,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:24,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:35:24,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:35:24,763 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 20:35:24,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:24,898 INFO L93 Difference]: Finished difference Result 92 states and 117 transitions. [2023-11-23 20:35:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:35:24,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) Word has length 42 [2023-11-23 20:35:24,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:24,901 INFO L225 Difference]: With dead ends: 92 [2023-11-23 20:35:24,901 INFO L226 Difference]: Without dead ends: 49 [2023-11-23 20:35:24,902 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-11-23 20:35:24,903 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:24,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 91 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:24,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-23 20:35:24,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2023-11-23 20:35:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 32 states have internal predecessors, (32), 10 states have call successors, (10), 5 states have call predecessors, (10), 9 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2023-11-23 20:35:24,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2023-11-23 20:35:24,913 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 42 [2023-11-23 20:35:24,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:24,913 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2023-11-23 20:35:24,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 20:35:24,913 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2023-11-23 20:35:24,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-23 20:35:24,915 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:24,916 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:24,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 20:35:24,916 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 20:35:24,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:24,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1473520921, now seen corresponding path program 1 times [2023-11-23 20:35:24,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:24,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931730167] [2023-11-23 20:35:24,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:24,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 20:35:25,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:25,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931730167] [2023-11-23 20:35:25,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931730167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:25,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:25,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 20:35:25,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84916827] [2023-11-23 20:35:25,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:25,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:35:25,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:25,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:35:25,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:35:25,271 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 1 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 20:35:25,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:25,393 INFO L93 Difference]: Finished difference Result 94 states and 120 transitions. [2023-11-23 20:35:25,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:35:25,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 1 states have call predecessors, (9), 3 states have call successors, (9) Word has length 53 [2023-11-23 20:35:25,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:25,397 INFO L225 Difference]: With dead ends: 94 [2023-11-23 20:35:25,397 INFO L226 Difference]: Without dead ends: 49 [2023-11-23 20:35:25,401 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-11-23 20:35:25,405 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:25,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 94 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:25,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-23 20:35:25,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-23 20:35:25,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 33 states have internal predecessors, (33), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2023-11-23 20:35:25,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-11-23 20:35:25,426 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 53 [2023-11-23 20:35:25,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:25,427 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-11-23 20:35:25,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 1 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 20:35:25,427 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-11-23 20:35:25,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-23 20:35:25,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:25,436 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:25,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 20:35:25,438 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 20:35:25,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:25,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1845601206, now seen corresponding path program 1 times [2023-11-23 20:35:25,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:25,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829695834] [2023-11-23 20:35:25,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:25,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 20:35:26,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:26,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829695834] [2023-11-23 20:35:26,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829695834] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:35:26,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632286231] [2023-11-23 20:35:26,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:26,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:35:26,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:35:26,088 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:35:26,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 20:35:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:26,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-23 20:35:26,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:35:26,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 20:35:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-23 20:35:26,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:35:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 20:35:27,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632286231] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:35:27,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [621669231] [2023-11-23 20:35:27,848 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2023-11-23 20:35:27,849 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:35:27,855 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-23 20:35:27,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 20:35:27,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2023-11-23 20:35:27,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891349696] [2023-11-23 20:35:27,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 20:35:27,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-23 20:35:27,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:27,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-23 20:35:27,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-11-23 20:35:27,862 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 22 states, 16 states have (on average 3.4375) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (18), 4 states have call predecessors, (18), 8 states have call successors, (18) [2023-11-23 20:35:28,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:28,381 INFO L93 Difference]: Finished difference Result 100 states and 127 transitions. [2023-11-23 20:35:28,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 20:35:28,382 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 16 states have (on average 3.4375) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (18), 4 states have call predecessors, (18), 8 states have call successors, (18) Word has length 58 [2023-11-23 20:35:28,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:28,383 INFO L225 Difference]: With dead ends: 100 [2023-11-23 20:35:28,383 INFO L226 Difference]: Without dead ends: 53 [2023-11-23 20:35:28,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2023-11-23 20:35:28,386 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:28,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 181 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 20:35:28,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-23 20:35:28,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-23 20:35:28,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 35 states have internal predecessors, (35), 10 states have call successors, (10), 5 states have call predecessors, (10), 12 states have return successors, (17), 12 states have call predecessors, (17), 10 states have call successors, (17) [2023-11-23 20:35:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2023-11-23 20:35:28,396 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 58 [2023-11-23 20:35:28,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:28,397 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2023-11-23 20:35:28,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 16 states have (on average 3.4375) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (18), 4 states have call predecessors, (18), 8 states have call successors, (18) [2023-11-23 20:35:28,398 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2023-11-23 20:35:28,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-23 20:35:28,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:28,400 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:28,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 20:35:28,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-23 20:35:28,621 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 20:35:28,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:28,621 INFO L85 PathProgramCache]: Analyzing trace with hash -186818732, now seen corresponding path program 2 times [2023-11-23 20:35:28,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:28,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653419463] [2023-11-23 20:35:28,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:28,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:29,901 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 20:35:29,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:29,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653419463] [2023-11-23 20:35:29,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653419463] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:35:29,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554043145] [2023-11-23 20:35:29,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 20:35:29,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:35:29,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:35:29,903 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:35:29,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 20:35:30,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-23 20:35:30,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 20:35:30,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-23 20:35:30,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:35:30,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 20:35:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 20:35:30,513 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:35:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 20:35:33,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554043145] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:35:33,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2002429737] [2023-11-23 20:35:33,581 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2023-11-23 20:35:33,581 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:35:33,582 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-23 20:35:33,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 20:35:33,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 18] total 33 [2023-11-23 20:35:33,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515873233] [2023-11-23 20:35:33,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 20:35:33,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-23 20:35:33,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:33,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-23 20:35:33,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2023-11-23 20:35:33,587 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 33 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 28 states have internal predecessors, (64), 11 states have call successors, (21), 7 states have call predecessors, (21), 11 states have return successors, (24), 8 states have call predecessors, (24), 11 states have call successors, (24) [2023-11-23 20:35:34,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:34,279 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2023-11-23 20:35:34,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 20:35:34,281 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 28 states have internal predecessors, (64), 11 states have call successors, (21), 7 states have call predecessors, (21), 11 states have return successors, (24), 8 states have call predecessors, (24), 11 states have call successors, (24) Word has length 68 [2023-11-23 20:35:34,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:34,282 INFO L225 Difference]: With dead ends: 108 [2023-11-23 20:35:34,282 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 20:35:34,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=318, Invalid=1322, Unknown=0, NotChecked=0, Total=1640 [2023-11-23 20:35:34,285 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:34,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 234 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 20:35:34,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 20:35:34,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-23 20:35:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.15625) internal successors, (37), 37 states have internal predecessors, (37), 10 states have call successors, (10), 5 states have call predecessors, (10), 14 states have return successors, (19), 14 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-23 20:35:34,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2023-11-23 20:35:34,305 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 68 [2023-11-23 20:35:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:34,308 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2023-11-23 20:35:34,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 28 states have internal predecessors, (64), 11 states have call successors, (21), 7 states have call predecessors, (21), 11 states have return successors, (24), 8 states have call predecessors, (24), 11 states have call successors, (24) [2023-11-23 20:35:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2023-11-23 20:35:34,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-23 20:35:34,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:34,310 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:34,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 20:35:34,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:35:34,536 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 20:35:34,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:34,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1144558242, now seen corresponding path program 3 times [2023-11-23 20:35:34,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:34,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295695783] [2023-11-23 20:35:34,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:34,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 20:35:36,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:36,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295695783] [2023-11-23 20:35:36,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295695783] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:35:36,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104620973] [2023-11-23 20:35:36,155 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-23 20:35:36,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:35:36,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:35:36,160 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:35:36,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 20:35:36,367 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-23 20:35:36,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 20:35:36,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 75 conjunts are in the unsatisfiable core [2023-11-23 20:35:36,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:35:36,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 20:35:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 20:35:36,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:35:41,424 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 8 proven. 70 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 20:35:41,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104620973] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:35:41,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1544965395] [2023-11-23 20:35:41,428 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2023-11-23 20:35:41,428 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:35:41,429 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-23 20:35:41,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 20:35:41,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 26] total 42 [2023-11-23 20:35:41,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420495752] [2023-11-23 20:35:41,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 20:35:41,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-23 20:35:41,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:41,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-23 20:35:41,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1391, Unknown=0, NotChecked=0, Total=1722 [2023-11-23 20:35:41,433 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 42 states, 32 states have (on average 2.21875) internal successors, (71), 35 states have internal predecessors, (71), 12 states have call successors, (23), 9 states have call predecessors, (23), 15 states have return successors, (30), 12 states have call predecessors, (30), 12 states have call successors, (30) [2023-11-23 20:35:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:42,378 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2023-11-23 20:35:42,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 20:35:42,379 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 32 states have (on average 2.21875) internal successors, (71), 35 states have internal predecessors, (71), 12 states have call successors, (23), 9 states have call predecessors, (23), 15 states have return successors, (30), 12 states have call predecessors, (30), 12 states have call successors, (30) Word has length 78 [2023-11-23 20:35:42,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:42,381 INFO L225 Difference]: With dead ends: 114 [2023-11-23 20:35:42,381 INFO L226 Difference]: Without dead ends: 59 [2023-11-23 20:35:42,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 135 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=503, Invalid=2047, Unknown=0, NotChecked=0, Total=2550 [2023-11-23 20:35:42,384 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 55 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:42,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 362 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 20:35:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-23 20:35:42,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-23 20:35:42,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 38 states have internal predecessors, (38), 10 states have call successors, (10), 5 states have call predecessors, (10), 15 states have return successors, (20), 15 states have call predecessors, (20), 10 states have call successors, (20) [2023-11-23 20:35:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2023-11-23 20:35:42,405 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 78 [2023-11-23 20:35:42,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:42,406 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2023-11-23 20:35:42,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 32 states have (on average 2.21875) internal successors, (71), 35 states have internal predecessors, (71), 12 states have call successors, (23), 9 states have call predecessors, (23), 15 states have return successors, (30), 12 states have call predecessors, (30), 12 states have call successors, (30) [2023-11-23 20:35:42,407 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2023-11-23 20:35:42,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-23 20:35:42,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:42,408 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:42,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 20:35:42,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:35:42,609 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 20:35:42,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:42,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1053195191, now seen corresponding path program 4 times [2023-11-23 20:35:42,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:42,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491568542] [2023-11-23 20:35:42,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:42,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:47,904 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-11-23 20:35:47,904 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:47,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491568542] [2023-11-23 20:35:47,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491568542] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:35:47,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720071650] [2023-11-23 20:35:47,904 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-23 20:35:47,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:35:47,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:35:47,906 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:35:47,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e2d19e8-671a-4e8b-9587-56c157c3a9a2/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 20:35:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:48,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 102 conjunts are in the unsatisfiable core [2023-11-23 20:35:48,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:35:48,188 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 6710 treesize of output 6646 [2023-11-23 20:35:48,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 20:35:50,532 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2023-11-23 20:35:52,534 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2023-11-23 20:35:54,570 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_40| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_40| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_40| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_40| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= (store |v_old(#memory_int)_AFTER_CALL_40| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2023-11-23 20:35:56,574 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_40| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_40| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_40| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_40| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= (store |v_old(#memory_int)_AFTER_CALL_40| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2023-11-23 20:35:58,614 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_49| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_49| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_49|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_49| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2023-11-23 20:36:00,616 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_49| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_49| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_49|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_49| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2023-11-23 20:36:00,941 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2023-11-23 20:36:00,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 91 [2023-11-23 20:36:00,949 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 56 treesize of output 33 [2023-11-23 20:36:00,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 treesize of output 23 [2023-11-23 20:36:00,981 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 68 trivial. 15 not checked. [2023-11-23 20:36:00,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:36:01,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:01,651 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 20:36:01,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 22 [2023-11-23 20:36:02,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:02,251 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 20:36:02,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 22 [2023-11-23 20:36:02,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:36:02,796 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 20:36:02,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 22 [2023-11-23 20:36:03,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720071650] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:36:03,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2122794703] [2023-11-23 20:36:03,258 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2023-11-23 20:36:03,258 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:36:03,259 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-23 20:36:03,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 20:36:03,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 29 [2023-11-23 20:36:03,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424947004] [2023-11-23 20:36:03,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 20:36:03,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-23 20:36:03,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:36:03,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-23 20:36:03,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=712, Unknown=10, NotChecked=168, Total=992 [2023-11-23 20:36:03,263 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 29 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 13 states have call successors, (13), 2 states have call predecessors, (13), 9 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) [2023-11-23 20:36:05,573 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_27_to_27_0_~e.base)) |c_#memory_int|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| c_func_to_recursive_line_27_to_27_0_~e.base) (or (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_40| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_40| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_40| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_40| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= (store |v_old(#memory_int)_AFTER_CALL_40| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_49| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_49| |c_#memory_int|))) (and (= .cse3 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_49|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_49| .cse3 (select |c_#memory_int| .cse3)))))) .cse1))) is different from false [2023-11-23 20:36:07,576 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_27_to_27_0_~e.base)) |c_#memory_int|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| c_func_to_recursive_line_27_to_27_0_~e.base) (or (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_40| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_40| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_40| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_40| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= (store |v_old(#memory_int)_AFTER_CALL_40| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_49| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_49| |c_#memory_int|))) (and (= .cse3 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_49|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_49| .cse3 (select |c_#memory_int| .cse3)))))) .cse1))) is different from true