./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/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 f0bc64117ef8398002009c167867d7baf0a85044 ........................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/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 f0bc64117ef8398002009c167867d7baf0a85044 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-6b5699a [2019-11-26 02:52:22,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:52:22,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:52:22,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:52:22,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:52:22,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:52:22,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:52:22,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:52:22,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:52:22,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:52:22,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:52:22,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:52:22,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:52:22,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:52:22,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:52:22,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:52:22,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:52:22,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:52:22,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:52:22,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:52:22,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:52:22,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:52:22,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:52:22,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:52:22,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:52:22,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:52:22,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:52:22,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:52:22,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:52:22,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:52:22,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:52:22,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:52:22,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:52:22,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:52:22,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:52:22,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:52:22,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:52:22,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:52:22,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:52:22,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:52:22,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:52:22,412 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:52:22,425 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:52:22,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:52:22,426 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:52:22,426 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:52:22,426 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:52:22,426 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:52:22,427 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:52:22,427 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:52:22,427 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:52:22,427 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:52:22,427 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:52:22,428 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:52:22,428 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:52:22,428 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:52:22,428 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:52:22,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:52:22,429 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:52:22,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:52:22,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:52:22,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:52:22,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:52:22,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:52:22,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:52:22,431 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:52:22,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:52:22,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:52:22,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:52:22,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:52:22,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:52:22,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:52:22,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:52:22,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:52:22,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:52:22,433 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:52:22,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:52:22,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:52:22,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:52:22,434 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_6c030119-fb43-4eb1-9655-65f5333c2981/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 -> f0bc64117ef8398002009c167867d7baf0a85044 [2019-11-26 02:52:22,565 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:52:22,580 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:52:22,583 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:52:22,586 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:52:22,588 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:52:22,589 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/../../sv-benchmarks/c/recursive/Fibonacci05.c [2019-11-26 02:52:22,632 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/data/39a01991d/0b188d0db244446fa5eee6bc9d3ae8fe/FLAG4f2081630 [2019-11-26 02:52:23,005 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:52:23,006 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/sv-benchmarks/c/recursive/Fibonacci05.c [2019-11-26 02:52:23,011 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/data/39a01991d/0b188d0db244446fa5eee6bc9d3ae8fe/FLAG4f2081630 [2019-11-26 02:52:23,025 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/data/39a01991d/0b188d0db244446fa5eee6bc9d3ae8fe [2019-11-26 02:52:23,028 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:52:23,029 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:52:23,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:52:23,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:52:23,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:52:23,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:52:23" (1/1) ... [2019-11-26 02:52:23,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21963380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:23, skipping insertion in model container [2019-11-26 02:52:23,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:52:23" (1/1) ... [2019-11-26 02:52:23,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:52:23,064 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:52:23,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:52:23,236 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:52:23,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:52:23,358 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:52:23,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:23 WrapperNode [2019-11-26 02:52:23,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:52:23,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:52:23,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:52:23,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:52:23,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:23" (1/1) ... [2019-11-26 02:52:23,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:23" (1/1) ... [2019-11-26 02:52:23,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:52:23,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:52:23,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:52:23,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:52:23,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:23" (1/1) ... [2019-11-26 02:52:23,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:23" (1/1) ... [2019-11-26 02:52:23,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:23" (1/1) ... [2019-11-26 02:52:23,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:23" (1/1) ... [2019-11-26 02:52:23,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:23" (1/1) ... [2019-11-26 02:52:23,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:23" (1/1) ... [2019-11-26 02:52:23,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:23" (1/1) ... [2019-11-26 02:52:23,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:52:23,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:52:23,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:52:23,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:52:23,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/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-11-26 02:52:23,455 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-11-26 02:52:23,455 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-11-26 02:52:23,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:52:23,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:52:23,639 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:52:23,639 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-26 02:52:23,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:52:23 BoogieIcfgContainer [2019-11-26 02:52:23,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:52:23,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:52:23,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:52:23,650 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:52:23,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:52:23" (1/3) ... [2019-11-26 02:52:23,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ca8ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:52:23, skipping insertion in model container [2019-11-26 02:52:23,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:23" (2/3) ... [2019-11-26 02:52:23,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ca8ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:52:23, skipping insertion in model container [2019-11-26 02:52:23,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:52:23" (3/3) ... [2019-11-26 02:52:23,661 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2019-11-26 02:52:23,668 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:52:23,689 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:52:23,698 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:52:23,735 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:52:23,735 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:52:23,735 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:52:23,735 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:52:23,735 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:52:23,735 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:52:23,735 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:52:23,736 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:52:23,749 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-11-26 02:52:23,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:52:23,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:23,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:52:23,753 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:23,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:23,757 INFO L82 PathProgramCache]: Analyzing trace with hash 238562696, now seen corresponding path program 1 times [2019-11-26 02:52:23,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:52:23,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277836449] [2019-11-26 02:52:23,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:52:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:52:23,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277836449] [2019-11-26 02:52:23,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:52:23,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:52:23,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451751031] [2019-11-26 02:52:23,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:52:23,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:52:23,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:52:23,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:52:23,918 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2019-11-26 02:52:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:24,008 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-11-26 02:52:24,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:52:24,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-26 02:52:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:24,018 INFO L225 Difference]: With dead ends: 27 [2019-11-26 02:52:24,018 INFO L226 Difference]: Without dead ends: 17 [2019-11-26 02:52:24,021 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-11-26 02:52:24,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-26 02:52:24,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-26 02:52:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-26 02:52:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-26 02:52:24,053 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-11-26 02:52:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:24,054 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-26 02:52:24,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:52:24,054 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-26 02:52:24,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:52:24,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:24,055 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:52:24,056 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:24,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:24,056 INFO L82 PathProgramCache]: Analyzing trace with hash -497654578, now seen corresponding path program 1 times [2019-11-26 02:52:24,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:52:24,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089686290] [2019-11-26 02:52:24,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:52:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:24,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:52:24,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089686290] [2019-11-26 02:52:24,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:52:24,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:52:24,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143428170] [2019-11-26 02:52:24,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:52:24,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:52:24,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:52:24,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:52:24,092 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2019-11-26 02:52:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:24,153 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-11-26 02:52:24,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:52:24,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-26 02:52:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:24,155 INFO L225 Difference]: With dead ends: 23 [2019-11-26 02:52:24,155 INFO L226 Difference]: Without dead ends: 19 [2019-11-26 02:52:24,156 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-11-26 02:52:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-26 02:52:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-11-26 02:52:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-26 02:52:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-26 02:52:24,161 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-11-26 02:52:24,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:24,162 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-26 02:52:24,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:52:24,162 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-26 02:52:24,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-26 02:52:24,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:24,163 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:52:24,163 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:24,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:24,164 INFO L82 PathProgramCache]: Analyzing trace with hash -850570499, now seen corresponding path program 1 times [2019-11-26 02:52:24,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:52:24,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038505777] [2019-11-26 02:52:24,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:52:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 02:52:24,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038505777] [2019-11-26 02:52:24,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784000743] [2019-11-26 02:52:24,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/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-11-26 02:52:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:24,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:52:24,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:52:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 02:52:24,343 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:52:24,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-26 02:52:24,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2051751105] [2019-11-26 02:52:24,590 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-11-26 02:52:24,591 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:52:24,596 FATAL L310 FreeRefinementEngine]: Exception during interpolant generation: IllegalArgumentException [2019-11-26 02:52:24,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:52:24,800 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an 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.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-11-26 02:52:24,805 INFO L168 Benchmark]: Toolchain (without parser) took 1774.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -92.1 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:24,805 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:52:24,806 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:24,806 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:52:24,807 INFO L168 Benchmark]: Boogie Preprocessor took 21.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:52:24,808 INFO L168 Benchmark]: RCFGBuilder took 235.84 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: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:24,808 INFO L168 Benchmark]: TraceAbstraction took 1155.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.1 MB). Peak memory consumption was 84.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:24,811 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 235.84 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: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1155.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.1 MB). Peak memory consumption was 84.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: Recursive programs are not supported. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: Recursive programs are not supported.: de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:52:26,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:52:26,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:52:26,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:52:26,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:52:26,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:52:26,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:52:26,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:52:26,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:52:26,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:52:26,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:52:26,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:52:26,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:52:26,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:52:26,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:52:26,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:52:26,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:52:26,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:52:26,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:52:26,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:52:26,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:52:26,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:52:26,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:52:26,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:52:26,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:52:26,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:52:26,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:52:26,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:52:26,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:52:26,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:52:26,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:52:26,661 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:52:26,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:52:26,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:52:26,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:52:26,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:52:26,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:52:26,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:52:26,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:52:26,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:52:26,668 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:52:26,668 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-11-26 02:52:26,692 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:52:26,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:52:26,694 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:52:26,694 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:52:26,695 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:52:26,695 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:52:26,695 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:52:26,696 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:52:26,696 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:52:26,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:52:26,697 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:52:26,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:52:26,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:52:26,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:52:26,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:52:26,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:52:26,699 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:52:26,699 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:52:26,700 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:52:26,700 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:52:26,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:52:26,700 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:52:26,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:52:26,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:52:26,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:52:26,701 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:52:26,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:52:26,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:52:26,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:52:26,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:52:26,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:52:26,703 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:52:26,703 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:52:26,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:52:26,704 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:52:26,704 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_6c030119-fb43-4eb1-9655-65f5333c2981/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 -> f0bc64117ef8398002009c167867d7baf0a85044 [2019-11-26 02:52:27,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:52:27,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:52:27,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:52:27,013 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:52:27,014 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:52:27,014 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/../../sv-benchmarks/c/recursive/Fibonacci05.c [2019-11-26 02:52:27,065 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/data/763079c52/4c770c915a1c4534847c15e20d9cb794/FLAG716a7886e [2019-11-26 02:52:27,467 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:52:27,468 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/sv-benchmarks/c/recursive/Fibonacci05.c [2019-11-26 02:52:27,473 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/data/763079c52/4c770c915a1c4534847c15e20d9cb794/FLAG716a7886e [2019-11-26 02:52:27,876 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/data/763079c52/4c770c915a1c4534847c15e20d9cb794 [2019-11-26 02:52:27,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:52:27,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:52:27,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:52:27,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:52:27,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:52:27,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:52:27" (1/1) ... [2019-11-26 02:52:27,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15bbfe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:27, skipping insertion in model container [2019-11-26 02:52:27,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:52:27" (1/1) ... [2019-11-26 02:52:27,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:52:27,913 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:52:28,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:52:28,071 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:52:28,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:52:28,098 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:52:28,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:28 WrapperNode [2019-11-26 02:52:28,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:52:28,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:52:28,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:52:28,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:52:28,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:28" (1/1) ... [2019-11-26 02:52:28,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:28" (1/1) ... [2019-11-26 02:52:28,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:52:28,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:52:28,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:52:28,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:52:28,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:28" (1/1) ... [2019-11-26 02:52:28,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:28" (1/1) ... [2019-11-26 02:52:28,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:28" (1/1) ... [2019-11-26 02:52:28,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:28" (1/1) ... [2019-11-26 02:52:28,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:28" (1/1) ... [2019-11-26 02:52:28,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:28" (1/1) ... [2019-11-26 02:52:28,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:28" (1/1) ... [2019-11-26 02:52:28,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:52:28,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:52:28,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:52:28,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:52:28,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/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-11-26 02:52:28,239 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-11-26 02:52:28,239 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-11-26 02:52:28,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:52:28,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:52:28,374 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:52:28,374 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-26 02:52:28,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:52:28 BoogieIcfgContainer [2019-11-26 02:52:28,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:52:28,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:52:28,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:52:28,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:52:28,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:52:27" (1/3) ... [2019-11-26 02:52:28,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e68f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:52:28, skipping insertion in model container [2019-11-26 02:52:28,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:52:28" (2/3) ... [2019-11-26 02:52:28,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e68f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:52:28, skipping insertion in model container [2019-11-26 02:52:28,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:52:28" (3/3) ... [2019-11-26 02:52:28,382 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2019-11-26 02:52:28,390 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:52:28,395 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:52:28,404 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:52:28,424 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:52:28,424 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:52:28,425 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:52:28,425 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:52:28,425 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:52:28,425 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:52:28,425 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:52:28,425 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:52:28,439 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-11-26 02:52:28,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:52:28,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:28,444 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:52:28,445 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:28,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:28,449 INFO L82 PathProgramCache]: Analyzing trace with hash 302252519, now seen corresponding path program 1 times [2019-11-26 02:52:28,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:52:28,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1534656170] [2019-11-26 02:52:28,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:52:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:28,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:52:28,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:52:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:52:28,603 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:52:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:52:28,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1534656170] [2019-11-26 02:52:28,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:52:28,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-26 02:52:28,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607770430] [2019-11-26 02:52:28,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:52:28,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:52:28,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:52:28,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:52:28,764 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 8 states. [2019-11-26 02:52:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:28,965 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2019-11-26 02:52:28,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:52:28,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-26 02:52:28,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:28,981 INFO L225 Difference]: With dead ends: 38 [2019-11-26 02:52:28,982 INFO L226 Difference]: Without dead ends: 20 [2019-11-26 02:52:28,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:52:29,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-26 02:52:29,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-26 02:52:29,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-26 02:52:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-11-26 02:52:29,034 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 9 [2019-11-26 02:52:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:29,035 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-11-26 02:52:29,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:52:29,035 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2019-11-26 02:52:29,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 02:52:29,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:29,040 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:52:29,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:52:29,241 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:29,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:29,242 INFO L82 PathProgramCache]: Analyzing trace with hash 495326291, now seen corresponding path program 1 times [2019-11-26 02:52:29,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:52:29,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1822703809] [2019-11-26 02:52:29,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:52:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:29,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 02:52:29,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:52:29,358 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 02:52:29,358 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:52:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-26 02:52:29,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1822703809] [2019-11-26 02:52:29,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785610355] [2019-11-26 02:52:29,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/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-11-26 02:52:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:29,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:52:29,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:52:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 02:52:29,767 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:52:30,044 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-26 02:52:30,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-11-26 02:52:30,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 7] imperfect sequences [7, 7] total 15 [2019-11-26 02:52:30,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328344464] [2019-11-26 02:52:30,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 02:52:30,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:52:30,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 02:52:30,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:52:30,047 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 9 states. [2019-11-26 02:52:30,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:30,399 INFO L93 Difference]: Finished difference Result 73 states and 197 transitions. [2019-11-26 02:52:30,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 02:52:30,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-26 02:52:30,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:30,406 INFO L225 Difference]: With dead ends: 73 [2019-11-26 02:52:30,406 INFO L226 Difference]: Without dead ends: 55 [2019-11-26 02:52:30,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-11-26 02:52:30,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-26 02:52:30,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2019-11-26 02:52:30,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-26 02:52:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 103 transitions. [2019-11-26 02:52:30,443 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 103 transitions. Word has length 23 [2019-11-26 02:52:30,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:30,443 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 103 transitions. [2019-11-26 02:52:30,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 02:52:30,444 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 103 transitions. [2019-11-26 02:52:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-26 02:52:30,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:30,449 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:52:30,859 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:52:30,860 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:30,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:30,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2106720969, now seen corresponding path program 1 times [2019-11-26 02:52:30,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:52:30,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1010970697] [2019-11-26 02:52:30,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:52:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:30,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 02:52:30,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:52:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-26 02:52:31,049 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:52:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-26 02:52:31,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1010970697] [2019-11-26 02:52:31,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552509419] [2019-11-26 02:52:31,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:52:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:31,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 02:52:31,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:52:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-26 02:52:31,687 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:52:32,013 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-26 02:52:32,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:52:32,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7, 10] total 13 [2019-11-26 02:52:32,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799532527] [2019-11-26 02:52:32,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-26 02:52:32,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:52:32,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-26 02:52:32,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-11-26 02:52:32,016 INFO L87 Difference]: Start difference. First operand 43 states and 103 transitions. Second operand 13 states. [2019-11-26 02:52:32,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:32,544 INFO L93 Difference]: Finished difference Result 95 states and 271 transitions. [2019-11-26 02:52:32,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 02:52:32,545 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-11-26 02:52:32,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:32,548 INFO L225 Difference]: With dead ends: 95 [2019-11-26 02:52:32,548 INFO L226 Difference]: Without dead ends: 54 [2019-11-26 02:52:32,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 118 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2019-11-26 02:52:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-26 02:52:32,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2019-11-26 02:52:32,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-26 02:52:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2019-11-26 02:52:32,584 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 34 [2019-11-26 02:52:32,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:32,584 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 49 transitions. [2019-11-26 02:52:32,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-26 02:52:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 49 transitions. [2019-11-26 02:52:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 02:52:32,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:32,593 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:52:32,994 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:52:32,995 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:32,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:32,995 INFO L82 PathProgramCache]: Analyzing trace with hash 709025827, now seen corresponding path program 2 times [2019-11-26 02:52:32,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:52:32,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [582956876] [2019-11-26 02:52:32,999 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:52:33,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 02:52:33,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:52:33,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 02:52:33,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:52:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-26 02:52:33,085 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:52:33,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:33,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-26 02:52:33,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [582956876] [2019-11-26 02:52:33,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122432624] [2019-11-26 02:52:33,397 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:52:33,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 02:52:33,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:52:33,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:52:33,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:52:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-26 02:52:33,464 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:52:33,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-26 02:52:33,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:52:33,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 6, 7] total 12 [2019-11-26 02:52:33,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97872966] [2019-11-26 02:52:33,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:52:33,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:52:33,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:52:33,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:52:33,588 INFO L87 Difference]: Start difference. First operand 31 states and 49 transitions. Second operand 12 states. [2019-11-26 02:52:33,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:33,840 INFO L93 Difference]: Finished difference Result 86 states and 173 transitions. [2019-11-26 02:52:33,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 02:52:33,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-11-26 02:52:33,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:33,844 INFO L225 Difference]: With dead ends: 86 [2019-11-26 02:52:33,844 INFO L226 Difference]: Without dead ends: 53 [2019-11-26 02:52:33,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 123 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-11-26 02:52:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-26 02:52:33,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2019-11-26 02:52:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-26 02:52:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 86 transitions. [2019-11-26 02:52:33,860 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 86 transitions. Word has length 35 [2019-11-26 02:52:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:33,860 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 86 transitions. [2019-11-26 02:52:33,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:52:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 86 transitions. [2019-11-26 02:52:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-26 02:52:33,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:33,863 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-11-26 02:52:34,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:52:34,268 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:34,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:34,268 INFO L82 PathProgramCache]: Analyzing trace with hash 279999463, now seen corresponding path program 1 times [2019-11-26 02:52:34,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:52:34,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1161774414] [2019-11-26 02:52:34,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:52:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:52:34,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 02:52:34,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:52:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-26 02:52:34,391 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:52:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-26 02:52:34,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1161774414] [2019-11-26 02:52:34,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:52:34,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 9] imperfect sequences [] total 12 [2019-11-26 02:52:34,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592304599] [2019-11-26 02:52:34,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:52:34,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:52:34,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:52:34,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:52:34,932 INFO L87 Difference]: Start difference. First operand 48 states and 86 transitions. Second operand 12 states. [2019-11-26 02:52:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:35,216 INFO L93 Difference]: Finished difference Result 81 states and 149 transitions. [2019-11-26 02:52:35,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:52:35,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-11-26 02:52:35,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:35,219 INFO L225 Difference]: With dead ends: 81 [2019-11-26 02:52:35,219 INFO L226 Difference]: Without dead ends: 35 [2019-11-26 02:52:35,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-11-26 02:52:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-26 02:52:35,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-26 02:52:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-26 02:52:35,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2019-11-26 02:52:35,226 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 57 [2019-11-26 02:52:35,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:35,227 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-11-26 02:52:35,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:52:35,227 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2019-11-26 02:52:35,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-26 02:52:35,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:35,233 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 19, 11, 11, 11, 11, 11, 11, 8, 4, 1, 1, 1, 1, 1, 1] [2019-11-26 02:52:35,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:52:35,436 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:35,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:35,436 INFO L82 PathProgramCache]: Analyzing trace with hash -350087705, now seen corresponding path program 3 times [2019-11-26 02:52:35,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:52:35,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [538384249] [2019-11-26 02:52:35,438 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:52:35,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-11-26 02:52:35,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:52:35,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 02:52:35,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:52:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 392 proven. 48 refuted. 0 times theorem prover too weak. 908 trivial. 0 not checked. [2019-11-26 02:52:35,641 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:52:36,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 401 proven. 54 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2019-11-26 02:52:36,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [538384249] [2019-11-26 02:52:36,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503856467] [2019-11-26 02:52:36,451 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:52:36,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-11-26 02:52:36,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:52:36,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 02:52:36,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:52:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 392 proven. 48 refuted. 0 times theorem prover too weak. 908 trivial. 0 not checked. [2019-11-26 02:52:36,612 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:52:37,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 401 proven. 54 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2019-11-26 02:52:37,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:52:37,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6, 9] total 11 [2019-11-26 02:52:37,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258081558] [2019-11-26 02:52:37,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 02:52:37,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:52:37,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 02:52:37,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:52:37,265 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 11 states. [2019-11-26 02:52:37,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:37,541 INFO L93 Difference]: Finished difference Result 97 states and 187 transitions. [2019-11-26 02:52:37,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:52:37,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 149 [2019-11-26 02:52:37,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:37,543 INFO L225 Difference]: With dead ends: 97 [2019-11-26 02:52:37,543 INFO L226 Difference]: Without dead ends: 63 [2019-11-26 02:52:37,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 578 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-11-26 02:52:37,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-26 02:52:37,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2019-11-26 02:52:37,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-26 02:52:37,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 95 transitions. [2019-11-26 02:52:37,557 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 95 transitions. Word has length 149 [2019-11-26 02:52:37,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:37,557 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 95 transitions. [2019-11-26 02:52:37,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 02:52:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 95 transitions. [2019-11-26 02:52:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-26 02:52:37,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:37,560 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2019-11-26 02:52:37,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:52:37,969 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:37,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:37,969 INFO L82 PathProgramCache]: Analyzing trace with hash 902762739, now seen corresponding path program 4 times [2019-11-26 02:52:37,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:52:37,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2045581753] [2019-11-26 02:52:37,970 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:52:38,097 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-26 02:52:38,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:52:38,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-26 02:52:38,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:52:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 155 proven. 319 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2019-11-26 02:52:38,228 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:52:38,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:39,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:39,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 168 proven. 349 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-11-26 02:52:39,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2045581753] [2019-11-26 02:52:39,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894141770] [2019-11-26 02:52:39,164 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:52:39,245 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-26 02:52:39,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:52:39,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-26 02:52:39,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:52:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 182 proven. 288 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2019-11-26 02:52:39,287 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:52:39,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:39,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:39,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:40,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:40,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 897 backedges. 199 proven. 338 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-11-26 02:52:40,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:52:40,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 8, 13] total 22 [2019-11-26 02:52:40,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281491511] [2019-11-26 02:52:40,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-26 02:52:40,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:52:40,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-26 02:52:40,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2019-11-26 02:52:40,226 INFO L87 Difference]: Start difference. First operand 54 states and 95 transitions. Second operand 22 states. [2019-11-26 02:52:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:41,107 INFO L93 Difference]: Finished difference Result 129 states and 299 transitions. [2019-11-26 02:52:41,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-26 02:52:41,108 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 123 [2019-11-26 02:52:41,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:41,110 INFO L225 Difference]: With dead ends: 129 [2019-11-26 02:52:41,110 INFO L226 Difference]: Without dead ends: 77 [2019-11-26 02:52:41,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 458 SyntacticMatches, 10 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=481, Invalid=1241, Unknown=0, NotChecked=0, Total=1722 [2019-11-26 02:52:41,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-26 02:52:41,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 66. [2019-11-26 02:52:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-26 02:52:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 107 transitions. [2019-11-26 02:52:41,124 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 107 transitions. Word has length 123 [2019-11-26 02:52:41,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:41,125 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 107 transitions. [2019-11-26 02:52:41,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-26 02:52:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 107 transitions. [2019-11-26 02:52:41,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-26 02:52:41,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:41,128 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2019-11-26 02:52:41,531 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:52:41,532 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:41,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:41,532 INFO L82 PathProgramCache]: Analyzing trace with hash 235297919, now seen corresponding path program 5 times [2019-11-26 02:52:41,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:52:41,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1195305970] [2019-11-26 02:52:41,533 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:52:41,738 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-11-26 02:52:41,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:52:41,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 02:52:41,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:52:41,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 307 proven. 112 refuted. 0 times theorem prover too weak. 1169 trivial. 0 not checked. [2019-11-26 02:52:41,803 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:52:42,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:42,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:42,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:42,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 306 proven. 124 refuted. 0 times theorem prover too weak. 1158 trivial. 0 not checked. [2019-11-26 02:52:42,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1195305970] [2019-11-26 02:52:42,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851727649] [2019-11-26 02:52:42,581 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:52:42,759 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-11-26 02:52:42,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:52:42,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-26 02:52:42,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:52:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 381 proven. 247 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2019-11-26 02:52:42,814 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:52:43,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:43,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:43,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:43,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:52:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 306 proven. 124 refuted. 0 times theorem prover too weak. 1158 trivial. 0 not checked. [2019-11-26 02:52:43,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:52:43,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10, 11] total 17 [2019-11-26 02:52:43,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938462255] [2019-11-26 02:52:43,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-26 02:52:43,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:52:43,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-26 02:52:43,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-11-26 02:52:43,612 INFO L87 Difference]: Start difference. First operand 66 states and 107 transitions. Second operand 17 states. [2019-11-26 02:52:44,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:52:44,121 INFO L93 Difference]: Finished difference Result 178 states and 313 transitions. [2019-11-26 02:52:44,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-26 02:52:44,123 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 161 [2019-11-26 02:52:44,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:52:44,125 INFO L225 Difference]: With dead ends: 178 [2019-11-26 02:52:44,125 INFO L226 Difference]: Without dead ends: 102 [2019-11-26 02:52:44,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 620 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-11-26 02:52:44,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-26 02:52:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 80. [2019-11-26 02:52:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-26 02:52:44,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2019-11-26 02:52:44,143 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 161 [2019-11-26 02:52:44,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:52:44,144 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2019-11-26 02:52:44,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-26 02:52:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2019-11-26 02:52:44,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2019-11-26 02:52:44,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:52:44,152 INFO L410 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1] [2019-11-26 02:52:44,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:52:44,557 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:52:44,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:52:44,558 INFO L82 PathProgramCache]: Analyzing trace with hash -863826843, now seen corresponding path program 6 times [2019-11-26 02:52:44,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:52:44,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [950911356] [2019-11-26 02:52:44,558 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:52:45,268 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2019-11-26 02:52:45,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-26 02:52:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:52:45,887 INFO L174 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2019-11-26 02:52:45,887 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:52:46,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:52:46,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:52:46 BoogieIcfgContainer [2019-11-26 02:52:46,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:52:46,215 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:52:46,215 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:52:46,215 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:52:46,216 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:52:28" (3/4) ... [2019-11-26 02:52:46,218 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 02:52:46,344 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6c030119-fb43-4eb1-9655-65f5333c2981/bin/utaipan/witness.graphml [2019-11-26 02:52:46,344 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:52:46,346 INFO L168 Benchmark]: Toolchain (without parser) took 18465.48 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.2 MB). Free memory was 960.4 MB in the beginning and 963.3 MB in the end (delta: -2.8 MB). Peak memory consumption was 324.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:46,346 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:52:46,347 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.58 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:46,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.10 ms. Allocated memory is still 1.0 GB. Free memory is still 949.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:52:46,347 INFO L168 Benchmark]: Boogie Preprocessor took 66.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:46,348 INFO L168 Benchmark]: RCFGBuilder took 184.46 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: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:46,348 INFO L168 Benchmark]: TraceAbstraction took 17838.66 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 226.0 MB). Free memory was 1.1 GB in the beginning and 973.7 MB in the end (delta: 105.1 MB). Peak memory consumption was 331.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:46,349 INFO L168 Benchmark]: Witness Printer took 129.36 ms. Allocated memory is still 1.4 GB. Free memory was 973.7 MB in the beginning and 963.3 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:52:46,350 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 214.58 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.10 ms. Allocated memory is still 1.0 GB. Free memory is still 949.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 184.46 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: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17838.66 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 226.0 MB). Free memory was 1.1 GB in the beginning and 973.7 MB in the end (delta: 105.1 MB). Peak memory consumption was 331.1 MB. Max. memory is 11.5 GB. * Witness Printer took 129.36 ms. Allocated memory is still 1.4 GB. Free memory was 973.7 MB in the beginning and 963.3 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Result: UNSAFE, OverallTime: 17.7s, OverallIterations: 9, TraceHistogramMax: 67, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 143 SDtfs, 321 SDslu, 434 SDs, 0 SdLazy, 1399 SolverSat, 631 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2264 GetRequests, 2081 SyntacticMatches, 36 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 82 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 1542 NumberOfCodeBlocks, 1412 NumberOfCodeBlocksAsserted, 120 NumberOfCheckSat, 2204 ConstructedInterpolants, 0 QuantifiedInterpolants, 588062 SizeOfPredicates, 73 NumberOfNonLiveVariables, 1408 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 13879/16108 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...