./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci04.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d3562c726fb0df5872bc6ae08c11ec0d40862c19 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:24:23,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:24:23,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:24:23,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:24:23,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:24:23,560 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:24:23,561 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:24:23,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:24:23,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:24:23,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:24:23,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:24:23,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:24:23,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:24:23,568 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:24:23,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:24:23,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:24:23,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:24:23,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:24:23,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:24:23,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:24:23,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:24:23,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:24:23,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:24:23,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:24:23,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:24:23,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:24:23,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:24:23,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:24:23,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:24:23,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:24:23,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:24:23,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:24:23,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:24:23,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:24:23,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:24:23,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:24:23,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:24:23,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:24:23,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:24:23,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:24:23,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:24:23,589 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:24:23,602 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:24:23,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:24:23,602 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:24:23,603 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:24:23,603 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:24:23,603 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:24:23,603 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:24:23,603 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:24:23,603 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:24:23,603 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:24:23,603 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:24:23,604 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:24:23,604 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:24:23,604 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:24:23,604 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:24:23,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:24:23,605 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:24:23,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:24:23,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:24:23,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:24:23,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:24:23,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:24:23,605 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:24:23,605 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:24:23,606 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:24:23,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:24:23,606 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:24:23,606 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:24:23,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:24:23,606 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:24:23,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:24:23,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:24:23,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:24:23,607 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:24:23,607 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:24:23,607 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:24:23,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:24:23,607 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:24:23,607 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:24:23,607 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:24:23,607 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/bin/utaipan 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(__VERIFIER_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 -> d3562c726fb0df5872bc6ae08c11ec0d40862c19 [2019-12-07 16:24:23,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:24:23,723 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:24:23,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:24:23,726 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:24:23,727 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:24:23,727 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/bin/utaipan/../../sv-benchmarks/c/recursive/Fibonacci04.c [2019-12-07 16:24:23,771 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/bin/utaipan/data/f86e6ad25/92b58783535c469b8f087b5f5594f1b8/FLAG438cd22e3 [2019-12-07 16:24:24,177 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:24:24,177 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/sv-benchmarks/c/recursive/Fibonacci04.c [2019-12-07 16:24:24,181 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/bin/utaipan/data/f86e6ad25/92b58783535c469b8f087b5f5594f1b8/FLAG438cd22e3 [2019-12-07 16:24:24,190 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/bin/utaipan/data/f86e6ad25/92b58783535c469b8f087b5f5594f1b8 [2019-12-07 16:24:24,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:24:24,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:24:24,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:24:24,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:24:24,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:24:24,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:24:24" (1/1) ... [2019-12-07 16:24:24,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aa27ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:24:24, skipping insertion in model container [2019-12-07 16:24:24,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:24:24" (1/1) ... [2019-12-07 16:24:24,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:24:24,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:24:24,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:24:24,312 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:24:24,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:24:24,362 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:24:24,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:24:24 WrapperNode [2019-12-07 16:24:24,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:24:24,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:24:24,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:24:24,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:24:24,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:24:24" (1/1) ... [2019-12-07 16:24:24,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:24:24" (1/1) ... [2019-12-07 16:24:24,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:24:24,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:24:24,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:24:24,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:24:24,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:24:24" (1/1) ... [2019-12-07 16:24:24,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:24:24" (1/1) ... [2019-12-07 16:24:24,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:24:24" (1/1) ... [2019-12-07 16:24:24,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:24:24" (1/1) ... [2019-12-07 16:24:24,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:24:24" (1/1) ... [2019-12-07 16:24:24,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:24:24" (1/1) ... [2019-12-07 16:24:24,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:24:24" (1/1) ... [2019-12-07 16:24:24,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:24:24,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:24:24,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:24:24,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:24:24,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:24:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:24:24,437 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-12-07 16:24:24,438 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-12-07 16:24:24,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:24:24,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:24:24,553 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:24:24,553 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 16:24:24,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:24:24 BoogieIcfgContainer [2019-12-07 16:24:24,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:24:24,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:24:24,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:24:24,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:24:24,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:24:24" (1/3) ... [2019-12-07 16:24:24,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e81f32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:24:24, skipping insertion in model container [2019-12-07 16:24:24,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:24:24" (2/3) ... [2019-12-07 16:24:24,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e81f32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:24:24, skipping insertion in model container [2019-12-07 16:24:24,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:24:24" (3/3) ... [2019-12-07 16:24:24,560 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2019-12-07 16:24:24,568 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:24:24,574 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:24:24,584 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:24:24,603 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:24:24,603 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:24:24,603 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:24:24,604 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:24:24,604 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:24:24,604 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:24:24,604 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:24:24,604 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:24:24,618 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-12-07 16:24:24,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:24:24,623 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:24:24,623 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:24:24,623 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:24:24,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:24:24,628 INFO L82 PathProgramCache]: Analyzing trace with hash 238562696, now seen corresponding path program 1 times [2019-12-07 16:24:24,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:24:24,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729880086] [2019-12-07 16:24:24,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:24:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:24:24,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729880086] [2019-12-07 16:24:24,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:24:24,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:24:24,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304547795] [2019-12-07 16:24:24,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:24:24,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:24:24,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:24:24,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:24:24,767 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2019-12-07 16:24:24,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:24:24,835 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-12-07 16:24:24,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:24:24,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 16:24:24,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:24:24,844 INFO L225 Difference]: With dead ends: 27 [2019-12-07 16:24:24,844 INFO L226 Difference]: Without dead ends: 17 [2019-12-07 16:24:24,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:24:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-12-07 16:24:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 16:24:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 16:24:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-12-07 16:24:24,877 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-12-07 16:24:24,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:24:24,878 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-12-07 16:24:24,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:24:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-12-07 16:24:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 16:24:24,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:24:24,879 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:24:24,879 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:24:24,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:24:24,880 INFO L82 PathProgramCache]: Analyzing trace with hash -497654578, now seen corresponding path program 1 times [2019-12-07 16:24:24,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:24:24,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236486934] [2019-12-07 16:24:24,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:24:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:24:24,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236486934] [2019-12-07 16:24:24,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:24:24,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:24:24,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484728912] [2019-12-07 16:24:24,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:24:24,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:24:24,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:24:24,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:24:24,912 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2019-12-07 16:24:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:24:24,950 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-12-07 16:24:24,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:24:24,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 16:24:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:24:24,951 INFO L225 Difference]: With dead ends: 23 [2019-12-07 16:24:24,951 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 16:24:24,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:24:24,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 16:24:24,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-12-07 16:24:24,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 16:24:24,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-12-07 16:24:24,956 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-12-07 16:24:24,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:24:24,956 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-12-07 16:24:24,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:24:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-12-07 16:24:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:24:24,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:24:24,957 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:24:24,957 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:24:24,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:24:24,957 INFO L82 PathProgramCache]: Analyzing trace with hash -850570499, now seen corresponding path program 1 times [2019-12-07 16:24:24,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:24:24,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492531754] [2019-12-07 16:24:24,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:24:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:25,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 16:24:25,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492531754] [2019-12-07 16:24:25,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162472269] [2019-12-07 16:24:25,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:24:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:25,032 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 16:24:25,037 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:24:25,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 16:24:25,063 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:24:25,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:24:25,174 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 16:24:25,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [243910596] [2019-12-07 16:24:25,189 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 16:24:25,190 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:24:25,193 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:24:25,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:24:25,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2019-12-07 16:24:25,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806717020] [2019-12-07 16:24:25,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:24:25,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:24:25,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:24:25,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:24:25,195 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 10 states. [2019-12-07 16:24:25,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:24:25,281 INFO L93 Difference]: Finished difference Result 35 states and 53 transitions. [2019-12-07 16:24:25,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:24:25,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-07 16:24:25,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:24:25,283 INFO L225 Difference]: With dead ends: 35 [2019-12-07 16:24:25,283 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 16:24:25,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:24:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 16:24:25,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-12-07 16:24:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 16:24:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2019-12-07 16:24:25,292 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 41 transitions. Word has length 22 [2019-12-07 16:24:25,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:24:25,293 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 41 transitions. [2019-12-07 16:24:25,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:24:25,293 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 41 transitions. [2019-12-07 16:24:25,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 16:24:25,295 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:24:25,296 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 16:24:25,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:24:25,497 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:24:25,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:24:25,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1825270114, now seen corresponding path program 1 times [2019-12-07 16:24:25,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:24:25,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312412519] [2019-12-07 16:24:25,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:24:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 33 proven. 87 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-12-07 16:24:25,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312412519] [2019-12-07 16:24:25,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682906463] [2019-12-07 16:24:25,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:24:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:25,683 INFO L264 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:24:25,686 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:24:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 72 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-12-07 16:24:25,715 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:24:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-12-07 16:24:25,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1342126070] [2019-12-07 16:24:25,959 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 16:24:25,959 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:24:25,960 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:24:25,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:24:25,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 9] total 20 [2019-12-07 16:24:25,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594957792] [2019-12-07 16:24:25,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 16:24:25,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:24:25,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 16:24:25,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-12-07 16:24:25,962 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. Second operand 20 states. [2019-12-07 16:24:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:24:26,272 INFO L93 Difference]: Finished difference Result 78 states and 145 transitions. [2019-12-07 16:24:26,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 16:24:26,273 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2019-12-07 16:24:26,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:24:26,275 INFO L225 Difference]: With dead ends: 78 [2019-12-07 16:24:26,275 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 16:24:26,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 117 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2019-12-07 16:24:26,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 16:24:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2019-12-07 16:24:26,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 16:24:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2019-12-07 16:24:26,288 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 63 [2019-12-07 16:24:26,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:24:26,288 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2019-12-07 16:24:26,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 16:24:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2019-12-07 16:24:26,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-12-07 16:24:26,291 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:24:26,292 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2019-12-07 16:24:26,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:24:26,492 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:24:26,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:24:26,493 INFO L82 PathProgramCache]: Analyzing trace with hash 2045512376, now seen corresponding path program 2 times [2019-12-07 16:24:26,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:24:26,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161455640] [2019-12-07 16:24:26,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:24:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:26,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 268 proven. 446 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-12-07 16:24:26,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161455640] [2019-12-07 16:24:26,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777933536] [2019-12-07 16:24:26,747 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:24:26,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 16:24:26,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:24:26,777 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:24:26,781 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:24:26,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-12-07 16:24:26,803 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:24:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 252 proven. 10 refuted. 0 times theorem prover too weak. 803 trivial. 0 not checked. [2019-12-07 16:24:27,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:24:27,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [21, 6] total 22 [2019-12-07 16:24:27,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192106482] [2019-12-07 16:24:27,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:24:27,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:24:27,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:24:27,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2019-12-07 16:24:27,013 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand 6 states. [2019-12-07 16:24:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:24:27,058 INFO L93 Difference]: Finished difference Result 80 states and 127 transitions. [2019-12-07 16:24:27,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:24:27,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-12-07 16:24:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:24:27,060 INFO L225 Difference]: With dead ends: 80 [2019-12-07 16:24:27,060 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 16:24:27,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 297 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2019-12-07 16:24:27,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 16:24:27,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-12-07 16:24:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 16:24:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2019-12-07 16:24:27,067 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 139 [2019-12-07 16:24:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:24:27,067 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2019-12-07 16:24:27,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:24:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2019-12-07 16:24:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 16:24:27,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:24:27,069 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 14, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1] [2019-12-07 16:24:27,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:24:27,270 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:24:27,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:24:27,270 INFO L82 PathProgramCache]: Analyzing trace with hash -904743616, now seen corresponding path program 2 times [2019-12-07 16:24:27,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:24:27,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345940388] [2019-12-07 16:24:27,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:24:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:24:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 371 proven. 300 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-12-07 16:24:27,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345940388] [2019-12-07 16:24:27,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733230194] [2019-12-07 16:24:27,462 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:24:27,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-12-07 16:24:27,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:24:27,506 INFO L264 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:24:27,510 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:24:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 596 proven. 12 refuted. 0 times theorem prover too weak. 503 trivial. 0 not checked. [2019-12-07 16:24:27,544 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:24:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 331 proven. 73 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2019-12-07 16:24:27,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [246897199] [2019-12-07 16:24:27,957 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-12-07 16:24:27,958 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:24:27,958 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 16:24:27,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:24:27,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 9] total 22 [2019-12-07 16:24:27,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317972130] [2019-12-07 16:24:27,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 16:24:27,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:24:27,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 16:24:27,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2019-12-07 16:24:27,960 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 22 states. [2019-12-07 16:24:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:24:28,310 INFO L93 Difference]: Finished difference Result 95 states and 151 transitions. [2019-12-07 16:24:28,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 16:24:28,310 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 143 [2019-12-07 16:24:28,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:24:28,311 INFO L225 Difference]: With dead ends: 95 [2019-12-07 16:24:28,311 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 16:24:28,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 284 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=966, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 16:24:28,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 16:24:28,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-07 16:24:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 16:24:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2019-12-07 16:24:28,322 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 143 [2019-12-07 16:24:28,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:24:28,322 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2019-12-07 16:24:28,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 16:24:28,322 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2019-12-07 16:24:28,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 16:24:28,324 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:24:28,324 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2019-12-07 16:24:28,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:24:28,525 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:24:28,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:24:28,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1483723059, now seen corresponding path program 3 times [2019-12-07 16:24:28,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:24:28,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863877163] [2019-12-07 16:24:28,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:24:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:24:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:24:28,596 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 16:24:28,596 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:24:28,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:24:28 BoogieIcfgContainer [2019-12-07 16:24:28,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:24:28,622 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:24:28,622 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:24:28,622 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:24:28,622 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:24:24" (3/4) ... [2019-12-07 16:24:28,624 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:24:28,676 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1edd6f91-c1d7-41c7-acb3-ad6e00ba1124/bin/utaipan/witness.graphml [2019-12-07 16:24:28,676 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:24:28,678 INFO L168 Benchmark]: Toolchain (without parser) took 4484.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:24:28,678 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:24:28,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:24:28,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.44 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:24:28,679 INFO L168 Benchmark]: Boogie Preprocessor took 10.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:24:28,679 INFO L168 Benchmark]: RCFGBuilder took 160.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:24:28,680 INFO L168 Benchmark]: TraceAbstraction took 4066.53 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 55.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -47.8 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:24:28,680 INFO L168 Benchmark]: Witness Printer took 54.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:24:28,682 INFO L335 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 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 169.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.44 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 160.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4066.53 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 55.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -47.8 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Witness Printer took 54.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 33]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) [L29] int result = fibonacci(x); [L30] COND FALSE !(x != 5 || result == 3) [L33] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.9s, OverallIterations: 7, TraceHistogramMax: 21, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 94 SDtfs, 246 SDslu, 291 SDs, 0 SdLazy, 727 SolverSat, 257 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 867 GetRequests, 742 SyntacticMatches, 20 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 858 NumberOfCodeBlocks, 696 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1106 ConstructedInterpolants, 0 QuantifiedInterpolants, 222866 SizeOfPredicates, 17 NumberOfNonLiveVariables, 481 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 6015/7113 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...