./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci01-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci01-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91 --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 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:08:41,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:08:41,140 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-25 00:08:41,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:08:41,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:08:41,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:08:41,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:08:41,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:08:41,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:08:41,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:08:41,219 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:08:41,220 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:08:41,221 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:08:41,223 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:08:41,223 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:08:41,224 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:08:41,224 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:08:41,225 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:08:41,225 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:08:41,226 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:08:41,226 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:08:41,227 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:08:41,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:08:41,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-25 00:08:41,229 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:08:41,230 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:08:41,230 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:08:41,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:08:41,231 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-25 00:08:41,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:08:41,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-25 00:08:41,233 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:08:41,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-25 00:08:41,234 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:08:41,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:08:41,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:08:41,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:08:41,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:08:41,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:08:41,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:08:41,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-25 00:08:41,237 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:08:41,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:08:41,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:08:41,238 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-25 00:08:41,238 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:08:41,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:08:41,239 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_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/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_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91 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 -> 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 [2023-11-25 00:08:41,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:08:41,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:08:41,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:08:41,574 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:08:41,574 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:08:41,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/recursive/Fibonacci01-1.c [2023-11-25 00:08:44,708 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:08:45,003 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:08:45,006 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/sv-benchmarks/c/recursive/Fibonacci01-1.c [2023-11-25 00:08:45,014 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/data/8bfb653f3/a2d6005898eb4eff8244d64638408cb5/FLAG6f0e4186b [2023-11-25 00:08:45,027 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/data/8bfb653f3/a2d6005898eb4eff8244d64638408cb5 [2023-11-25 00:08:45,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:08:45,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:08:45,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:08:45,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:08:45,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:08:45,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:08:45" (1/1) ... [2023-11-25 00:08:45,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@587ebf4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:45, skipping insertion in model container [2023-11-25 00:08:45,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:08:45" (1/1) ... [2023-11-25 00:08:45,061 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:08:45,259 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_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/sv-benchmarks/c/recursive/Fibonacci01-1.c[804,817] [2023-11-25 00:08:45,265 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:08:45,280 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:08:45,295 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_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/sv-benchmarks/c/recursive/Fibonacci01-1.c[804,817] [2023-11-25 00:08:45,296 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:08:45,312 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:08:45,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:45 WrapperNode [2023-11-25 00:08:45,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:08:45,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:08:45,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:08:45,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:08:45,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:45" (1/1) ... [2023-11-25 00:08:45,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:45" (1/1) ... [2023-11-25 00:08:45,344 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2023-11-25 00:08:45,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:08:45,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:08:45,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:08:45,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:08:45,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:45" (1/1) ... [2023-11-25 00:08:45,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:45" (1/1) ... [2023-11-25 00:08:45,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:45" (1/1) ... [2023-11-25 00:08:45,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:45" (1/1) ... [2023-11-25 00:08:45,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:45" (1/1) ... [2023-11-25 00:08:45,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:45" (1/1) ... [2023-11-25 00:08:45,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:45" (1/1) ... [2023-11-25 00:08:45,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:45" (1/1) ... [2023-11-25 00:08:45,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:08:45,364 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:08:45,364 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:08:45,365 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:08:45,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:45" (1/1) ... [2023-11-25 00:08:45,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:08:45,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:08:45,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-25 00:08:45,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-25 00:08:45,484 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-11-25 00:08:45,485 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-11-25 00:08:45,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:08:45,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:08:45,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:08:45,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-25 00:08:45,576 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:08:45,579 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:08:45,714 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:08:45,733 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:08:45,734 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-25 00:08:45,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:08:45 BoogieIcfgContainer [2023-11-25 00:08:45,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:08:45,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:08:45,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:08:45,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:08:45,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:08:45" (1/3) ... [2023-11-25 00:08:45,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4894ab39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:08:45, skipping insertion in model container [2023-11-25 00:08:45,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:08:45" (2/3) ... [2023-11-25 00:08:45,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4894ab39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:08:45, skipping insertion in model container [2023-11-25 00:08:45,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:08:45" (3/3) ... [2023-11-25 00:08:45,745 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2023-11-25 00:08:45,765 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:08:45,765 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-25 00:08:45,823 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:08:45,834 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;@64b009ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:08:45,834 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-25 00:08:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:08:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-25 00:08:45,847 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:45,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:45,849 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:08:45,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:45,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1216674335, now seen corresponding path program 1 times [2023-11-25 00:08:45,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:45,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833638681] [2023-11-25 00:08:45,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:46,224 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-25 00:08:46,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:46,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833638681] [2023-11-25 00:08:46,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833638681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:08:46,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:08:46,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-25 00:08:46,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532652109] [2023-11-25 00:08:46,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:08:46,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:08:46,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:46,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:08:46,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:08:46,294 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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-25 00:08:46,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:46,495 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2023-11-25 00:08:46,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:08:46,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2023-11-25 00:08:46,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:46,509 INFO L225 Difference]: With dead ends: 27 [2023-11-25 00:08:46,510 INFO L226 Difference]: Without dead ends: 18 [2023-11-25 00:08:46,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:08:46,523 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:46,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 33 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:08:46,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-25 00:08:46,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-25 00:08:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-25 00:08:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-11-25 00:08:46,602 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-11-25 00:08:46,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:46,604 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-25 00:08:46,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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-25 00:08:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-11-25 00:08:46,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-25 00:08:46,607 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:46,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:46,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-25 00:08:46,608 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:08:46,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1629096597, now seen corresponding path program 1 times [2023-11-25 00:08:46,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:46,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123163151] [2023-11-25 00:08:46,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:46,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:46,885 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-25 00:08:46,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:46,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123163151] [2023-11-25 00:08:46,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123163151] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:08:46,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:08:46,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-25 00:08:46,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065591] [2023-11-25 00:08:46,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:08:46,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:08:46,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:46,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:08:46,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:08:46,894 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-25 00:08:46,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:46,990 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2023-11-25 00:08:46,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:08:46,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2023-11-25 00:08:46,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:46,992 INFO L225 Difference]: With dead ends: 24 [2023-11-25 00:08:46,993 INFO L226 Difference]: Without dead ends: 20 [2023-11-25 00:08:46,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:08:46,995 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:46,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 33 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:08:46,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-25 00:08:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2023-11-25 00:08:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-25 00:08:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-11-25 00:08:47,003 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2023-11-25 00:08:47,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:47,004 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-11-25 00:08:47,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-25 00:08:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-11-25 00:08:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-25 00:08:47,006 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:47,006 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:47,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-25 00:08:47,006 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:08:47,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:47,007 INFO L85 PathProgramCache]: Analyzing trace with hash 161002844, now seen corresponding path program 1 times [2023-11-25 00:08:47,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:47,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885826204] [2023-11-25 00:08:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:47,163 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-25 00:08:47,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:47,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885826204] [2023-11-25 00:08:47,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885826204] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:08:47,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869604227] [2023-11-25 00:08:47,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:47,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:47,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:08:47,172 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:08:47,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-25 00:08:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:47,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-25 00:08:47,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:08:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-25 00:08:47,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:08:48,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:08:48,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869604227] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:08:48,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1439105015] [2023-11-25 00:08:48,090 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-25 00:08:48,091 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:08:48,095 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-25 00:08:48,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:08:48,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 20 [2023-11-25 00:08:48,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666450239] [2023-11-25 00:08:48,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:08:48,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-25 00:08:48,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:48,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-25 00:08:48,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2023-11-25 00:08:48,103 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 16 states have internal predecessors, (37), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-25 00:08:48,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:48,321 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2023-11-25 00:08:48,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-25 00:08:48,322 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 16 states have internal predecessors, (37), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 23 [2023-11-25 00:08:48,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:48,324 INFO L225 Difference]: With dead ends: 35 [2023-11-25 00:08:48,324 INFO L226 Difference]: Without dead ends: 20 [2023-11-25 00:08:48,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2023-11-25 00:08:48,327 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:48,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 84 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:08:48,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-25 00:08:48,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-25 00:08:48,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-25 00:08:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-11-25 00:08:48,335 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2023-11-25 00:08:48,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:48,336 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-25 00:08:48,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 16 states have internal predecessors, (37), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-25 00:08:48,336 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-11-25 00:08:48,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-25 00:08:48,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:48,338 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:48,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-25 00:08:48,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-25 00:08:48,545 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:08:48,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:48,546 INFO L85 PathProgramCache]: Analyzing trace with hash 592483530, now seen corresponding path program 1 times [2023-11-25 00:08:48,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:48,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022855720] [2023-11-25 00:08:48,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:48,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-25 00:08:48,870 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:48,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022855720] [2023-11-25 00:08:48,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022855720] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:08:48,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326857360] [2023-11-25 00:08:48,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:48,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:48,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:08:48,877 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:08:48,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-25 00:08:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:48,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-25 00:08:48,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:08:49,131 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-25 00:08:49,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:08:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:08:49,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326857360] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:08:49,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1938439449] [2023-11-25 00:08:49,581 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-25 00:08:49,581 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:08:49,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-25 00:08:49,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:08:49,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 21 [2023-11-25 00:08:49,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387129244] [2023-11-25 00:08:49,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:08:49,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-25 00:08:49,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:49,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-25 00:08:49,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-11-25 00:08:49,587 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-25 00:08:49,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:49,846 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2023-11-25 00:08:49,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-25 00:08:49,846 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 24 [2023-11-25 00:08:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:49,852 INFO L225 Difference]: With dead ends: 31 [2023-11-25 00:08:49,852 INFO L226 Difference]: Without dead ends: 27 [2023-11-25 00:08:49,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2023-11-25 00:08:49,855 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:49,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 60 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:08:49,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-25 00:08:49,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2023-11-25 00:08:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-25 00:08:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2023-11-25 00:08:49,873 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 24 [2023-11-25 00:08:49,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:49,873 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2023-11-25 00:08:49,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-25 00:08:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2023-11-25 00:08:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-25 00:08:49,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:49,878 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:49,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-25 00:08:50,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:50,084 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:08:50,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:50,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1310194259, now seen corresponding path program 2 times [2023-11-25 00:08:50,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:50,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583610657] [2023-11-25 00:08:50,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-25 00:08:50,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:50,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583610657] [2023-11-25 00:08:50,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583610657] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:08:50,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473093624] [2023-11-25 00:08:50,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-25 00:08:50,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:50,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:08:50,237 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:08:50,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-25 00:08:50,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-25 00:08:50,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:08:50,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-25 00:08:50,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:08:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-25 00:08:50,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:08:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-25 00:08:51,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473093624] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:08:51,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1830410316] [2023-11-25 00:08:51,225 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-25 00:08:51,226 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:08:51,227 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-25 00:08:51,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:08:51,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 14] total 27 [2023-11-25 00:08:51,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357921397] [2023-11-25 00:08:51,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:08:51,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-25 00:08:51,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:51,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-25 00:08:51,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2023-11-25 00:08:51,237 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 21 states have internal predecessors, (49), 8 states have call successors, (10), 1 states have call predecessors, (10), 9 states have return successors, (14), 13 states have call predecessors, (14), 8 states have call successors, (14) [2023-11-25 00:08:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:51,734 INFO L93 Difference]: Finished difference Result 53 states and 78 transitions. [2023-11-25 00:08:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-25 00:08:51,735 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 21 states have internal predecessors, (49), 8 states have call successors, (10), 1 states have call predecessors, (10), 9 states have return successors, (14), 13 states have call predecessors, (14), 8 states have call successors, (14) Word has length 37 [2023-11-25 00:08:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:51,737 INFO L225 Difference]: With dead ends: 53 [2023-11-25 00:08:51,737 INFO L226 Difference]: Without dead ends: 31 [2023-11-25 00:08:51,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=279, Invalid=1281, Unknown=0, NotChecked=0, Total=1560 [2023-11-25 00:08:51,740 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:51,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 141 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:08:51,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-25 00:08:51,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2023-11-25 00:08:51,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-25 00:08:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2023-11-25 00:08:51,749 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 37 [2023-11-25 00:08:51,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:51,749 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2023-11-25 00:08:51,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 21 states have internal predecessors, (49), 8 states have call successors, (10), 1 states have call predecessors, (10), 9 states have return successors, (14), 13 states have call predecessors, (14), 8 states have call successors, (14) [2023-11-25 00:08:51,750 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2023-11-25 00:08:51,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-25 00:08:51,753 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:51,753 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:51,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-25 00:08:51,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:51,954 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:08:51,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:51,955 INFO L85 PathProgramCache]: Analyzing trace with hash 651238953, now seen corresponding path program 3 times [2023-11-25 00:08:51,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:51,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176852552] [2023-11-25 00:08:51,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:51,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-25 00:08:52,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:52,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176852552] [2023-11-25 00:08:52,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176852552] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:08:52,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440776772] [2023-11-25 00:08:52,344 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-25 00:08:52,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:52,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:08:52,346 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:08:52,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-25 00:08:52,414 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-25 00:08:52,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:08:52,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-25 00:08:52,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:08:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-25 00:08:52,675 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:08:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-25 00:08:53,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440776772] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:08:53,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2108663412] [2023-11-25 00:08:53,607 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-25 00:08:53,607 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:08:53,607 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-25 00:08:53,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:08:53,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 16] total 29 [2023-11-25 00:08:53,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180849798] [2023-11-25 00:08:53,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:08:53,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-25 00:08:53,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:53,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-25 00:08:53,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2023-11-25 00:08:53,612 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 21 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 9 states have return successors, (14), 12 states have call predecessors, (14), 8 states have call successors, (14) [2023-11-25 00:08:54,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:54,108 INFO L93 Difference]: Finished difference Result 53 states and 85 transitions. [2023-11-25 00:08:54,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-25 00:08:54,110 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 21 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 9 states have return successors, (14), 12 states have call predecessors, (14), 8 states have call successors, (14) Word has length 38 [2023-11-25 00:08:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:54,113 INFO L225 Difference]: With dead ends: 53 [2023-11-25 00:08:54,113 INFO L226 Difference]: Without dead ends: 47 [2023-11-25 00:08:54,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=330, Invalid=1650, Unknown=0, NotChecked=0, Total=1980 [2023-11-25 00:08:54,115 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:54,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 75 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:08:54,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-25 00:08:54,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2023-11-25 00:08:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 24 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (27), 9 states have call predecessors, (27), 6 states have call successors, (27) [2023-11-25 00:08:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 57 transitions. [2023-11-25 00:08:54,129 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 57 transitions. Word has length 38 [2023-11-25 00:08:54,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:54,135 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 57 transitions. [2023-11-25 00:08:54,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 21 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 9 states have return successors, (14), 12 states have call predecessors, (14), 8 states have call successors, (14) [2023-11-25 00:08:54,136 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 57 transitions. [2023-11-25 00:08:54,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-25 00:08:54,143 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:54,144 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:54,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-25 00:08:54,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-25 00:08:54,353 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:08:54,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:54,353 INFO L85 PathProgramCache]: Analyzing trace with hash 240837571, now seen corresponding path program 4 times [2023-11-25 00:08:54,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:54,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797878286] [2023-11-25 00:08:54,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:54,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 42 proven. 46 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2023-11-25 00:08:54,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:54,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797878286] [2023-11-25 00:08:54,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797878286] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:08:54,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183369218] [2023-11-25 00:08:54,450 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-25 00:08:54,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:54,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:08:54,451 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:08:54,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-25 00:08:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:54,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-25 00:08:54,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:08:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 42 proven. 46 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2023-11-25 00:08:54,567 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:08:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 42 proven. 46 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2023-11-25 00:08:54,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183369218] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:08:54,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [208359566] [2023-11-25 00:08:54,793 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-25 00:08:54,793 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:08:54,794 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-25 00:08:54,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:08:54,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2023-11-25 00:08:54,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026177306] [2023-11-25 00:08:54,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:08:54,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-25 00:08:54,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:54,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-25 00:08:54,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-25 00:08:54,797 INFO L87 Difference]: Start difference. First operand 35 states and 57 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-25 00:08:54,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:54,905 INFO L93 Difference]: Finished difference Result 70 states and 132 transitions. [2023-11-25 00:08:54,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-25 00:08:54,906 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2023-11-25 00:08:54,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:54,907 INFO L225 Difference]: With dead ends: 70 [2023-11-25 00:08:54,907 INFO L226 Difference]: Without dead ends: 37 [2023-11-25 00:08:54,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-11-25 00:08:54,910 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:54,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 40 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:08:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-25 00:08:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-25 00:08:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (22), 9 states have call predecessors, (22), 6 states have call successors, (22) [2023-11-25 00:08:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2023-11-25 00:08:54,919 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 66 [2023-11-25 00:08:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:54,920 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2023-11-25 00:08:54,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-25 00:08:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2023-11-25 00:08:54,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-25 00:08:54,922 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:54,922 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:54,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-25 00:08:55,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:55,130 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:08:55,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:55,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1360547340, now seen corresponding path program 5 times [2023-11-25 00:08:55,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:55,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571443464] [2023-11-25 00:08:55,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:55,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 55 proven. 93 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2023-11-25 00:08:55,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:55,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571443464] [2023-11-25 00:08:55,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571443464] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:08:55,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89456697] [2023-11-25 00:08:55,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-25 00:08:55,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:55,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:08:55,343 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:08:55,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-25 00:08:55,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-11-25 00:08:55,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:08:55,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-25 00:08:55,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:08:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 134 proven. 17 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-11-25 00:08:55,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:08:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 134 proven. 18 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-11-25 00:08:55,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89456697] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:08:55,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1160815128] [2023-11-25 00:08:55,953 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-25 00:08:55,953 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:08:55,954 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-25 00:08:55,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:08:55,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 17 [2023-11-25 00:08:55,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294810213] [2023-11-25 00:08:55,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:08:55,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-25 00:08:55,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:55,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-25 00:08:55,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-11-25 00:08:55,958 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 8 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2023-11-25 00:08:56,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:56,204 INFO L93 Difference]: Finished difference Result 79 states and 127 transitions. [2023-11-25 00:08:56,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-25 00:08:56,205 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 8 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) Word has length 79 [2023-11-25 00:08:56,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:56,210 INFO L225 Difference]: With dead ends: 79 [2023-11-25 00:08:56,210 INFO L226 Difference]: Without dead ends: 45 [2023-11-25 00:08:56,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 148 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2023-11-25 00:08:56,215 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:56,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 89 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:08:56,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-25 00:08:56,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-25 00:08:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.0625) internal successors, (34), 30 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2023-11-25 00:08:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2023-11-25 00:08:56,230 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 79 [2023-11-25 00:08:56,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:56,231 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2023-11-25 00:08:56,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 8 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2023-11-25 00:08:56,232 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2023-11-25 00:08:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-25 00:08:56,240 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:56,240 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:56,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-25 00:08:56,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-25 00:08:56,447 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:08:56,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:56,447 INFO L85 PathProgramCache]: Analyzing trace with hash -2071546414, now seen corresponding path program 6 times [2023-11-25 00:08:56,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:56,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165840649] [2023-11-25 00:08:56,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:56,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 101 proven. 213 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2023-11-25 00:08:56,733 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:56,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165840649] [2023-11-25 00:08:56,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165840649] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:08:56,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465163417] [2023-11-25 00:08:56,734 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-25 00:08:56,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:56,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:08:56,736 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:08:56,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-25 00:08:56,835 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-25 00:08:56,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:08:56,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-25 00:08:56,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:08:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 116 proven. 229 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2023-11-25 00:08:56,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:08:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 116 proven. 241 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2023-11-25 00:08:57,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465163417] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:08:57,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1706762254] [2023-11-25 00:08:57,828 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-25 00:08:57,828 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:08:57,828 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-25 00:08:57,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:08:57,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 20 [2023-11-25 00:08:57,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218907524] [2023-11-25 00:08:57,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:08:57,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-25 00:08:57,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:57,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-25 00:08:57,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2023-11-25 00:08:57,836 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 14 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (21), 9 states have call predecessors, (21), 14 states have call successors, (21) [2023-11-25 00:08:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:58,127 INFO L93 Difference]: Finished difference Result 100 states and 142 transitions. [2023-11-25 00:08:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-25 00:08:58,128 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 14 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (21), 9 states have call predecessors, (21), 14 states have call successors, (21) Word has length 106 [2023-11-25 00:08:58,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:58,132 INFO L225 Difference]: With dead ends: 100 [2023-11-25 00:08:58,133 INFO L226 Difference]: Without dead ends: 60 [2023-11-25 00:08:58,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 200 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2023-11-25 00:08:58,136 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 71 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:58,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 87 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:08:58,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-25 00:08:58,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2023-11-25 00:08:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (18), 10 states have call predecessors, (18), 8 states have call successors, (18) [2023-11-25 00:08:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2023-11-25 00:08:58,148 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 106 [2023-11-25 00:08:58,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:58,148 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2023-11-25 00:08:58,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 14 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (21), 9 states have call predecessors, (21), 14 states have call successors, (21) [2023-11-25 00:08:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2023-11-25 00:08:58,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-25 00:08:58,151 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:58,151 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:58,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-25 00:08:58,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-25 00:08:58,358 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:08:58,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:58,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1101187310, now seen corresponding path program 7 times [2023-11-25 00:08:58,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:58,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938192702] [2023-11-25 00:08:58,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:58,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 181 proven. 305 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2023-11-25 00:08:58,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:58,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938192702] [2023-11-25 00:08:58,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938192702] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:08:58,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431937947] [2023-11-25 00:08:58,784 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-25 00:08:58,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:58,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:08:58,786 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:08:58,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-25 00:08:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:58,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-25 00:08:58,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:08:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 356 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2023-11-25 00:08:59,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:09:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 207 proven. 383 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2023-11-25 00:09:00,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431937947] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:09:00,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1817791870] [2023-11-25 00:09:00,579 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-25 00:09:00,580 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:09:00,580 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-25 00:09:00,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:09:00,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 19] total 24 [2023-11-25 00:09:00,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311465969] [2023-11-25 00:09:00,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:09:00,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-25 00:09:00,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:09:00,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-25 00:09:00,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2023-11-25 00:09:00,584 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 states have internal predecessors, (73), 17 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (27), 11 states have call predecessors, (27), 17 states have call successors, (27) [2023-11-25 00:09:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:09:00,983 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2023-11-25 00:09:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-25 00:09:00,986 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 states have internal predecessors, (73), 17 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (27), 11 states have call predecessors, (27), 17 states have call successors, (27) Word has length 133 [2023-11-25 00:09:00,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:09:00,988 INFO L225 Difference]: With dead ends: 121 [2023-11-25 00:09:00,988 INFO L226 Difference]: Without dead ends: 75 [2023-11-25 00:09:00,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 250 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=416, Invalid=1144, Unknown=0, NotChecked=0, Total=1560 [2023-11-25 00:09:00,991 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 95 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:09:00,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 113 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:09:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-25 00:09:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2023-11-25 00:09:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.0625) internal successors, (51), 45 states have internal predecessors, (51), 11 states have call successors, (11), 8 states have call predecessors, (11), 8 states have return successors, (31), 14 states have call predecessors, (31), 11 states have call successors, (31) [2023-11-25 00:09:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2023-11-25 00:09:01,003 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 93 transitions. Word has length 133 [2023-11-25 00:09:01,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:09:01,004 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 93 transitions. [2023-11-25 00:09:01,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 24 states have internal predecessors, (73), 17 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (27), 11 states have call predecessors, (27), 17 states have call successors, (27) [2023-11-25 00:09:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2023-11-25 00:09:01,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-11-25 00:09:01,006 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:09:01,007 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:09:01,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-25 00:09:01,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-25 00:09:01,213 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:09:01,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:09:01,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1526876107, now seen corresponding path program 8 times [2023-11-25 00:09:01,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:09:01,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58424144] [2023-11-25 00:09:01,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:09:01,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:09:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:09:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 77 proven. 845 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2023-11-25 00:09:02,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:09:02,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58424144] [2023-11-25 00:09:02,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58424144] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:09:02,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060980367] [2023-11-25 00:09:02,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-25 00:09:02,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:09:02,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:09:02,869 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:09:02,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-25 00:09:03,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2023-11-25 00:09:03,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:09:03,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-25 00:09:03,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:09:03,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 476 proven. 283 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2023-11-25 00:09:03,746 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:09:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 381 proven. 390 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2023-11-25 00:09:12,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060980367] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:09:12,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [64905772] [2023-11-25 00:09:12,572 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-25 00:09:12,572 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:09:12,573 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-25 00:09:12,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:09:12,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 30] total 61 [2023-11-25 00:09:12,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181277629] [2023-11-25 00:09:12,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:09:12,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-25 00:09:12,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:09:12,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-25 00:09:12,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=3312, Unknown=0, NotChecked=0, Total=3660 [2023-11-25 00:09:12,579 INFO L87 Difference]: Start difference. First operand 68 states and 93 transitions. Second operand has 61 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 38 states have internal predecessors, (80), 18 states have call successors, (19), 1 states have call predecessors, (19), 15 states have return successors, (37), 36 states have call predecessors, (37), 18 states have call successors, (37) [2023-11-25 00:09:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:09:13,774 INFO L93 Difference]: Finished difference Result 87 states and 125 transitions. [2023-11-25 00:09:13,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-25 00:09:13,775 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 38 states have internal predecessors, (80), 18 states have call successors, (19), 1 states have call predecessors, (19), 15 states have return successors, (37), 36 states have call predecessors, (37), 18 states have call successors, (37) Word has length 174 [2023-11-25 00:09:13,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:09:13,777 INFO L225 Difference]: With dead ends: 87 [2023-11-25 00:09:13,777 INFO L226 Difference]: Without dead ends: 0 [2023-11-25 00:09:13,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 313 SyntacticMatches, 33 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3917 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=875, Invalid=6435, Unknown=0, NotChecked=0, Total=7310 [2023-11-25 00:09:13,781 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-25 00:09:13,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 244 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-25 00:09:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-25 00:09:13,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-25 00:09:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:09:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-25 00:09:13,782 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2023-11-25 00:09:13,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:09:13,783 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-25 00:09:13,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 38 states have internal predecessors, (80), 18 states have call successors, (19), 1 states have call predecessors, (19), 15 states have return successors, (37), 36 states have call predecessors, (37), 18 states have call successors, (37) [2023-11-25 00:09:13,783 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-25 00:09:13,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-25 00:09:13,786 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-25 00:09:13,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-25 00:09:13,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-25 00:09:13,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-25 00:09:14,296 INFO L899 garLoopResultBuilder]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2023-11-25 00:09:14,296 INFO L895 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (and (< 1 |fibonacci_#in~n|) (= fibonacci_~n |fibonacci_#in~n|)) [2023-11-25 00:09:14,296 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2023-11-25 00:09:14,296 INFO L895 garLoopResultBuilder]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (<= 4 |fibonacci_#in~n|)) (.cse1 (= fibonacci_~n |fibonacci_#in~n|)) (.cse2 (= |fibonacci_#t~ret4| 1))) (or (and (<= fibonacci_~n 5) .cse0 .cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 2))) (and (= 3 |fibonacci_#in~n|) (= 3 fibonacci_~n) .cse2) (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret4| 1)) .cse0 .cse1) (and (= 2 |fibonacci_#in~n|) (= 2 fibonacci_~n) .cse2))) [2023-11-25 00:09:14,296 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 23) no Hoare annotation was computed. [2023-11-25 00:09:14,297 INFO L899 garLoopResultBuilder]: For program point L22-3(line 22) no Hoare annotation was computed. [2023-11-25 00:09:14,297 INFO L899 garLoopResultBuilder]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2023-11-25 00:09:14,297 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2023-11-25 00:09:14,297 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 16 24) the Hoare annotation is: true [2023-11-25 00:09:14,297 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2023-11-25 00:09:14,297 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-25 00:09:14,297 INFO L902 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2023-11-25 00:09:14,297 INFO L899 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2023-11-25 00:09:14,297 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 31) no Hoare annotation was computed. [2023-11-25 00:09:14,297 INFO L899 garLoopResultBuilder]: For program point L27(lines 27 38) no Hoare annotation was computed. [2023-11-25 00:09:14,298 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2023-11-25 00:09:14,298 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-25 00:09:14,298 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2023-11-25 00:09:14,301 INFO L445 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1] [2023-11-25 00:09:14,304 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-25 00:09:14,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 12:09:14 BoogieIcfgContainer [2023-11-25 00:09:14,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-25 00:09:14,310 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-25 00:09:14,310 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-25 00:09:14,310 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-25 00:09:14,311 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:08:45" (3/4) ... [2023-11-25 00:09:14,313 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-25 00:09:14,317 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2023-11-25 00:09:14,325 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-25 00:09:14,326 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-25 00:09:14,326 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-25 00:09:14,326 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-25 00:09:14,429 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/witness.graphml [2023-11-25 00:09:14,430 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/witness.yml [2023-11-25 00:09:14,430 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-25 00:09:14,431 INFO L158 Benchmark]: Toolchain (without parser) took 29399.34ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 143.3MB in the beginning and 109.1MB in the end (delta: 34.2MB). Peak memory consumption was 167.8MB. Max. memory is 16.1GB. [2023-11-25 00:09:14,432 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 134.2MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-25 00:09:14,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.95ms. Allocated memory is still 176.2MB. Free memory was 142.8MB in the beginning and 132.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-25 00:09:14,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.92ms. Allocated memory is still 176.2MB. Free memory was 132.8MB in the beginning and 131.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-25 00:09:14,433 INFO L158 Benchmark]: Boogie Preprocessor took 17.85ms. Allocated memory is still 176.2MB. Free memory was 131.3MB in the beginning and 130.3MB in the end (delta: 978.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-25 00:09:14,434 INFO L158 Benchmark]: RCFGBuilder took 371.72ms. Allocated memory is still 176.2MB. Free memory was 130.3MB in the beginning and 120.3MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-25 00:09:14,434 INFO L158 Benchmark]: TraceAbstraction took 28571.40ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 119.6MB in the beginning and 113.3MB in the end (delta: 6.3MB). Peak memory consumption was 140.5MB. Max. memory is 16.1GB. [2023-11-25 00:09:14,435 INFO L158 Benchmark]: Witness Printer took 120.11ms. Allocated memory is still 308.3MB. Free memory was 113.3MB in the beginning and 109.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-25 00:09:14,438 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 134.2MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.95ms. Allocated memory is still 176.2MB. Free memory was 142.8MB in the beginning and 132.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.92ms. Allocated memory is still 176.2MB. Free memory was 132.8MB in the beginning and 131.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.85ms. Allocated memory is still 176.2MB. Free memory was 131.3MB in the beginning and 130.3MB in the end (delta: 978.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 371.72ms. Allocated memory is still 176.2MB. Free memory was 130.3MB in the beginning and 120.3MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 28571.40ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 119.6MB in the beginning and 113.3MB in the end (delta: 6.3MB). Peak memory consumption was 140.5MB. Max. memory is 16.1GB. * Witness Printer took 120.11ms. Allocated memory is still 308.3MB. Free memory was 113.3MB in the beginning and 109.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.5s, OverallIterations: 11, TraceHistogramMax: 25, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 392 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 370 mSDsluCounter, 999 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 842 mSDsCounter, 338 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2667 IncrementalHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 338 mSolverCounterUnsat, 157 mSDtfsCounter, 2667 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1619 GetRequests, 1224 SyntacticMatches, 69 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5681 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=10, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 38 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 121 PreInvPairs, 172 NumberOfFragments, 57 HoareAnnotationTreeSize, 121 FomulaSimplifications, 1369 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 648 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 20.5s InterpolantComputationTime, 1381 NumberOfCodeBlocks, 1336 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 2032 ConstructedInterpolants, 0 QuantifiedInterpolants, 5045 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1566 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 7625/11313 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-25 00:09:14,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f76eb2-2b69-4017-bc04-2c7ef1552d88/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE