./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8 --witnessprinter.witness.filename witness.graphml --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 ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:17:05,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:17:05,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:17:05,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:17:05,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:17:05,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:17:05,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:17:05,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:17:05,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:17:05,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:17:05,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:17:05,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:17:05,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:17:05,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:17:05,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:17:05,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:17:05,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:17:05,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:17:05,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:17:05,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:17:05,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:17:05,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:17:05,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:17:05,429 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:17:05,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:17:05,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:17:05,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:17:05,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:17:05,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:17:05,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:17:05,438 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:17:05,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:17:05,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:17:05,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:17:05,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:17:05,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:17:05,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:17:05,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:17:05,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:17:05,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:17:05,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:17:05,448 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 01:17:05,493 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:17:05,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:17:05,495 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:17:05,495 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:17:05,496 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:17:05,496 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:17:05,496 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:17:05,496 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:17:05,497 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:17:05,497 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:17:05,498 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:17:05,498 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:17:05,499 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:17:05,499 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:17:05,499 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:17:05,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:17:05,500 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:17:05,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:17:05,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:17:05,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:17:05,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:17:05,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:17:05,502 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:17:05,502 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:17:05,502 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:17:05,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:17:05,503 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:17:05,503 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:17:05,503 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:17:05,505 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:17:05,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:17:05,505 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:17:05,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:17:05,506 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:17:05,506 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:17:05,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:17:05,507 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:17:05,507 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:17:05,507 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:17:05,507 INFO L138 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_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/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_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db [2021-11-07 01:17:05,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:17:05,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:17:05,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:17:05,808 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:17:05,808 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:17:05,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2021-11-07 01:17:05,875 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/data/b29451d22/f3c642dc683448578fb60b30bc9067d7/FLAG3a369c4f1 [2021-11-07 01:17:06,299 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:17:06,300 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2021-11-07 01:17:06,306 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/data/b29451d22/f3c642dc683448578fb60b30bc9067d7/FLAG3a369c4f1 [2021-11-07 01:17:06,323 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/data/b29451d22/f3c642dc683448578fb60b30bc9067d7 [2021-11-07 01:17:06,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:17:06,326 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:17:06,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:17:06,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:17:06,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:17:06,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:17:06" (1/1) ... [2021-11-07 01:17:06,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37701fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:17:06, skipping insertion in model container [2021-11-07 01:17:06,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:17:06" (1/1) ... [2021-11-07 01:17:06,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:17:06,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:17:06,533 WARN L228 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_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2021-11-07 01:17:06,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:17:06,545 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:17:06,558 WARN L228 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_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2021-11-07 01:17:06,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:17:06,571 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:17:06,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:17:06 WrapperNode [2021-11-07 01:17:06,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:17:06,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:17:06,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:17:06,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:17:06,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:17:06" (1/1) ... [2021-11-07 01:17:06,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:17:06" (1/1) ... [2021-11-07 01:17:06,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:17:06,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:17:06,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:17:06,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:17:06,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:17:06" (1/1) ... [2021-11-07 01:17:06,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:17:06" (1/1) ... [2021-11-07 01:17:06,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:17:06" (1/1) ... [2021-11-07 01:17:06,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:17:06" (1/1) ... [2021-11-07 01:17:06,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:17:06" (1/1) ... [2021-11-07 01:17:06,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:17:06" (1/1) ... [2021-11-07 01:17:06,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:17:06" (1/1) ... [2021-11-07 01:17:06,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:17:06,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:17:06,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:17:06,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:17:06,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:17:06" (1/1) ... [2021-11-07 01:17:06,636 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:17:06,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:17:06,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:17:06,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:17:06,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:17:06,705 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2021-11-07 01:17:06,705 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2021-11-07 01:17:06,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:17:06,705 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2021-11-07 01:17:06,705 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2021-11-07 01:17:06,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:17:06,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:17:07,014 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:17:07,014 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 01:17:07,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:17:07 BoogieIcfgContainer [2021-11-07 01:17:07,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:17:07,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:17:07,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:17:07,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:17:07,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:17:06" (1/3) ... [2021-11-07 01:17:07,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5213cc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:17:07, skipping insertion in model container [2021-11-07 01:17:07,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:17:06" (2/3) ... [2021-11-07 01:17:07,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5213cc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:17:07, skipping insertion in model container [2021-11-07 01:17:07,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:17:07" (3/3) ... [2021-11-07 01:17:07,025 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2021-11-07 01:17:07,030 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:17:07,030 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 01:17:07,079 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:17:07,086 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 01:17:07,086 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 01:17:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-11-07 01:17:07,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 01:17:07,107 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:17:07,107 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:17:07,108 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:17:07,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:17:07,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2097990987, now seen corresponding path program 1 times [2021-11-07 01:17:07,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:17:07,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806828335] [2021-11-07 01:17:07,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:07,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:17:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:07,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:17:07,306 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:17:07,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806828335] [2021-11-07 01:17:07,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806828335] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:17:07,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:17:07,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:17:07,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388159535] [2021-11-07 01:17:07,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:17:07,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:17:07,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:17:07,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:17:07,329 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 01:17:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:17:07,368 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2021-11-07 01:17:07,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:17:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-11-07 01:17:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:17:07,378 INFO L225 Difference]: With dead ends: 36 [2021-11-07 01:17:07,378 INFO L226 Difference]: Without dead ends: 26 [2021-11-07 01:17:07,380 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:17:07,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-07 01:17:07,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-11-07 01:17:07,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-07 01:17:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-11-07 01:17:07,421 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2021-11-07 01:17:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:17:07,421 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-11-07 01:17:07,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-07 01:17:07,422 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-11-07 01:17:07,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:17:07,423 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:17:07,423 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:17:07,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:17:07,424 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:17:07,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:17:07,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1328370967, now seen corresponding path program 1 times [2021-11-07 01:17:07,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:17:07,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126389067] [2021-11-07 01:17:07,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:07,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:17:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:07,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:17:07,475 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:17:07,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126389067] [2021-11-07 01:17:07,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126389067] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:17:07,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:17:07,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:17:07,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222299555] [2021-11-07 01:17:07,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:17:07,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:17:07,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:17:07,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:17:07,479 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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) [2021-11-07 01:17:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:17:07,497 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2021-11-07 01:17:07,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:17:07,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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 [2021-11-07 01:17:07,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:17:07,499 INFO L225 Difference]: With dead ends: 32 [2021-11-07 01:17:07,499 INFO L226 Difference]: Without dead ends: 28 [2021-11-07 01:17:07,500 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:17:07,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-11-07 01:17:07,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2021-11-07 01:17:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2021-11-07 01:17:07,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-11-07 01:17:07,507 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2021-11-07 01:17:07,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:17:07,508 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-11-07 01:17:07,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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) [2021-11-07 01:17:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-11-07 01:17:07,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 01:17:07,510 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:17:07,510 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:17:07,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:17:07,510 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:17:07,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:17:07,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1296553538, now seen corresponding path program 1 times [2021-11-07 01:17:07,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:17:07,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397176125] [2021-11-07 01:17:07,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:07,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:17:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:07,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:17:07,601 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:17:07,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397176125] [2021-11-07 01:17:07,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397176125] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:17:07,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186021039] [2021-11-07 01:17:07,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:07,603 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:07,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:17:07,627 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:17:07,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 01:17:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:07,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 01:17:07,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:17:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:17:07,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:17:08,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 01:17:08,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186021039] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:17:08,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [711050245] [2021-11-07 01:17:08,321 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-11-07 01:17:08,321 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:17:08,326 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-07 01:17:08,332 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-07 01:17:08,332 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-07 01:17:08,365 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,373 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:17:08,374 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,374 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-11-07 01:17:08,375 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:17:08,376 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,377 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-11-07 01:17:08,380 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 122 [2021-11-07 01:17:08,401 INFO L446 ElimStorePlain]: Different costs {0=[|v_#length_9|], 21=[|v_#valid_10|]} [2021-11-07 01:17:08,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:17:08,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:17:08,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:17:08,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2021-11-07 01:17:08,426 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,427 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-07 01:17:08,428 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,429 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-07 01:17:08,429 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:17:08,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:17:08,491 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:17:08,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:17:08,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:17:08,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:17:08,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:17:08,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:17:08,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:17:08,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:17:08,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:17:08,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2021-11-07 01:17:08,520 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,525 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-11-07 01:17:08,526 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,527 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-11-07 01:17:08,527 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-07 01:17:08,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:17:08,556 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,559 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,563 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-11-07 01:17:08,564 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:17:08,565 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:119, output treesize:94 [2021-11-07 01:17:08,579 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,589 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-11-07 01:17:08,608 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,611 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-11-07 01:17:08,625 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,633 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-11-07 01:17:08,635 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,639 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-11-07 01:17:08,641 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,644 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-11-07 01:17:08,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:17:08,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:17:08,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:17:08,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:17:08,681 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,688 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-11-07 01:17:08,693 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,698 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-11-07 01:17:08,699 INFO L197 IcfgInterpreter]: Interpreting procedure fibo1 with input of size 57 for LOIs [2021-11-07 01:17:08,716 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,722 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-11-07 01:17:08,726 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,730 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-11-07 01:17:08,739 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,746 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-11-07 01:17:08,753 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,758 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-11-07 01:17:08,766 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:17:08,770 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-11-07 01:17:08,773 INFO L197 IcfgInterpreter]: Interpreting procedure fibo2 with input of size 57 for LOIs [2021-11-07 01:17:08,779 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-07 01:17:09,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [711050245] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:17:09,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:17:09,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 7, 7] total 17 [2021-11-07 01:17:09,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019301143] [2021-11-07 01:17:09,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 01:17:09,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:17:09,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 01:17:09,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:17:09,531 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-07 01:17:09,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:17:09,713 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2021-11-07 01:17:09,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:17:09,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2021-11-07 01:17:09,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:17:09,721 INFO L225 Difference]: With dead ends: 68 [2021-11-07 01:17:09,721 INFO L226 Difference]: Without dead ends: 44 [2021-11-07 01:17:09,724 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:17:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-11-07 01:17:09,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2021-11-07 01:17:09,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-07 01:17:09,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2021-11-07 01:17:09,738 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 22 [2021-11-07 01:17:09,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:17:09,738 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2021-11-07 01:17:09,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-07 01:17:09,739 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2021-11-07 01:17:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-07 01:17:09,741 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:17:09,741 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:17:09,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 01:17:09,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:09,960 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:17:09,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:17:09,961 INFO L85 PathProgramCache]: Analyzing trace with hash -28918515, now seen corresponding path program 1 times [2021-11-07 01:17:09,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:17:09,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099053518] [2021-11-07 01:17:09,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:09,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:17:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-07 01:17:10,033 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:17:10,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099053518] [2021-11-07 01:17:10,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099053518] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:17:10,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639591197] [2021-11-07 01:17:10,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:10,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:10,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:17:10,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:17:10,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 01:17:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:10,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-07 01:17:10,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:17:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-07 01:17:10,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:17:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:17:10,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639591197] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:17:10,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1544722285] [2021-11-07 01:17:10,673 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:17:10,673 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:17:10,675 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:17:10,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:17:10,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2021-11-07 01:17:10,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667607057] [2021-11-07 01:17:10,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-07 01:17:10,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:17:10,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-07 01:17:10,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-11-07 01:17:10,680 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2021-11-07 01:17:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:17:10,875 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2021-11-07 01:17:10,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 01:17:10,876 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 35 [2021-11-07 01:17:10,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:17:10,877 INFO L225 Difference]: With dead ends: 85 [2021-11-07 01:17:10,878 INFO L226 Difference]: Without dead ends: 53 [2021-11-07 01:17:10,879 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2021-11-07 01:17:10,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-07 01:17:10,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2021-11-07 01:17:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2021-11-07 01:17:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2021-11-07 01:17:10,892 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 35 [2021-11-07 01:17:10,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:17:10,892 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2021-11-07 01:17:10,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2021-11-07 01:17:10,893 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2021-11-07 01:17:10,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 01:17:10,895 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:17:10,895 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:17:10,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 01:17:11,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-07 01:17:11,119 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:17:11,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:17:11,120 INFO L85 PathProgramCache]: Analyzing trace with hash -243412115, now seen corresponding path program 1 times [2021-11-07 01:17:11,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:17:11,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914893776] [2021-11-07 01:17:11,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:11,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:17:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-07 01:17:11,257 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:17:11,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914893776] [2021-11-07 01:17:11,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914893776] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:17:11,259 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921892684] [2021-11-07 01:17:11,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:11,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:11,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:17:11,260 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:17:11,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 01:17:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:11,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-07 01:17:11,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:17:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-07 01:17:11,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:17:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 01:17:11,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921892684] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:17:11,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [917006952] [2021-11-07 01:17:11,920 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:17:11,920 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:17:11,921 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:17:11,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:17:11,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2021-11-07 01:17:11,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638694024] [2021-11-07 01:17:11,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-07 01:17:11,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:17:11,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-07 01:17:11,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-11-07 01:17:11,924 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-11-07 01:17:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:17:12,438 INFO L93 Difference]: Finished difference Result 121 states and 203 transitions. [2021-11-07 01:17:12,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:17:12,439 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2021-11-07 01:17:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:17:12,441 INFO L225 Difference]: With dead ends: 121 [2021-11-07 01:17:12,442 INFO L226 Difference]: Without dead ends: 77 [2021-11-07 01:17:12,443 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2021-11-07 01:17:12,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-11-07 01:17:12,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2021-11-07 01:17:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.15) internal successors, (46), 43 states have internal predecessors, (46), 14 states have call successors, (14), 5 states have call predecessors, (14), 8 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) [2021-11-07 01:17:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2021-11-07 01:17:12,461 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 36 [2021-11-07 01:17:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:17:12,461 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2021-11-07 01:17:12,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2021-11-07 01:17:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2021-11-07 01:17:12,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-07 01:17:12,464 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:17:12,464 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:17:12,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 01:17:12,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:12,680 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:17:12,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:17:12,681 INFO L85 PathProgramCache]: Analyzing trace with hash 403750738, now seen corresponding path program 1 times [2021-11-07 01:17:12,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:17:12,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947899071] [2021-11-07 01:17:12,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:12,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:17:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:12,770 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-07 01:17:12,771 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:17:12,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947899071] [2021-11-07 01:17:12,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947899071] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:17:12,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021846764] [2021-11-07 01:17:12,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:12,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:12,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:17:12,782 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:17:12,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-07 01:17:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:12,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 01:17:12,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:17:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-07 01:17:13,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:17:13,683 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-07 01:17:13,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021846764] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:17:13,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1618543137] [2021-11-07 01:17:13,709 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:17:13,709 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:17:13,711 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:17:13,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:17:13,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2021-11-07 01:17:13,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168125128] [2021-11-07 01:17:13,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:17:13,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:17:13,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:17:13,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:17:13,716 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2021-11-07 01:17:13,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:17:13,944 INFO L93 Difference]: Finished difference Result 119 states and 203 transitions. [2021-11-07 01:17:13,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 01:17:13,945 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) Word has length 50 [2021-11-07 01:17:13,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:17:13,950 INFO L225 Difference]: With dead ends: 119 [2021-11-07 01:17:13,950 INFO L226 Difference]: Without dead ends: 97 [2021-11-07 01:17:13,952 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2021-11-07 01:17:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-11-07 01:17:13,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 72. [2021-11-07 01:17:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 49 states have internal predecessors, (52), 14 states have call successors, (14), 5 states have call predecessors, (14), 11 states have return successors, (39), 17 states have call predecessors, (39), 14 states have call successors, (39) [2021-11-07 01:17:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2021-11-07 01:17:13,983 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 50 [2021-11-07 01:17:13,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:17:13,983 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2021-11-07 01:17:13,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2021-11-07 01:17:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2021-11-07 01:17:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-07 01:17:13,988 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:17:13,988 INFO L513 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:17:14,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-07 01:17:14,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-07 01:17:14,203 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:17:14,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:17:14,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1766289300, now seen corresponding path program 1 times [2021-11-07 01:17:14,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:17:14,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497125742] [2021-11-07 01:17:14,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:14,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:17:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 39 proven. 42 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-07 01:17:14,341 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:17:14,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497125742] [2021-11-07 01:17:14,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497125742] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:17:14,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855364572] [2021-11-07 01:17:14,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:14,342 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:14,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:17:14,343 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:17:14,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-07 01:17:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:14,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-07 01:17:14,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:17:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 71 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-11-07 01:17:14,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:17:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 12 proven. 81 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-07 01:17:15,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855364572] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:17:15,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [727317319] [2021-11-07 01:17:15,674 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:17:15,674 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:17:15,675 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:17:15,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:17:15,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2021-11-07 01:17:15,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696190953] [2021-11-07 01:17:15,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-07 01:17:15,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:17:15,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-07 01:17:15,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-11-07 01:17:15,680 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand has 23 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 23 states have internal predecessors, (72), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) [2021-11-07 01:17:16,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:17:16,434 INFO L93 Difference]: Finished difference Result 204 states and 411 transitions. [2021-11-07 01:17:16,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-07 01:17:16,435 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 23 states have internal predecessors, (72), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) Word has length 79 [2021-11-07 01:17:16,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:17:16,438 INFO L225 Difference]: With dead ends: 204 [2021-11-07 01:17:16,438 INFO L226 Difference]: Without dead ends: 115 [2021-11-07 01:17:16,439 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2021-11-07 01:17:16,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-07 01:17:16,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 98. [2021-11-07 01:17:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.171875) internal successors, (75), 66 states have internal predecessors, (75), 19 states have call successors, (19), 8 states have call predecessors, (19), 14 states have return successors, (50), 23 states have call predecessors, (50), 19 states have call successors, (50) [2021-11-07 01:17:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2021-11-07 01:17:16,460 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 79 [2021-11-07 01:17:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:17:16,460 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2021-11-07 01:17:16,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 23 states have internal predecessors, (72), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 10 states have call predecessors, (25), 18 states have call successors, (25) [2021-11-07 01:17:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2021-11-07 01:17:16,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-07 01:17:16,467 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:17:16,467 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-07 01:17:16,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-07 01:17:16,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-07 01:17:16,683 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:17:16,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:17:16,683 INFO L85 PathProgramCache]: Analyzing trace with hash -346616466, now seen corresponding path program 1 times [2021-11-07 01:17:16,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:17:16,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925501012] [2021-11-07 01:17:16,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:16,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:17:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 39 proven. 92 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2021-11-07 01:17:16,820 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:17:16,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925501012] [2021-11-07 01:17:16,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925501012] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:17:16,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132441137] [2021-11-07 01:17:16,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:16,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:16,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:17:16,827 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:17:16,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-07 01:17:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:17,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-07 01:17:17,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:17:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 29 proven. 172 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2021-11-07 01:17:17,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:17:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 29 proven. 186 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2021-11-07 01:17:18,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132441137] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:17:18,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1779929654] [2021-11-07 01:17:18,892 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:17:18,892 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:17:18,892 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:17:18,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:17:18,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 15] total 20 [2021-11-07 01:17:18,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604454958] [2021-11-07 01:17:18,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-07 01:17:18,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:17:18,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-07 01:17:18,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-11-07 01:17:18,896 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 20 states, 17 states have (on average 4.117647058823529) internal successors, (70), 20 states have internal predecessors, (70), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (27), 7 states have call predecessors, (27), 17 states have call successors, (27) [2021-11-07 01:17:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:17:19,185 INFO L93 Difference]: Finished difference Result 191 states and 315 transitions. [2021-11-07 01:17:19,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:17:19,186 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 4.117647058823529) internal successors, (70), 20 states have internal predecessors, (70), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (27), 7 states have call predecessors, (27), 17 states have call successors, (27) Word has length 130 [2021-11-07 01:17:19,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:17:19,187 INFO L225 Difference]: With dead ends: 191 [2021-11-07 01:17:19,187 INFO L226 Difference]: Without dead ends: 103 [2021-11-07 01:17:19,188 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 240 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2021-11-07 01:17:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-11-07 01:17:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2021-11-07 01:17:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 68 states have internal predecessors, (76), 19 states have call successors, (19), 8 states have call predecessors, (19), 15 states have return successors, (48), 23 states have call predecessors, (48), 19 states have call successors, (48) [2021-11-07 01:17:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2021-11-07 01:17:19,203 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 130 [2021-11-07 01:17:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:17:19,203 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2021-11-07 01:17:19,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 4.117647058823529) internal successors, (70), 20 states have internal predecessors, (70), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (27), 7 states have call predecessors, (27), 17 states have call successors, (27) [2021-11-07 01:17:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2021-11-07 01:17:19,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-07 01:17:19,209 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:17:19,209 INFO L513 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:17:19,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-07 01:17:19,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:19,435 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:17:19,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:17:19,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2089532945, now seen corresponding path program 2 times [2021-11-07 01:17:19,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:17:19,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226642935] [2021-11-07 01:17:19,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:19,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:17:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 37 proven. 111 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2021-11-07 01:17:19,591 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:17:19,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226642935] [2021-11-07 01:17:19,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226642935] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:17:19,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732019802] [2021-11-07 01:17:19,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 01:17:19,591 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:19,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:17:19,599 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:17:19,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-07 01:17:19,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-07 01:17:19,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:17:19,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-07 01:17:19,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:17:20,194 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 77 proven. 20 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2021-11-07 01:17:20,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:17:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 77 proven. 22 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2021-11-07 01:17:20,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732019802] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:17:20,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1212900358] [2021-11-07 01:17:20,814 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:17:20,814 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:17:20,815 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:17:20,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:17:20,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 16 [2021-11-07 01:17:20,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230458384] [2021-11-07 01:17:20,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 01:17:20,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:17:20,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 01:17:20,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-11-07 01:17:20,818 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) [2021-11-07 01:17:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:17:21,042 INFO L93 Difference]: Finished difference Result 132 states and 213 transitions. [2021-11-07 01:17:21,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 01:17:21,043 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) Word has length 118 [2021-11-07 01:17:21,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:17:21,046 INFO L225 Difference]: With dead ends: 132 [2021-11-07 01:17:21,046 INFO L226 Difference]: Without dead ends: 118 [2021-11-07 01:17:21,046 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2021-11-07 01:17:21,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-07 01:17:21,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2021-11-07 01:17:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 73 states have internal predecessors, (81), 20 states have call successors, (20), 8 states have call predecessors, (20), 17 states have return successors, (59), 26 states have call predecessors, (59), 20 states have call successors, (59) [2021-11-07 01:17:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2021-11-07 01:17:21,072 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 118 [2021-11-07 01:17:21,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:17:21,073 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2021-11-07 01:17:21,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 10 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (21), 11 states have call predecessors, (21), 10 states have call successors, (21) [2021-11-07 01:17:21,073 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2021-11-07 01:17:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-11-07 01:17:21,079 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:17:21,080 INFO L513 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2021-11-07 01:17:21,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-07 01:17:21,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-07 01:17:21,303 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:17:21,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:17:21,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1687293718, now seen corresponding path program 3 times [2021-11-07 01:17:21,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:17:21,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204923673] [2021-11-07 01:17:21,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:21,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:17:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 76 proven. 209 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2021-11-07 01:17:21,462 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:17:21,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204923673] [2021-11-07 01:17:21,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204923673] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:17:21,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41949214] [2021-11-07 01:17:21,462 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 01:17:21,463 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:21,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:17:21,464 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:17:21,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-07 01:17:21,939 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 01:17:21,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:17:21,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 01:17:21,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:17:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 423 proven. 19 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2021-11-07 01:17:22,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:17:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 74 proven. 251 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2021-11-07 01:17:23,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41949214] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:17:23,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1655774873] [2021-11-07 01:17:23,568 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:17:23,568 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:17:23,568 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:17:23,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:17:23,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 17 [2021-11-07 01:17:23,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794992719] [2021-11-07 01:17:23,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:17:23,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:17:23,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:17:23,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:17:23,571 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 10 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (23), 6 states have call predecessors, (23), 10 states have call successors, (23) [2021-11-07 01:17:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:17:23,791 INFO L93 Difference]: Finished difference Result 213 states and 337 transitions. [2021-11-07 01:17:23,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 01:17:23,793 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 10 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (23), 6 states have call predecessors, (23), 10 states have call successors, (23) Word has length 187 [2021-11-07 01:17:23,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:17:23,795 INFO L225 Difference]: With dead ends: 213 [2021-11-07 01:17:23,795 INFO L226 Difference]: Without dead ends: 113 [2021-11-07 01:17:23,796 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 366 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2021-11-07 01:17:23,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-07 01:17:23,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-11-07 01:17:23,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 76 states have internal predecessors, (83), 20 states have call successors, (20), 9 states have call predecessors, (20), 18 states have return successors, (59), 27 states have call predecessors, (59), 20 states have call successors, (59) [2021-11-07 01:17:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2021-11-07 01:17:23,809 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 187 [2021-11-07 01:17:23,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:17:23,809 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2021-11-07 01:17:23,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 10 states have call successors, (20), 2 states have call predecessors, (20), 6 states have return successors, (23), 6 states have call predecessors, (23), 10 states have call successors, (23) [2021-11-07 01:17:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2021-11-07 01:17:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-07 01:17:23,813 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:17:23,813 INFO L513 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1] [2021-11-07 01:17:23,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-07 01:17:24,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-07 01:17:24,027 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:17:24,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:17:24,027 INFO L85 PathProgramCache]: Analyzing trace with hash 317371732, now seen corresponding path program 1 times [2021-11-07 01:17:24,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:17:24,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905047239] [2021-11-07 01:17:24,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:24,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:17:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 45 proven. 299 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2021-11-07 01:17:24,177 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:17:24,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905047239] [2021-11-07 01:17:24,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905047239] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:17:24,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80860902] [2021-11-07 01:17:24,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:24,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:24,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:17:24,179 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:17:24,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-07 01:17:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:24,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-07 01:17:24,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:17:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 45 proven. 299 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2021-11-07 01:17:25,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:17:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 943 backedges. 45 proven. 315 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2021-11-07 01:17:26,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80860902] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:17:26,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [358207289] [2021-11-07 01:17:26,558 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:17:26,558 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:17:26,558 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:17:26,559 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:17:26,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 18 [2021-11-07 01:17:26,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265956834] [2021-11-07 01:17:26,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-07 01:17:26,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:17:26,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-07 01:17:26,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-11-07 01:17:26,561 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) [2021-11-07 01:17:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:17:26,763 INFO L93 Difference]: Finished difference Result 142 states and 227 transitions. [2021-11-07 01:17:26,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 01:17:26,764 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) Word has length 188 [2021-11-07 01:17:26,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:17:26,768 INFO L225 Difference]: With dead ends: 142 [2021-11-07 01:17:26,768 INFO L226 Difference]: Without dead ends: 128 [2021-11-07 01:17:26,769 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2021-11-07 01:17:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-11-07 01:17:26,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 107. [2021-11-07 01:17:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 72 states have internal predecessors, (79), 20 states have call successors, (20), 9 states have call predecessors, (20), 16 states have return successors, (49), 25 states have call predecessors, (49), 20 states have call successors, (49) [2021-11-07 01:17:26,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 148 transitions. [2021-11-07 01:17:26,791 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 148 transitions. Word has length 188 [2021-11-07 01:17:26,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:17:26,792 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 148 transitions. [2021-11-07 01:17:26,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 15 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 7 states have call predecessors, (21), 15 states have call successors, (21) [2021-11-07 01:17:26,792 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 148 transitions. [2021-11-07 01:17:26,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-11-07 01:17:26,798 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:17:26,798 INFO L513 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 14, 12, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 5, 4, 3, 1, 1, 1, 1, 1, 1] [2021-11-07 01:17:26,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-07 01:17:27,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-07 01:17:27,012 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:17:27,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:17:27,012 INFO L85 PathProgramCache]: Analyzing trace with hash 384777542, now seen corresponding path program 4 times [2021-11-07 01:17:27,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:17:27,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423373960] [2021-11-07 01:17:27,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:27,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:17:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 279 proven. 371 refuted. 0 times theorem prover too weak. 919 trivial. 0 not checked. [2021-11-07 01:17:27,284 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:17:27,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423373960] [2021-11-07 01:17:27,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423373960] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:17:27,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90302979] [2021-11-07 01:17:27,285 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 01:17:27,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:27,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:17:27,287 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:17:27,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-07 01:17:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:27,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-07 01:17:27,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:17:28,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 85 proven. 439 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2021-11-07 01:17:28,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:17:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1569 backedges. 85 proven. 463 refuted. 0 times theorem prover too weak. 1021 trivial. 0 not checked. [2021-11-07 01:17:30,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90302979] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:17:30,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [696406036] [2021-11-07 01:17:30,425 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:17:30,425 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:17:30,426 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:17:30,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:17:30,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 17] total 32 [2021-11-07 01:17:30,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524472679] [2021-11-07 01:17:30,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-07 01:17:30,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:17:30,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-07 01:17:30,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2021-11-07 01:17:30,429 INFO L87 Difference]: Start difference. First operand 107 states and 148 transitions. Second operand has 32 states, 30 states have (on average 3.3) internal successors, (99), 32 states have internal predecessors, (99), 25 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (39), 16 states have call predecessors, (39), 25 states have call successors, (39) [2021-11-07 01:17:31,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:17:31,767 INFO L93 Difference]: Finished difference Result 300 states and 568 transitions. [2021-11-07 01:17:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-07 01:17:31,768 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 3.3) internal successors, (99), 32 states have internal predecessors, (99), 25 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (39), 16 states have call predecessors, (39), 25 states have call successors, (39) Word has length 239 [2021-11-07 01:17:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:17:31,771 INFO L225 Difference]: With dead ends: 300 [2021-11-07 01:17:31,771 INFO L226 Difference]: Without dead ends: 182 [2021-11-07 01:17:31,775 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=590, Invalid=3570, Unknown=0, NotChecked=0, Total=4160 [2021-11-07 01:17:31,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-11-07 01:17:31,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 148. [2021-11-07 01:17:31,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 101 states have (on average 1.099009900990099) internal successors, (111), 100 states have internal predecessors, (111), 28 states have call successors, (28), 17 states have call predecessors, (28), 18 states have return successors, (68), 30 states have call predecessors, (68), 28 states have call successors, (68) [2021-11-07 01:17:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 207 transitions. [2021-11-07 01:17:31,790 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 207 transitions. Word has length 239 [2021-11-07 01:17:31,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:17:31,791 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 207 transitions. [2021-11-07 01:17:31,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 3.3) internal successors, (99), 32 states have internal predecessors, (99), 25 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (39), 16 states have call predecessors, (39), 25 states have call successors, (39) [2021-11-07 01:17:31,791 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 207 transitions. [2021-11-07 01:17:31,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2021-11-07 01:17:31,815 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:17:31,816 INFO L513 BasicCegarLoop]: trace histogram [66, 66, 54, 53, 53, 39, 33, 33, 33, 33, 33, 33, 33, 28, 26, 26, 26, 26, 26, 26, 26, 14, 12, 6, 1, 1, 1, 1, 1, 1] [2021-11-07 01:17:31,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-07 01:17:32,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:32,031 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:17:32,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:17:32,032 INFO L85 PathProgramCache]: Analyzing trace with hash 480742356, now seen corresponding path program 5 times [2021-11-07 01:17:32,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:17:32,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662393815] [2021-11-07 01:17:32,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:32,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:17:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:32,492 INFO L134 CoverageAnalysis]: Checked inductivity of 19676 backedges. 279 proven. 1809 refuted. 0 times theorem prover too weak. 17588 trivial. 0 not checked. [2021-11-07 01:17:32,493 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:17:32,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662393815] [2021-11-07 01:17:32,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662393815] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:17:32,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248219597] [2021-11-07 01:17:32,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 01:17:32,494 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:32,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:17:32,495 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:17:32,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-07 01:17:33,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-07 01:17:33,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:17:33,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 01:17:33,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:17:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 19676 backedges. 1238 proven. 4 refuted. 0 times theorem prover too weak. 18434 trivial. 0 not checked. [2021-11-07 01:17:35,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:17:38,281 INFO L134 CoverageAnalysis]: Checked inductivity of 19676 backedges. 1238 proven. 4 refuted. 0 times theorem prover too weak. 18434 trivial. 0 not checked. [2021-11-07 01:17:38,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248219597] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:17:38,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [670115910] [2021-11-07 01:17:38,284 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:17:38,284 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:17:38,285 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:17:38,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:17:38,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2021-11-07 01:17:38,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162298093] [2021-11-07 01:17:38,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-07 01:17:38,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:17:38,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-07 01:17:38,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-11-07 01:17:38,289 INFO L87 Difference]: Start difference. First operand 148 states and 207 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 10 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2021-11-07 01:17:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:17:38,675 INFO L93 Difference]: Finished difference Result 351 states and 610 transitions. [2021-11-07 01:17:38,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 01:17:38,676 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 10 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 810 [2021-11-07 01:17:38,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:17:38,680 INFO L225 Difference]: With dead ends: 351 [2021-11-07 01:17:38,680 INFO L226 Difference]: Without dead ends: 202 [2021-11-07 01:17:38,682 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1647 GetRequests, 1617 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2021-11-07 01:17:38,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-07 01:17:38,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 182. [2021-11-07 01:17:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 123 states have (on average 1.0975609756097562) internal successors, (135), 121 states have internal predecessors, (135), 36 states have call successors, (36), 20 states have call predecessors, (36), 22 states have return successors, (123), 40 states have call predecessors, (123), 36 states have call successors, (123) [2021-11-07 01:17:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 294 transitions. [2021-11-07 01:17:38,709 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 294 transitions. Word has length 810 [2021-11-07 01:17:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:17:38,710 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 294 transitions. [2021-11-07 01:17:38,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 10 states have call successors, (15), 1 states have call predecessors, (15), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2021-11-07 01:17:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 294 transitions. [2021-11-07 01:17:38,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2021-11-07 01:17:38,722 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:17:38,722 INFO L513 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 31, 26, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 14, 10, 8, 2, 1, 1, 1, 1, 1, 1] [2021-11-07 01:17:38,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-07 01:17:38,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:38,948 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:17:38,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:17:38,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1895528608, now seen corresponding path program 6 times [2021-11-07 01:17:38,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:17:38,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804501135] [2021-11-07 01:17:38,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:38,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:17:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6170 backedges. 332 proven. 971 refuted. 0 times theorem prover too weak. 4867 trivial. 0 not checked. [2021-11-07 01:17:39,244 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:17:39,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804501135] [2021-11-07 01:17:39,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804501135] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:17:39,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090494228] [2021-11-07 01:17:39,245 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 01:17:39,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:39,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:17:39,246 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:17:39,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-07 01:17:40,681 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 01:17:40,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:17:40,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-07 01:17:40,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:17:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6170 backedges. 1749 proven. 32 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2021-11-07 01:17:41,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:17:43,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6170 backedges. 259 proven. 1006 refuted. 0 times theorem prover too weak. 4905 trivial. 0 not checked. [2021-11-07 01:17:43,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090494228] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:17:43,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1897380359] [2021-11-07 01:17:43,855 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:17:43,855 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:17:43,855 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:17:43,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:17:43,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 25 [2021-11-07 01:17:43,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084736690] [2021-11-07 01:17:43,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-07 01:17:43,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:17:43,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-07 01:17:43,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2021-11-07 01:17:43,859 INFO L87 Difference]: Start difference. First operand 182 states and 294 transitions. Second operand has 25 states, 25 states have (on average 3.8) internal successors, (95), 25 states have internal predecessors, (95), 17 states have call successors, (30), 2 states have call predecessors, (30), 11 states have return successors, (37), 14 states have call predecessors, (37), 17 states have call successors, (37) [2021-11-07 01:17:44,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:17:44,576 INFO L93 Difference]: Finished difference Result 342 states and 581 transitions. [2021-11-07 01:17:44,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-07 01:17:44,577 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.8) internal successors, (95), 25 states have internal predecessors, (95), 17 states have call successors, (30), 2 states have call predecessors, (30), 11 states have return successors, (37), 14 states have call predecessors, (37), 17 states have call successors, (37) Word has length 462 [2021-11-07 01:17:44,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:17:44,579 INFO L225 Difference]: With dead ends: 342 [2021-11-07 01:17:44,579 INFO L226 Difference]: Without dead ends: 162 [2021-11-07 01:17:44,582 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 958 GetRequests, 914 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=1581, Unknown=0, NotChecked=0, Total=1892 [2021-11-07 01:17:44,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-11-07 01:17:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 157. [2021-11-07 01:17:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 110 states have (on average 1.0818181818181818) internal successors, (119), 105 states have internal predecessors, (119), 29 states have call successors, (29), 22 states have call predecessors, (29), 17 states have return successors, (59), 29 states have call predecessors, (59), 29 states have call successors, (59) [2021-11-07 01:17:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 207 transitions. [2021-11-07 01:17:44,596 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 207 transitions. Word has length 462 [2021-11-07 01:17:44,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:17:44,596 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 207 transitions. [2021-11-07 01:17:44,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.8) internal successors, (95), 25 states have internal predecessors, (95), 17 states have call successors, (30), 2 states have call predecessors, (30), 11 states have return successors, (37), 14 states have call predecessors, (37), 17 states have call successors, (37) [2021-11-07 01:17:44,597 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 207 transitions. [2021-11-07 01:17:44,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2021-11-07 01:17:44,601 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:17:44,601 INFO L513 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 30, 29, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 12, 11, 7, 7, 1, 1, 1, 1, 1, 1] [2021-11-07 01:17:44,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-07 01:17:44,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:44,825 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:17:44,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:17:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1957614995, now seen corresponding path program 7 times [2021-11-07 01:17:44,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:17:44,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832838079] [2021-11-07 01:17:44,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:44,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:17:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7249 backedges. 209 proven. 1230 refuted. 0 times theorem prover too weak. 5810 trivial. 0 not checked. [2021-11-07 01:17:45,125 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:17:45,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832838079] [2021-11-07 01:17:45,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832838079] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:17:45,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509081205] [2021-11-07 01:17:45,125 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 01:17:45,126 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:45,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:17:45,127 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:17:45,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-07 01:17:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:46,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-07 01:17:46,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:17:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7249 backedges. 209 proven. 1230 refuted. 0 times theorem prover too weak. 5810 trivial. 0 not checked. [2021-11-07 01:17:47,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:17:50,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7249 backedges. 209 proven. 1263 refuted. 0 times theorem prover too weak. 5777 trivial. 0 not checked. [2021-11-07 01:17:50,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509081205] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:17:50,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [819859479] [2021-11-07 01:17:50,793 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:17:50,793 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:17:50,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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:17:50,795 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:17:50,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 19] total 22 [2021-11-07 01:17:50,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507561041] [2021-11-07 01:17:50,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-07 01:17:50,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:17:50,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-07 01:17:50,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2021-11-07 01:17:50,813 INFO L87 Difference]: Start difference. First operand 157 states and 207 transitions. Second operand has 22 states, 20 states have (on average 3.7) internal successors, (74), 22 states have internal predecessors, (74), 19 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (27), 9 states have call predecessors, (27), 19 states have call successors, (27) [2021-11-07 01:17:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:17:51,088 INFO L93 Difference]: Finished difference Result 184 states and 262 transitions. [2021-11-07 01:17:51,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 01:17:51,088 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.7) internal successors, (74), 22 states have internal predecessors, (74), 19 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (27), 9 states have call predecessors, (27), 19 states have call successors, (27) Word has length 500 [2021-11-07 01:17:51,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:17:51,094 INFO L225 Difference]: With dead ends: 184 [2021-11-07 01:17:51,094 INFO L226 Difference]: Without dead ends: 170 [2021-11-07 01:17:51,097 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1025 GetRequests, 997 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2021-11-07 01:17:51,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-11-07 01:17:51,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 160. [2021-11-07 01:17:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 112 states have (on average 1.0803571428571428) internal successors, (121), 107 states have internal predecessors, (121), 29 states have call successors, (29), 22 states have call predecessors, (29), 18 states have return successors, (61), 30 states have call predecessors, (61), 29 states have call successors, (61) [2021-11-07 01:17:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 211 transitions. [2021-11-07 01:17:51,112 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 211 transitions. Word has length 500 [2021-11-07 01:17:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:17:51,114 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 211 transitions. [2021-11-07 01:17:51,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.7) internal successors, (74), 22 states have internal predecessors, (74), 19 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (27), 9 states have call predecessors, (27), 19 states have call successors, (27) [2021-11-07 01:17:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 211 transitions. [2021-11-07 01:17:51,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2021-11-07 01:17:51,120 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:17:51,120 INFO L513 BasicCegarLoop]: trace histogram [51, 51, 48, 48, 41, 39, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 17, 14, 10, 9, 1, 1, 1, 1, 1, 1] [2021-11-07 01:17:51,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-07 01:17:51,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:51,334 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:17:51,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:17:51,335 INFO L85 PathProgramCache]: Analyzing trace with hash -93142244, now seen corresponding path program 8 times [2021-11-07 01:17:51,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:17:51,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003127783] [2021-11-07 01:17:51,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:51,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:17:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:17:51,827 INFO L134 CoverageAnalysis]: Checked inductivity of 13477 backedges. 1308 proven. 1823 refuted. 0 times theorem prover too weak. 10346 trivial. 0 not checked. [2021-11-07 01:17:51,828 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:17:51,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003127783] [2021-11-07 01:17:51,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003127783] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:17:51,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938834891] [2021-11-07 01:17:51,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 01:17:51,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:17:51,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:17:51,830 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:17:51,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-07 01:17:53,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2021-11-07 01:17:53,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:17:53,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-07 01:17:53,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:17:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 13477 backedges. 1069 proven. 161 refuted. 0 times theorem prover too weak. 12247 trivial. 0 not checked. [2021-11-07 01:17:54,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:17:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 13477 backedges. 1069 proven. 173 refuted. 0 times theorem prover too weak. 12235 trivial. 0 not checked. [2021-11-07 01:17:57,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938834891] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:17:57,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [353046432] [2021-11-07 01:17:57,695 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:17:57,695 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:17:57,696 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:17:57,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:17:57,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10, 13] total 33 [2021-11-07 01:17:57,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674970073] [2021-11-07 01:17:57,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-07 01:17:57,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:17:57,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-07 01:17:57,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2021-11-07 01:17:57,701 INFO L87 Difference]: Start difference. First operand 160 states and 211 transitions. Second operand has 33 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 33 states have internal predecessors, (102), 22 states have call successors, (33), 1 states have call predecessors, (33), 18 states have return successors, (44), 24 states have call predecessors, (44), 22 states have call successors, (44) [2021-11-07 01:17:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:17:59,172 INFO L93 Difference]: Finished difference Result 390 states and 609 transitions. [2021-11-07 01:17:59,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-11-07 01:17:59,172 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 33 states have internal predecessors, (102), 22 states have call successors, (33), 1 states have call predecessors, (33), 18 states have return successors, (44), 24 states have call predecessors, (44), 22 states have call successors, (44) Word has length 677 [2021-11-07 01:17:59,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:17:59,177 INFO L225 Difference]: With dead ends: 390 [2021-11-07 01:17:59,177 INFO L226 Difference]: Without dead ends: 236 [2021-11-07 01:17:59,181 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1419 GetRequests, 1347 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=644, Invalid=4326, Unknown=0, NotChecked=0, Total=4970 [2021-11-07 01:17:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-11-07 01:17:59,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 200. [2021-11-07 01:17:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 135 states have internal predecessors, (152), 39 states have call successors, (39), 29 states have call predecessors, (39), 20 states have return successors, (88), 35 states have call predecessors, (88), 39 states have call successors, (88) [2021-11-07 01:17:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 279 transitions. [2021-11-07 01:17:59,204 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 279 transitions. Word has length 677 [2021-11-07 01:17:59,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:17:59,205 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 279 transitions. [2021-11-07 01:17:59,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 33 states have internal predecessors, (102), 22 states have call successors, (33), 1 states have call predecessors, (33), 18 states have return successors, (44), 24 states have call predecessors, (44), 22 states have call successors, (44) [2021-11-07 01:17:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 279 transitions. [2021-11-07 01:17:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1073 [2021-11-07 01:17:59,217 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:17:59,217 INFO L513 BasicCegarLoop]: trace histogram [81, 81, 76, 76, 65, 62, 40, 40, 40, 40, 40, 40, 40, 38, 38, 38, 38, 38, 38, 38, 27, 22, 16, 14, 1, 1, 1, 1, 1, 1] [2021-11-07 01:17:59,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-07 01:17:59,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-07 01:17:59,443 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:17:59,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:17:59,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1824353437, now seen corresponding path program 9 times [2021-11-07 01:17:59,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:17:59,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489927122] [2021-11-07 01:17:59,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:17:59,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:17:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:18:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 34263 backedges. 419 proven. 3305 refuted. 0 times theorem prover too weak. 30539 trivial. 0 not checked. [2021-11-07 01:18:00,045 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:18:00,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489927122] [2021-11-07 01:18:00,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489927122] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:18:00,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658035534] [2021-11-07 01:18:00,046 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 01:18:00,046 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:18:00,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:18:00,047 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:18:00,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-07 01:18:02,320 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 01:18:02,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:18:02,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 1907 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-07 01:18:02,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:18:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 34263 backedges. 18229 proven. 1897 refuted. 0 times theorem prover too weak. 14137 trivial. 0 not checked. [2021-11-07 01:18:04,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:18:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 34263 backedges. 1231 proven. 4923 refuted. 0 times theorem prover too weak. 28109 trivial. 0 not checked. [2021-11-07 01:18:11,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658035534] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:18:11,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [999398064] [2021-11-07 01:18:11,653 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:18:11,653 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:18:11,653 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:18:11,654 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:18:11,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 31] total 38 [2021-11-07 01:18:11,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941224462] [2021-11-07 01:18:11,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-07 01:18:11,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:18:11,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-07 01:18:11,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1262, Unknown=0, NotChecked=0, Total=1406 [2021-11-07 01:18:11,660 INFO L87 Difference]: Start difference. First operand 200 states and 279 transitions. Second operand has 38 states, 37 states have (on average 3.72972972972973) internal successors, (138), 38 states have internal predecessors, (138), 34 states have call successors, (42), 2 states have call predecessors, (42), 18 states have return successors, (54), 17 states have call predecessors, (54), 34 states have call successors, (54) [2021-11-07 01:18:13,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:18:13,407 INFO L93 Difference]: Finished difference Result 495 states and 814 transitions. [2021-11-07 01:18:13,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-11-07 01:18:13,408 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.72972972972973) internal successors, (138), 38 states have internal predecessors, (138), 34 states have call successors, (42), 2 states have call predecessors, (42), 18 states have return successors, (54), 17 states have call predecessors, (54), 34 states have call successors, (54) Word has length 1072 [2021-11-07 01:18:13,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:18:13,414 INFO L225 Difference]: With dead ends: 495 [2021-11-07 01:18:13,414 INFO L226 Difference]: Without dead ends: 287 [2021-11-07 01:18:13,419 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2202 GetRequests, 2125 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=845, Invalid=5007, Unknown=0, NotChecked=0, Total=5852 [2021-11-07 01:18:13,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-11-07 01:18:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 266. [2021-11-07 01:18:13,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 189 states have (on average 1.0687830687830688) internal successors, (202), 182 states have internal predecessors, (202), 54 states have call successors, (54), 44 states have call predecessors, (54), 22 states have return successors, (145), 39 states have call predecessors, (145), 54 states have call successors, (145) [2021-11-07 01:18:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 401 transitions. [2021-11-07 01:18:13,443 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 401 transitions. Word has length 1072 [2021-11-07 01:18:13,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:18:13,443 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 401 transitions. [2021-11-07 01:18:13,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.72972972972973) internal successors, (138), 38 states have internal predecessors, (138), 34 states have call successors, (42), 2 states have call predecessors, (42), 18 states have return successors, (54), 17 states have call predecessors, (54), 34 states have call successors, (54) [2021-11-07 01:18:13,444 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 401 transitions. [2021-11-07 01:18:13,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1196 [2021-11-07 01:18:13,457 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:18:13,458 INFO L513 BasicCegarLoop]: trace histogram [91, 91, 84, 84, 72, 70, 45, 45, 45, 45, 45, 45, 45, 42, 42, 42, 42, 42, 42, 42, 30, 25, 19, 14, 1, 1, 1, 1, 1, 1] [2021-11-07 01:18:13,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-07 01:18:13,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-07 01:18:13,671 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:18:13,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:18:13,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1737605894, now seen corresponding path program 10 times [2021-11-07 01:18:13,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:18:13,672 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520780057] [2021-11-07 01:18:13,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:18:13,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:18:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:18:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 42699 backedges. 936 proven. 3401 refuted. 0 times theorem prover too weak. 38362 trivial. 0 not checked. [2021-11-07 01:18:14,401 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:18:14,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520780057] [2021-11-07 01:18:14,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520780057] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:18:14,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418159640] [2021-11-07 01:18:14,402 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 01:18:14,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:18:14,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:18:14,404 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:18:14,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-07 01:18:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:18:17,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 2685 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-07 01:18:17,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:18:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 42699 backedges. 963 proven. 3660 refuted. 0 times theorem prover too weak. 38076 trivial. 0 not checked. [2021-11-07 01:18:19,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:18:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 42699 backedges. 967 proven. 3708 refuted. 0 times theorem prover too weak. 38024 trivial. 0 not checked. [2021-11-07 01:18:26,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418159640] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:18:26,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [376653788] [2021-11-07 01:18:26,343 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:18:26,343 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:18:26,343 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:18:26,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:18:26,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 23] total 28 [2021-11-07 01:18:26,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492490127] [2021-11-07 01:18:26,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-07 01:18:26,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:18:26,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-07 01:18:26,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2021-11-07 01:18:26,348 INFO L87 Difference]: Start difference. First operand 266 states and 401 transitions. Second operand has 28 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 28 states have internal predecessors, (90), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (35), 14 states have call predecessors, (35), 22 states have call successors, (35) [2021-11-07 01:18:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:18:26,819 INFO L93 Difference]: Finished difference Result 312 states and 524 transitions. [2021-11-07 01:18:26,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:18:26,820 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 28 states have internal predecessors, (90), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (35), 14 states have call predecessors, (35), 22 states have call successors, (35) Word has length 1195 [2021-11-07 01:18:26,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:18:26,826 INFO L225 Difference]: With dead ends: 312 [2021-11-07 01:18:26,826 INFO L226 Difference]: Without dead ends: 270 [2021-11-07 01:18:26,828 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2421 GetRequests, 2383 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2021-11-07 01:18:26,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-11-07 01:18:26,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 260. [2021-11-07 01:18:26,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 185 states have (on average 1.0702702702702702) internal successors, (198), 178 states have internal predecessors, (198), 52 states have call successors, (52), 43 states have call predecessors, (52), 22 states have return successors, (103), 38 states have call predecessors, (103), 52 states have call successors, (103) [2021-11-07 01:18:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 353 transitions. [2021-11-07 01:18:26,849 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 353 transitions. Word has length 1195 [2021-11-07 01:18:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:18:26,850 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 353 transitions. [2021-11-07 01:18:26,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 28 states have internal predecessors, (90), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (35), 14 states have call predecessors, (35), 22 states have call successors, (35) [2021-11-07 01:18:26,851 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 353 transitions. [2021-11-07 01:18:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1413 [2021-11-07 01:18:26,867 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:18:26,868 INFO L513 BasicCegarLoop]: trace histogram [107, 107, 100, 100, 84, 83, 53, 53, 53, 53, 53, 53, 53, 50, 50, 50, 50, 50, 50, 50, 33, 31, 24, 16, 1, 1, 1, 1, 1, 1] [2021-11-07 01:18:26,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-07 01:18:27,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:18:27,091 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:18:27,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:18:27,092 INFO L85 PathProgramCache]: Analyzing trace with hash -536441660, now seen corresponding path program 11 times [2021-11-07 01:18:27,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:18:27,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462370662] [2021-11-07 01:18:27,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:18:27,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:18:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:18:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 59785 backedges. 907 proven. 3504 refuted. 0 times theorem prover too weak. 55374 trivial. 0 not checked. [2021-11-07 01:18:27,749 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:18:27,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462370662] [2021-11-07 01:18:27,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462370662] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:18:27,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165610165] [2021-11-07 01:18:27,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 01:18:27,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:18:27,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:18:27,751 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:18:27,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-07 01:18:31,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2021-11-07 01:18:31,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:18:31,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-07 01:18:31,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:18:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 59785 backedges. 4403 proven. 340 refuted. 0 times theorem prover too weak. 55042 trivial. 0 not checked. [2021-11-07 01:18:34,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:18:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 59785 backedges. 4403 proven. 350 refuted. 0 times theorem prover too weak. 55032 trivial. 0 not checked. [2021-11-07 01:18:39,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165610165] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:18:39,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1906067516] [2021-11-07 01:18:39,923 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:18:39,923 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:18:39,923 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:18:39,923 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:18:39,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 19] total 31 [2021-11-07 01:18:39,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523115117] [2021-11-07 01:18:39,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-07 01:18:39,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:18:39,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-07 01:18:39,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2021-11-07 01:18:39,928 INFO L87 Difference]: Start difference. First operand 260 states and 353 transitions. Second operand has 31 states, 30 states have (on average 3.566666666666667) internal successors, (107), 31 states have internal predecessors, (107), 20 states have call successors, (33), 1 states have call predecessors, (33), 17 states have return successors, (44), 24 states have call predecessors, (44), 20 states have call successors, (44) [2021-11-07 01:18:41,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:18:41,242 INFO L93 Difference]: Finished difference Result 615 states and 879 transitions. [2021-11-07 01:18:41,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-07 01:18:41,243 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.566666666666667) internal successors, (107), 31 states have internal predecessors, (107), 20 states have call successors, (33), 1 states have call predecessors, (33), 17 states have return successors, (44), 24 states have call predecessors, (44), 20 states have call successors, (44) Word has length 1412 [2021-11-07 01:18:41,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:18:41,249 INFO L225 Difference]: With dead ends: 615 [2021-11-07 01:18:41,249 INFO L226 Difference]: Without dead ends: 350 [2021-11-07 01:18:41,253 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2879 GetRequests, 2807 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=718, Invalid=3974, Unknown=0, NotChecked=0, Total=4692 [2021-11-07 01:18:41,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-11-07 01:18:41,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 298. [2021-11-07 01:18:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 213 states have (on average 1.0751173708920188) internal successors, (229), 205 states have internal predecessors, (229), 61 states have call successors, (61), 51 states have call predecessors, (61), 23 states have return successors, (109), 41 states have call predecessors, (109), 61 states have call successors, (109) [2021-11-07 01:18:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 399 transitions. [2021-11-07 01:18:41,279 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 399 transitions. Word has length 1412 [2021-11-07 01:18:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:18:41,280 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 399 transitions. [2021-11-07 01:18:41,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.566666666666667) internal successors, (107), 31 states have internal predecessors, (107), 20 states have call successors, (33), 1 states have call predecessors, (33), 17 states have return successors, (44), 24 states have call predecessors, (44), 20 states have call successors, (44) [2021-11-07 01:18:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 399 transitions. [2021-11-07 01:18:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1005 [2021-11-07 01:18:41,293 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:18:41,293 INFO L513 BasicCegarLoop]: trace histogram [77, 77, 70, 70, 60, 59, 38, 38, 38, 38, 38, 38, 38, 35, 35, 35, 35, 35, 35, 35, 25, 21, 17, 11, 1, 1, 1, 1, 1, 1] [2021-11-07 01:18:41,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-07 01:18:41,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-07 01:18:41,519 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:18:41,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:18:41,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1658567862, now seen corresponding path program 12 times [2021-11-07 01:18:41,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:18:41,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016084309] [2021-11-07 01:18:41,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:18:41,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:18:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:18:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 30037 backedges. 990 proven. 2089 refuted. 0 times theorem prover too weak. 26958 trivial. 0 not checked. [2021-11-07 01:18:42,021 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:18:42,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016084309] [2021-11-07 01:18:42,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016084309] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:18:42,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387253384] [2021-11-07 01:18:42,022 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 01:18:42,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:18:42,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:18:42,023 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:18:42,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-07 01:18:46,382 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 01:18:46,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:18:46,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 1786 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-07 01:18:46,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:18:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 30037 backedges. 15170 proven. 926 refuted. 0 times theorem prover too weak. 13941 trivial. 0 not checked. [2021-11-07 01:18:48,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:18:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 30037 backedges. 1073 proven. 4103 refuted. 0 times theorem prover too weak. 24861 trivial. 0 not checked. [2021-11-07 01:18:54,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387253384] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:18:54,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [783105781] [2021-11-07 01:18:54,694 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:18:54,694 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:18:54,694 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:18:54,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:18:54,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 27] total 35 [2021-11-07 01:18:54,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306730371] [2021-11-07 01:18:54,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-07 01:18:54,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:18:54,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-07 01:18:54,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1063, Unknown=0, NotChecked=0, Total=1190 [2021-11-07 01:18:54,699 INFO L87 Difference]: Start difference. First operand 298 states and 399 transitions. Second operand has 35 states, 34 states have (on average 3.7941176470588234) internal successors, (129), 35 states have internal predecessors, (129), 30 states have call successors, (40), 2 states have call predecessors, (40), 17 states have return successors, (52), 17 states have call predecessors, (52), 30 states have call successors, (52) [2021-11-07 01:18:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:18:56,128 INFO L93 Difference]: Finished difference Result 547 states and 766 transitions. [2021-11-07 01:18:56,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-11-07 01:18:56,128 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.7941176470588234) internal successors, (129), 35 states have internal predecessors, (129), 30 states have call successors, (40), 2 states have call predecessors, (40), 17 states have return successors, (52), 17 states have call predecessors, (52), 30 states have call successors, (52) Word has length 1004 [2021-11-07 01:18:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:18:56,132 INFO L225 Difference]: With dead ends: 547 [2021-11-07 01:18:56,132 INFO L226 Difference]: Without dead ends: 273 [2021-11-07 01:18:56,136 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2068 GetRequests, 1990 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=850, Invalid=5156, Unknown=0, NotChecked=0, Total=6006 [2021-11-07 01:18:56,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-11-07 01:18:56,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 235. [2021-11-07 01:18:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 166 states have (on average 1.0542168674698795) internal successors, (175), 160 states have internal predecessors, (175), 47 states have call successors, (47), 37 states have call predecessors, (47), 21 states have return successors, (74), 37 states have call predecessors, (74), 47 states have call successors, (74) [2021-11-07 01:18:56,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 296 transitions. [2021-11-07 01:18:56,156 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 296 transitions. Word has length 1004 [2021-11-07 01:18:56,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:18:56,157 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 296 transitions. [2021-11-07 01:18:56,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.7941176470588234) internal successors, (129), 35 states have internal predecessors, (129), 30 states have call successors, (40), 2 states have call predecessors, (40), 17 states have return successors, (52), 17 states have call predecessors, (52), 30 states have call successors, (52) [2021-11-07 01:18:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 296 transitions. [2021-11-07 01:18:56,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1468 [2021-11-07 01:18:56,175 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:18:56,175 INFO L513 BasicCegarLoop]: trace histogram [108, 108, 107, 107, 88, 86, 54, 54, 54, 54, 54, 54, 54, 53, 53, 53, 53, 53, 53, 53, 35, 32, 21, 20, 1, 1, 1, 1, 1, 1] [2021-11-07 01:18:56,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-07 01:18:56,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-07 01:18:56,399 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:18:56,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:18:56,399 INFO L85 PathProgramCache]: Analyzing trace with hash 119759346, now seen corresponding path program 13 times [2021-11-07 01:18:56,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:18:56,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617882357] [2021-11-07 01:18:56,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:18:56,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:18:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:18:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 64515 backedges. 1441 proven. 3358 refuted. 0 times theorem prover too weak. 59716 trivial. 0 not checked. [2021-11-07 01:18:57,191 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:18:57,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617882357] [2021-11-07 01:18:57,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617882357] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:18:57,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234015612] [2021-11-07 01:18:57,192 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 01:18:57,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:18:57,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:18:57,199 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:18:57,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-07 01:19:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:19:02,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 3289 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-07 01:19:02,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:19:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 64515 backedges. 1633 proven. 4118 refuted. 0 times theorem prover too weak. 58764 trivial. 0 not checked. [2021-11-07 01:19:04,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:19:12,517 INFO L134 CoverageAnalysis]: Checked inductivity of 64515 backedges. 1635 proven. 4168 refuted. 0 times theorem prover too weak. 58712 trivial. 0 not checked. [2021-11-07 01:19:12,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234015612] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:19:12,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1419623958] [2021-11-07 01:19:12,520 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:19:12,520 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:19:12,520 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:19:12,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:19:12,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 23] total 29 [2021-11-07 01:19:12,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484336318] [2021-11-07 01:19:12,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-07 01:19:12,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:19:12,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-07 01:19:12,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2021-11-07 01:19:12,526 INFO L87 Difference]: Start difference. First operand 235 states and 296 transitions. Second operand has 29 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 29 states have internal predecessors, (92), 22 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (36), 15 states have call predecessors, (36), 22 states have call successors, (36) [2021-11-07 01:19:12,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:19:12,865 INFO L93 Difference]: Finished difference Result 257 states and 331 transitions. [2021-11-07 01:19:12,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:19:12,866 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 29 states have internal predecessors, (92), 22 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (36), 15 states have call predecessors, (36), 22 states have call successors, (36) Word has length 1467 [2021-11-07 01:19:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:19:12,870 INFO L225 Difference]: With dead ends: 257 [2021-11-07 01:19:12,870 INFO L226 Difference]: Without dead ends: 235 [2021-11-07 01:19:12,872 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2963 GetRequests, 2924 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=1192, Unknown=0, NotChecked=0, Total=1482 [2021-11-07 01:19:12,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-11-07 01:19:12,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2021-11-07 01:19:12,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 166 states have (on average 1.0542168674698795) internal successors, (175), 160 states have internal predecessors, (175), 47 states have call successors, (47), 37 states have call predecessors, (47), 21 states have return successors, (71), 37 states have call predecessors, (71), 47 states have call successors, (71) [2021-11-07 01:19:12,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 293 transitions. [2021-11-07 01:19:12,890 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 293 transitions. Word has length 1467 [2021-11-07 01:19:12,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:19:12,891 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 293 transitions. [2021-11-07 01:19:12,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 29 states have internal predecessors, (92), 22 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (36), 15 states have call predecessors, (36), 22 states have call successors, (36) [2021-11-07 01:19:12,891 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 293 transitions. [2021-11-07 01:19:12,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1427 [2021-11-07 01:19:12,939 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:19:12,940 INFO L513 BasicCegarLoop]: trace histogram [105, 105, 104, 104, 85, 84, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 33, 32, 20, 20, 1, 1, 1, 1, 1, 1] [2021-11-07 01:19:12,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-07 01:19:13,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-07 01:19:13,156 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:19:13,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:19:13,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1110263143, now seen corresponding path program 14 times [2021-11-07 01:19:13,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:19:13,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256483054] [2021-11-07 01:19:13,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:19:13,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:19:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:19:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 60928 backedges. 1409 proven. 2489 refuted. 0 times theorem prover too weak. 57030 trivial. 0 not checked. [2021-11-07 01:19:13,767 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:19:13,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256483054] [2021-11-07 01:19:13,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256483054] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:19:13,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271237556] [2021-11-07 01:19:13,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 01:19:13,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:19:13,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:19:13,769 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:19:13,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-07 01:19:19,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2021-11-07 01:19:19,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:19:19,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 1819 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-07 01:19:19,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:19:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 60928 backedges. 3411 proven. 488 refuted. 0 times theorem prover too weak. 57029 trivial. 0 not checked. [2021-11-07 01:19:22,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:19:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 60928 backedges. 3411 proven. 513 refuted. 0 times theorem prover too weak. 57004 trivial. 0 not checked. [2021-11-07 01:19:27,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271237556] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:19:27,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1375296426] [2021-11-07 01:19:27,987 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:19:27,987 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:19:27,987 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:19:27,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:19:27,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 29 [2021-11-07 01:19:27,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184991290] [2021-11-07 01:19:27,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-07 01:19:27,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:19:27,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-07 01:19:27,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2021-11-07 01:19:27,992 INFO L87 Difference]: Start difference. First operand 235 states and 293 transitions. Second operand has 29 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 29 states have internal predecessors, (95), 19 states have call successors, (29), 1 states have call predecessors, (29), 15 states have return successors, (37), 21 states have call predecessors, (37), 19 states have call successors, (37) [2021-11-07 01:19:28,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:19:28,971 INFO L93 Difference]: Finished difference Result 483 states and 609 transitions. [2021-11-07 01:19:28,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-07 01:19:28,971 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 29 states have internal predecessors, (95), 19 states have call successors, (29), 1 states have call predecessors, (29), 15 states have return successors, (37), 21 states have call predecessors, (37), 19 states have call successors, (37) Word has length 1426 [2021-11-07 01:19:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:19:28,975 INFO L225 Difference]: With dead ends: 483 [2021-11-07 01:19:28,975 INFO L226 Difference]: Without dead ends: 267 [2021-11-07 01:19:28,978 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2897 GetRequests, 2838 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=513, Invalid=2909, Unknown=0, NotChecked=0, Total=3422 [2021-11-07 01:19:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-11-07 01:19:28,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 221. [2021-11-07 01:19:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 156 states have (on average 1.0576923076923077) internal successors, (165), 151 states have internal predecessors, (165), 44 states have call successors, (44), 35 states have call predecessors, (44), 20 states have return successors, (57), 34 states have call predecessors, (57), 44 states have call successors, (57) [2021-11-07 01:19:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 266 transitions. [2021-11-07 01:19:28,995 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 266 transitions. Word has length 1426 [2021-11-07 01:19:28,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:19:28,996 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 266 transitions. [2021-11-07 01:19:28,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 29 states have internal predecessors, (95), 19 states have call successors, (29), 1 states have call predecessors, (29), 15 states have return successors, (37), 21 states have call predecessors, (37), 19 states have call successors, (37) [2021-11-07 01:19:28,996 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 266 transitions. [2021-11-07 01:19:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1563 [2021-11-07 01:19:29,015 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:19:29,016 INFO L513 BasicCegarLoop]: trace histogram [116, 116, 113, 113, 93, 92, 58, 58, 58, 58, 58, 58, 58, 56, 56, 56, 56, 56, 56, 56, 37, 34, 23, 21, 1, 1, 1, 1, 1, 1] [2021-11-07 01:19:29,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-07 01:19:29,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-07 01:19:29,243 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:19:29,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:19:29,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1183225277, now seen corresponding path program 15 times [2021-11-07 01:19:29,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:19:29,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648507154] [2021-11-07 01:19:29,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:19:29,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:19:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:19:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 73228 backedges. 1946 proven. 3179 refuted. 0 times theorem prover too weak. 68103 trivial. 0 not checked. [2021-11-07 01:19:30,140 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:19:30,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648507154] [2021-11-07 01:19:30,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648507154] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:19:30,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118336358] [2021-11-07 01:19:30,140 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-07 01:19:30,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:19:30,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:19:30,142 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:19:30,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-07 01:19:36,458 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-07 01:19:36,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 01:19:36,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 2779 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-07 01:19:36,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:19:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 73228 backedges. 37542 proven. 3730 refuted. 0 times theorem prover too weak. 31956 trivial. 0 not checked. [2021-11-07 01:19:39,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:19:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 73228 backedges. 2254 proven. 8122 refuted. 0 times theorem prover too weak. 62852 trivial. 0 not checked. [2021-11-07 01:19:49,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118336358] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:19:49,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1141544760] [2021-11-07 01:19:49,768 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:19:49,768 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:19:49,768 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:19:49,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:19:49,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23, 35] total 46 [2021-11-07 01:19:49,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963666541] [2021-11-07 01:19:49,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-11-07 01:19:49,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:19:49,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-11-07 01:19:49,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1861, Unknown=0, NotChecked=0, Total=2070 [2021-11-07 01:19:49,777 INFO L87 Difference]: Start difference. First operand 221 states and 266 transitions. Second operand has 46 states, 45 states have (on average 3.488888888888889) internal successors, (157), 46 states have internal predecessors, (157), 38 states have call successors, (49), 2 states have call predecessors, (49), 21 states have return successors, (64), 23 states have call predecessors, (64), 38 states have call successors, (64) [2021-11-07 01:19:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:19:51,566 INFO L93 Difference]: Finished difference Result 453 states and 568 transitions. [2021-11-07 01:19:51,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-11-07 01:19:51,571 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.488888888888889) internal successors, (157), 46 states have internal predecessors, (157), 38 states have call successors, (49), 2 states have call predecessors, (49), 21 states have return successors, (64), 23 states have call predecessors, (64), 38 states have call successors, (64) Word has length 1562 [2021-11-07 01:19:51,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:19:51,576 INFO L225 Difference]: With dead ends: 453 [2021-11-07 01:19:51,576 INFO L226 Difference]: Without dead ends: 254 [2021-11-07 01:19:51,580 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3188 GetRequests, 3097 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1940 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1112, Invalid=7078, Unknown=0, NotChecked=0, Total=8190 [2021-11-07 01:19:51,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-11-07 01:19:51,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2021-11-07 01:19:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 171 states have (on average 1.0584795321637428) internal successors, (181), 165 states have internal predecessors, (181), 48 states have call successors, (48), 40 states have call predecessors, (48), 20 states have return successors, (62), 34 states have call predecessors, (62), 48 states have call successors, (62) [2021-11-07 01:19:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 291 transitions. [2021-11-07 01:19:51,599 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 291 transitions. Word has length 1562 [2021-11-07 01:19:51,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:19:51,600 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 291 transitions. [2021-11-07 01:19:51,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.488888888888889) internal successors, (157), 46 states have internal predecessors, (157), 38 states have call successors, (49), 2 states have call predecessors, (49), 21 states have return successors, (64), 23 states have call predecessors, (64), 38 states have call successors, (64) [2021-11-07 01:19:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 291 transitions. [2021-11-07 01:19:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1386 [2021-11-07 01:19:51,616 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:19:51,617 INFO L513 BasicCegarLoop]: trace histogram [102, 102, 101, 101, 82, 82, 51, 51, 51, 51, 51, 51, 51, 50, 50, 50, 50, 50, 50, 50, 32, 31, 20, 19, 1, 1, 1, 1, 1, 1] [2021-11-07 01:19:51,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-07 01:19:51,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:19:51,843 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:19:51,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:19:51,844 INFO L85 PathProgramCache]: Analyzing trace with hash -804575120, now seen corresponding path program 16 times [2021-11-07 01:19:51,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:19:51,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651789779] [2021-11-07 01:19:51,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:19:51,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:19:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:19:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 57446 backedges. 2894 proven. 1625 refuted. 0 times theorem prover too weak. 52927 trivial. 0 not checked. [2021-11-07 01:19:52,581 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:19:52,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651789779] [2021-11-07 01:19:52,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651789779] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:19:52,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422909140] [2021-11-07 01:19:52,582 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-07 01:19:52,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:19:52,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:19:52,583 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:19:52,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-07 01:19:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:19:59,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 3107 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-07 01:19:59,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:20:02,516 INFO L134 CoverageAnalysis]: Checked inductivity of 57446 backedges. 3413 proven. 2000 refuted. 0 times theorem prover too weak. 52033 trivial. 0 not checked. [2021-11-07 01:20:02,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:20:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 57446 backedges. 3413 proven. 2052 refuted. 0 times theorem prover too weak. 51981 trivial. 0 not checked. [2021-11-07 01:20:10,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422909140] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:20:10,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [100855986] [2021-11-07 01:20:10,035 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-11-07 01:20:10,035 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:20:10,036 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2021-11-07 01:20:10,037 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:20:10,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 23] total 29 [2021-11-07 01:20:10,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598977800] [2021-11-07 01:20:10,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-07 01:20:10,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:20:10,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-07 01:20:10,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2021-11-07 01:20:10,042 INFO L87 Difference]: Start difference. First operand 240 states and 291 transitions. Second operand has 29 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 29 states have internal predecessors, (92), 22 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (36), 15 states have call predecessors, (36), 22 states have call successors, (36) [2021-11-07 01:20:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:20:10,381 INFO L93 Difference]: Finished difference Result 250 states and 300 transitions. [2021-11-07 01:20:10,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 01:20:10,382 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 29 states have internal predecessors, (92), 22 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (36), 15 states have call predecessors, (36), 22 states have call successors, (36) Word has length 1385 [2021-11-07 01:20:10,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:20:10,385 INFO L225 Difference]: With dead ends: 250 [2021-11-07 01:20:10,385 INFO L226 Difference]: Without dead ends: 238 [2021-11-07 01:20:10,385 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2799 GetRequests, 2760 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=1192, Unknown=0, NotChecked=0, Total=1482 [2021-11-07 01:20:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-11-07 01:20:10,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2021-11-07 01:20:10,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 170 states have (on average 1.0588235294117647) internal successors, (180), 163 states have internal predecessors, (180), 46 states have call successors, (46), 40 states have call predecessors, (46), 20 states have return successors, (50), 33 states have call predecessors, (50), 46 states have call successors, (50) [2021-11-07 01:20:10,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 276 transitions. [2021-11-07 01:20:10,403 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 276 transitions. Word has length 1385 [2021-11-07 01:20:10,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:20:10,404 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 276 transitions. [2021-11-07 01:20:10,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 29 states have internal predecessors, (92), 22 states have call successors, (28), 1 states have call predecessors, (28), 12 states have return successors, (36), 15 states have call predecessors, (36), 22 states have call successors, (36) [2021-11-07 01:20:10,404 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 276 transitions. [2021-11-07 01:20:10,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2021-11-07 01:20:10,417 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:20:10,418 INFO L513 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1] [2021-11-07 01:20:10,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-07 01:20:10,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:20:10,639 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 01:20:10,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:20:10,640 INFO L85 PathProgramCache]: Analyzing trace with hash 529873829, now seen corresponding path program 17 times [2021-11-07 01:20:10,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:20:10,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564391569] [2021-11-07 01:20:10,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:20:10,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:20:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:20:11,164 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 01:20:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:20:12,120 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 01:20:12,120 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 01:20:12,121 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:20:12,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-07 01:20:12,126 INFO L731 BasicCegarLoop]: Path program histogram: [17, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:20:12,137 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:20:12,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:20:12 BoogieIcfgContainer [2021-11-07 01:20:12,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:20:12,428 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:20:12,428 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:20:12,428 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:20:12,428 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:17:07" (3/4) ... [2021-11-07 01:20:12,430 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 01:20:12,704 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 01:20:12,704 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:20:12,705 INFO L168 Benchmark]: Toolchain (without parser) took 186378.38 ms. Allocated memory was 86.0 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 46.4 MB in the beginning and 308.3 MB in the end (delta: -261.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 16.1 GB. [2021-11-07 01:20:12,706 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 86.0 MB. Free memory is still 63.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:20:12,706 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.30 ms. Allocated memory was 86.0 MB in the beginning and 117.4 MB in the end (delta: 31.5 MB). Free memory was 46.2 MB in the beginning and 93.9 MB in the end (delta: -47.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-07 01:20:12,707 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.83 ms. Allocated memory is still 117.4 MB. Free memory was 93.5 MB in the beginning and 92.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:20:12,707 INFO L168 Benchmark]: Boogie Preprocessor took 18.72 ms. Allocated memory is still 117.4 MB. Free memory was 92.2 MB in the beginning and 91.3 MB in the end (delta: 887.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:20:12,708 INFO L168 Benchmark]: RCFGBuilder took 393.14 ms. Allocated memory is still 117.4 MB. Free memory was 91.3 MB in the beginning and 80.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:20:12,708 INFO L168 Benchmark]: TraceAbstraction took 185408.57 ms. Allocated memory was 117.4 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 80.0 MB in the beginning and 358.9 MB in the end (delta: -278.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 16.1 GB. [2021-11-07 01:20:12,708 INFO L168 Benchmark]: Witness Printer took 276.69 ms. Allocated memory is still 1.6 GB. Free memory was 358.9 MB in the beginning and 308.3 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.1 GB. [2021-11-07 01:20:12,715 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 86.0 MB. Free memory is still 63.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 241.30 ms. Allocated memory was 86.0 MB in the beginning and 117.4 MB in the end (delta: 31.5 MB). Free memory was 46.2 MB in the beginning and 93.9 MB in the end (delta: -47.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 30.83 ms. Allocated memory is still 117.4 MB. Free memory was 93.5 MB in the beginning and 92.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 18.72 ms. Allocated memory is still 117.4 MB. Free memory was 92.2 MB in the beginning and 91.3 MB in the end (delta: 887.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 393.14 ms. Allocated memory is still 117.4 MB. Free memory was 91.3 MB in the beginning and 80.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 185408.57 ms. Allocated memory was 117.4 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 80.0 MB in the beginning and 358.9 MB in the end (delta: -278.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 16.1 GB. * Witness Printer took 276.69 ms. Allocated memory is still 1.6 GB. Free memory was 358.9 MB in the beginning and 308.3 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.3 MB. Max. memory is 16.1 GB. * 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 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 10; [L39] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L10] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L12] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L20] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L22] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L20] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L22] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) [L39] int result = fibo1(x); [L40] COND TRUE result == 55 [L41] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 185.0s, OverallIterations: 25, TraceHistogramMax: 116, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.2s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 796 SDtfs, 2819 SDslu, 7473 SDs, 0 SdLazy, 14293 SolverSat, 3501 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28880 GetRequests, 27914 SyntacticMatches, 44 SemanticMatches, 922 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10971 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=298occurred in iteration=19, InterpolantAutomatonStates: 607, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 390 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 111.0s InterpolantComputationTime, 29339 NumberOfCodeBlocks, 25739 NumberOfCodeBlocksAsserted, 141 NumberOfCheckSat, 42119 ConstructedInterpolants, 0 QuantifiedInterpolants, 50579 SizeOfPredicates, 151 NumberOfNonLiveVariables, 23276 ConjunctsInSsa, 344 ConjunctsInUnsatCore, 68 InterpolantComputations, 2 PerfectInterpolantSequences, 1340419/1421754 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: OVERALL_TIME[ms]: 458, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 15, DAG_INTERPRETER_EARLY_EXITS: 6, TOOLS_POST_APPLICATIONS: 13, TOOLS_POST_TIME[ms]: 210, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME[ms]: 88, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME[ms]: 42, TOOLS_QUANTIFIERELIM_APPLICATIONS: 27, TOOLS_QUANTIFIERELIM_TIME[ms]: 322, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 204, FLUID_QUERY_TIME[ms]: 3, FLUID_QUERIES: 35, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME[ms]: 30, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME[ms]: 0, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME[ms]: 0, DOMAIN_ISBOTTOM_APPLICATIONS: 15, DOMAIN_ISBOTTOM_TIME[ms]: 30, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 0, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 6, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME[ms]: 88, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 88, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 4, PATH_EXPR_TIME[ms]: 3, REGEX_TO_DAG_TIME[ms]: 4, DAG_COMPRESSION_TIME[ms]: 16, DAG_COMPRESSION_PROCESSED_NODES: 142, DAG_COMPRESSION_RETAINED_NODES: 53, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-07 01:20:12,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_017dcf32-3bf9-4f9e-89fc-9a4b452098cc/bin/utaipan-UUZaoUuFF8/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE