./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer --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 Automizer --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-cad4683 [2019-11-15 21:21:55,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:21:55,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:21:55,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:21:55,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:21:55,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:21:55,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:21:55,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:21:55,401 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:21:55,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:21:55,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:21:55,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:21:55,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:21:55,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:21:55,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:21:55,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:21:55,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:21:55,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:21:55,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:21:55,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:21:55,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:21:55,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:21:55,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:21:55,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:21:55,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:21:55,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:21:55,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:21:55,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:21:55,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:21:55,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:21:55,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:21:55,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:21:55,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:21:55,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:21:55,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:21:55,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:21:55,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:21:55,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:21:55,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:21:55,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:21:55,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:21:55,439 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:21:55,464 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:21:55,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:21:55,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:21:55,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:21:55,465 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:21:55,465 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:21:55,466 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:21:55,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:21:55,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:21:55,466 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:21:55,466 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:21:55,466 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:21:55,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:21:55,467 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:21:55,467 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:21:55,467 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:21:55,467 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:21:55,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:21:55,468 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:21:55,468 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:21:55,468 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:21:55,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:21:55,468 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:21:55,469 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:21:55,469 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:21:55,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:21:55,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:21:55,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:21:55,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer 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 -> Automizer 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-15 21:21:55,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:21:55,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:21:55,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:21:55,538 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:21:55,538 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:21:55,540 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/../../sv-benchmarks/c/recursive/Fibonacci05.c [2019-11-15 21:21:55,587 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/data/bac8c2177/999ae13674e1460ba2dc0fc969e4e31d/FLAG5f9b8a28c [2019-11-15 21:21:55,986 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:21:55,987 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/sv-benchmarks/c/recursive/Fibonacci05.c [2019-11-15 21:21:55,993 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/data/bac8c2177/999ae13674e1460ba2dc0fc969e4e31d/FLAG5f9b8a28c [2019-11-15 21:21:56,009 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/data/bac8c2177/999ae13674e1460ba2dc0fc969e4e31d [2019-11-15 21:21:56,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:21:56,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:21:56,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:21:56,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:21:56,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:21:56,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:21:56" (1/1) ... [2019-11-15 21:21:56,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e997487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:56, skipping insertion in model container [2019-11-15 21:21:56,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:21:56" (1/1) ... [2019-11-15 21:21:56,031 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:21:56,047 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:21:56,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:21:56,338 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:21:56,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:21:56,369 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:21:56,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:56 WrapperNode [2019-11-15 21:21:56,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:21:56,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:21:56,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:21:56,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:21:56,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:56" (1/1) ... [2019-11-15 21:21:56,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:56" (1/1) ... [2019-11-15 21:21:56,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:21:56,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:21:56,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:21:56,407 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:21:56,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:56" (1/1) ... [2019-11-15 21:21:56,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:56" (1/1) ... [2019-11-15 21:21:56,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:56" (1/1) ... [2019-11-15 21:21:56,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:56" (1/1) ... [2019-11-15 21:21:56,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:56" (1/1) ... [2019-11-15 21:21:56,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:56" (1/1) ... [2019-11-15 21:21:56,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:56" (1/1) ... [2019-11-15 21:21:56,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:21:56,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:21:56,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:21:56,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:21:56,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/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-15 21:21:56,484 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-11-15 21:21:56,485 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-11-15 21:21:56,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:21:56,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:21:56,623 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:21:56,623 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 21:21:56,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:21:56 BoogieIcfgContainer [2019-11-15 21:21:56,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:21:56,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:21:56,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:21:56,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:21:56,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:21:56" (1/3) ... [2019-11-15 21:21:56,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9dec5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:21:56, skipping insertion in model container [2019-11-15 21:21:56,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:56" (2/3) ... [2019-11-15 21:21:56,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9dec5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:21:56, skipping insertion in model container [2019-11-15 21:21:56,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:21:56" (3/3) ... [2019-11-15 21:21:56,631 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2019-11-15 21:21:56,639 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:21:56,645 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:21:56,654 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:21:56,675 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:21:56,675 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:21:56,675 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:21:56,675 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:21:56,675 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:21:56,676 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:21:56,676 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:21:56,676 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:21:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-15 21:21:56,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 21:21:56,696 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:56,697 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:56,698 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:56,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:56,703 INFO L82 PathProgramCache]: Analyzing trace with hash 238562696, now seen corresponding path program 1 times [2019-11-15 21:21:56,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:56,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822023417] [2019-11-15 21:21:56,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:56,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:56,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:56,881 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-15 21:21:56,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822023417] [2019-11-15 21:21:56,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:56,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:21:56,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171966343] [2019-11-15 21:21:56,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:21:56,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:56,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:21:56,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:21:56,902 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2019-11-15 21:21:57,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:57,055 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-11-15 21:21:57,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:21:57,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-15 21:21:57,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:57,065 INFO L225 Difference]: With dead ends: 30 [2019-11-15 21:21:57,065 INFO L226 Difference]: Without dead ends: 17 [2019-11-15 21:21:57,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-15 21:21:57,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-15 21:21:57,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-15 21:21:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 21:21:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-15 21:21:57,100 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-11-15 21:21:57,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:57,100 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-15 21:21:57,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:21:57,100 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-15 21:21:57,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 21:21:57,101 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:57,102 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:57,102 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:57,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:57,102 INFO L82 PathProgramCache]: Analyzing trace with hash -497654578, now seen corresponding path program 1 times [2019-11-15 21:21:57,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:57,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229044040] [2019-11-15 21:21:57,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:57,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:57,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:57,171 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-15 21:21:57,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229044040] [2019-11-15 21:21:57,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:57,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:21:57,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246229969] [2019-11-15 21:21:57,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:21:57,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:57,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:21:57,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:21:57,173 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2019-11-15 21:21:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:57,251 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-11-15 21:21:57,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:21:57,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-15 21:21:57,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:57,252 INFO L225 Difference]: With dead ends: 23 [2019-11-15 21:21:57,252 INFO L226 Difference]: Without dead ends: 19 [2019-11-15 21:21:57,253 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-15 21:21:57,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-15 21:21:57,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-11-15 21:21:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 21:21:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-15 21:21:57,258 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-11-15 21:21:57,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:57,259 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-15 21:21:57,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:21:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-15 21:21:57,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 21:21:57,260 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:57,260 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:57,260 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:57,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:57,260 INFO L82 PathProgramCache]: Analyzing trace with hash -850570499, now seen corresponding path program 1 times [2019-11-15 21:21:57,261 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:57,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618687625] [2019-11-15 21:21:57,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:57,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:57,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 21:21:57,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618687625] [2019-11-15 21:21:57,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344452958] [2019-11-15 21:21:57,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/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-15 21:21:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:57,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:21:57,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:57,499 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-15 21:21:57,499 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:21:57,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-15 21:21:57,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822501788] [2019-11-15 21:21:57,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:21:57,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:57,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:21:57,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:21:57,501 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 9 states. [2019-11-15 21:21:57,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:57,621 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-11-15 21:21:57,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:21:57,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-15 21:21:57,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:57,623 INFO L225 Difference]: With dead ends: 34 [2019-11-15 21:21:57,623 INFO L226 Difference]: Without dead ends: 19 [2019-11-15 21:21:57,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:21:57,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-15 21:21:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-15 21:21:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 21:21:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-11-15 21:21:57,629 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2019-11-15 21:21:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:57,629 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-11-15 21:21:57,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:21:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-11-15 21:21:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 21:21:57,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:57,631 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:57,845 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:21:57,846 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:57,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:57,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1834230885, now seen corresponding path program 1 times [2019-11-15 21:21:57,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:57,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591259429] [2019-11-15 21:21:57,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:57,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:57,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:57,981 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 21:21:57,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591259429] [2019-11-15 21:21:57,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461646884] [2019-11-15 21:21:57,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:21:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:58,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:21:58,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 21:21:58,038 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:21:58,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-15 21:21:58,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191831957] [2019-11-15 21:21:58,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:21:58,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:58,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:21:58,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:21:58,040 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 8 states. [2019-11-15 21:21:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:58,132 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-11-15 21:21:58,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:21:58,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-15 21:21:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:58,134 INFO L225 Difference]: With dead ends: 37 [2019-11-15 21:21:58,134 INFO L226 Difference]: Without dead ends: 33 [2019-11-15 21:21:58,135 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:21:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-15 21:21:58,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-15 21:21:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 21:21:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2019-11-15 21:21:58,144 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 23 [2019-11-15 21:21:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:58,145 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2019-11-15 21:21:58,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:21:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2019-11-15 21:21:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 21:21:58,147 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:58,147 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:58,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:21:58,350 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:58,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:58,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1301134080, now seen corresponding path program 2 times [2019-11-15 21:21:58,351 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:58,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479396954] [2019-11-15 21:21:58,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:58,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:58,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:21:58,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479396954] [2019-11-15 21:21:58,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114522133] [2019-11-15 21:21:58,536 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/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-15 21:21:58,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:21:58,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:21:58,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:21:58,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-15 21:21:58,642 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:21:58,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-11-15 21:21:58,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022346684] [2019-11-15 21:21:58,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 21:21:58,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:58,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 21:21:58,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:21:58,644 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 14 states. [2019-11-15 21:21:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:58,904 INFO L93 Difference]: Finished difference Result 67 states and 102 transitions. [2019-11-15 21:21:58,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:21:58,905 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-11-15 21:21:58,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:58,907 INFO L225 Difference]: With dead ends: 67 [2019-11-15 21:21:58,907 INFO L226 Difference]: Without dead ends: 34 [2019-11-15 21:21:58,908 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:21:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-15 21:21:58,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-15 21:21:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 21:21:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-11-15 21:21:58,919 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 36 [2019-11-15 21:21:58,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:58,920 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-15 21:21:58,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 21:21:58,921 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-11-15 21:21:58,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 21:21:58,929 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:58,930 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:59,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:21:59,133 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:59,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:59,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1115014434, now seen corresponding path program 3 times [2019-11-15 21:21:59,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:59,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054395233] [2019-11-15 21:21:59,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:59,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:59,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 137 proven. 127 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-11-15 21:21:59,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054395233] [2019-11-15 21:21:59,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634119741] [2019-11-15 21:21:59,662 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:21:59,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-15 21:21:59,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:21:59,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:21:59,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-11-15 21:21:59,808 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:21:59,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 21 [2019-11-15 21:21:59,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014954372] [2019-11-15 21:21:59,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 21:21:59,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:59,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 21:21:59,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2019-11-15 21:21:59,812 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 21 states. [2019-11-15 21:22:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:00,239 INFO L93 Difference]: Finished difference Result 87 states and 133 transitions. [2019-11-15 21:22:00,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 21:22:00,239 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 92 [2019-11-15 21:22:00,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:00,241 INFO L225 Difference]: With dead ends: 87 [2019-11-15 21:22:00,241 INFO L226 Difference]: Without dead ends: 55 [2019-11-15 21:22:00,243 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2019-11-15 21:22:00,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-15 21:22:00,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2019-11-15 21:22:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-15 21:22:00,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2019-11-15 21:22:00,252 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 92 [2019-11-15 21:22:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:00,255 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2019-11-15 21:22:00,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 21:22:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2019-11-15 21:22:00,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 21:22:00,257 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:22:00,258 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 21:22:00,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:22:00,461 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:22:00,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:22:00,461 INFO L82 PathProgramCache]: Analyzing trace with hash 300559544, now seen corresponding path program 4 times [2019-11-15 21:22:00,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:22:00,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689264552] [2019-11-15 21:22:00,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:00,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:00,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:22:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-15 21:22:00,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689264552] [2019-11-15 21:22:00,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049447726] [2019-11-15 21:22:00,642 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/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-15 21:22:00,685 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 21:22:00,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:22:00,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 21:22:00,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:22:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-15 21:22:00,714 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:22:00,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2019-11-15 21:22:00,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770036138] [2019-11-15 21:22:00,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 21:22:00,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:22:00,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:22:00,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:22:00,716 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 12 states. [2019-11-15 21:22:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:00,842 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2019-11-15 21:22:00,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:22:00,843 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-11-15 21:22:00,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:00,844 INFO L225 Difference]: With dead ends: 56 [2019-11-15 21:22:00,844 INFO L226 Difference]: Without dead ends: 52 [2019-11-15 21:22:00,845 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:22:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-15 21:22:00,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-15 21:22:00,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-15 21:22:00,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2019-11-15 21:22:00,854 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 64 [2019-11-15 21:22:00,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:00,854 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2019-11-15 21:22:00,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 21:22:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2019-11-15 21:22:00,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-15 21:22:00,856 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:22:00,856 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2019-11-15 21:22:01,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:22:01,060 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:22:01,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:22:01,060 INFO L82 PathProgramCache]: Analyzing trace with hash 2037341067, now seen corresponding path program 5 times [2019-11-15 21:22:01,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:22:01,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074268549] [2019-11-15 21:22:01,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:01,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:01,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:22:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 198 proven. 308 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2019-11-15 21:22:01,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074268549] [2019-11-15 21:22:01,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034258228] [2019-11-15 21:22:01,504 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:22:01,567 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-11-15 21:22:01,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:22:01,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 21:22:01,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:22:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 336 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2019-11-15 21:22:01,654 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:22:01,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 22 [2019-11-15 21:22:01,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339425006] [2019-11-15 21:22:01,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 21:22:01,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:22:01,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 21:22:01,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:22:01,656 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand 22 states. [2019-11-15 21:22:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:02,040 INFO L93 Difference]: Finished difference Result 116 states and 158 transitions. [2019-11-15 21:22:02,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 21:22:02,041 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 132 [2019-11-15 21:22:02,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:02,042 INFO L225 Difference]: With dead ends: 116 [2019-11-15 21:22:02,043 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 21:22:02,044 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=265, Invalid=857, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 21:22:02,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 21:22:02,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2019-11-15 21:22:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-15 21:22:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-11-15 21:22:02,053 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 132 [2019-11-15 21:22:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:02,054 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-11-15 21:22:02,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 21:22:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-11-15 21:22:02,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-15 21:22:02,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:22:02,055 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2019-11-15 21:22:02,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:22:02,265 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:22:02,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:22:02,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1483723059, now seen corresponding path program 6 times [2019-11-15 21:22:02,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:22:02,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186022443] [2019-11-15 21:22:02,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:02,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:02,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:22:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:02,466 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-11-15 21:22:02,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186022443] [2019-11-15 21:22:02,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074220315] [2019-11-15 21:22:02,467 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/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-15 21:22:02,524 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-11-15 21:22:02,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:22:02,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:22:02,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:22:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-11-15 21:22:02,568 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:22:02,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 14 [2019-11-15 21:22:02,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153510712] [2019-11-15 21:22:02,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 21:22:02,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:22:02,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 21:22:02,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:22:02,574 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 14 states. [2019-11-15 21:22:02,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:02,702 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2019-11-15 21:22:02,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:22:02,703 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 105 [2019-11-15 21:22:02,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:02,705 INFO L225 Difference]: With dead ends: 65 [2019-11-15 21:22:02,705 INFO L226 Difference]: Without dead ends: 61 [2019-11-15 21:22:02,705 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:22:02,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-15 21:22:02,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-15 21:22:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 21:22:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2019-11-15 21:22:02,722 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 105 [2019-11-15 21:22:02,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:02,723 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2019-11-15 21:22:02,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 21:22:02,724 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2019-11-15 21:22:02,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-15 21:22:02,728 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:22:02,729 INFO L380 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2019-11-15 21:22:02,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:22:02,934 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:22:02,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:22:02,934 INFO L82 PathProgramCache]: Analyzing trace with hash 418459252, now seen corresponding path program 7 times [2019-11-15 21:22:02,935 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:22:02,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799630037] [2019-11-15 21:22:02,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:02,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:02,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:22:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-11-15 21:22:03,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799630037] [2019-11-15 21:22:03,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167600983] [2019-11-15 21:22:03,317 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:22:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:03,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 21:22:03,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:22:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-11-15 21:22:03,451 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:22:03,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 16 [2019-11-15 21:22:03,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899538619] [2019-11-15 21:22:03,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 21:22:03,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:22:03,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 21:22:03,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:22:03,454 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand 16 states. [2019-11-15 21:22:03,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:03,651 INFO L93 Difference]: Finished difference Result 179 states and 251 transitions. [2019-11-15 21:22:03,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:22:03,653 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 173 [2019-11-15 21:22:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:03,658 INFO L225 Difference]: With dead ends: 179 [2019-11-15 21:22:03,658 INFO L226 Difference]: Without dead ends: 175 [2019-11-15 21:22:03,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:22:03,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-15 21:22:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 163. [2019-11-15 21:22:03,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 21:22:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 228 transitions. [2019-11-15 21:22:03,701 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 228 transitions. Word has length 173 [2019-11-15 21:22:03,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:03,702 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 228 transitions. [2019-11-15 21:22:03,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 21:22:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 228 transitions. [2019-11-15 21:22:03,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-15 21:22:03,708 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:22:03,708 INFO L380 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2019-11-15 21:22:03,912 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:22:03,913 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:22:03,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:22:03,915 INFO L82 PathProgramCache]: Analyzing trace with hash 675718022, now seen corresponding path program 8 times [2019-11-15 21:22:03,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:22:03,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780547716] [2019-11-15 21:22:03,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:03,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:03,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:22:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:22:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-11-15 21:22:04,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780547716] [2019-11-15 21:22:04,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979397707] [2019-11-15 21:22:04,508 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:22:04,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:22:04,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:22:04,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 21:22:04,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:22:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-11-15 21:22:04,752 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:22:04,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 18 [2019-11-15 21:22:04,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292642553] [2019-11-15 21:22:04,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 21:22:04,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:22:04,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 21:22:04,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-11-15 21:22:04,756 INFO L87 Difference]: Start difference. First operand 163 states and 228 transitions. Second operand 18 states. [2019-11-15 21:22:04,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:22:04,992 INFO L93 Difference]: Finished difference Result 416 states and 627 transitions. [2019-11-15 21:22:04,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 21:22:04,993 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 282 [2019-11-15 21:22:04,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:22:05,003 INFO L225 Difference]: With dead ends: 416 [2019-11-15 21:22:05,003 INFO L226 Difference]: Without dead ends: 412 [2019-11-15 21:22:05,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-11-15 21:22:05,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-11-15 21:22:05,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 397. [2019-11-15 21:22:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-15 21:22:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 599 transitions. [2019-11-15 21:22:05,082 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 599 transitions. Word has length 282 [2019-11-15 21:22:05,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:22:05,083 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 599 transitions. [2019-11-15 21:22:05,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 21:22:05,083 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 599 transitions. [2019-11-15 21:22:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-11-15 21:22:05,094 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:22:05,094 INFO L380 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1] [2019-11-15 21:22:05,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:22:05,305 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:22:05,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:22:05,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1653353793, now seen corresponding path program 9 times [2019-11-15 21:22:05,306 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:22:05,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739653041] [2019-11-15 21:22:05,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:05,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:22:05,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:22:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:22:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:22:05,478 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:22:05,478 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:22:05,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:22:05 BoogieIcfgContainer [2019-11-15 21:22:05,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:22:05,581 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:22:05,581 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:22:05,581 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:22:05,582 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:21:56" (3/4) ... [2019-11-15 21:22:05,584 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 21:22:05,719 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6ca9f134-acd5-4668-a280-10be4a3600ff/bin/uautomizer/witness.graphml [2019-11-15 21:22:05,719 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:22:05,722 INFO L168 Benchmark]: Toolchain (without parser) took 9707.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 942.0 MB in the beginning and 1.0 GB in the end (delta: -74.0 MB). Peak memory consumption was 137.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:22:05,723 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:22:05,723 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -192.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:22:05,723 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.51 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:22:05,724 INFO L168 Benchmark]: Boogie Preprocessor took 19.55 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:22:05,724 INFO L168 Benchmark]: RCFGBuilder took 197.85 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.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:22:05,725 INFO L168 Benchmark]: TraceAbstraction took 8955.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 82.2 MB). Peak memory consumption was 158.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:22:05,725 INFO L168 Benchmark]: Witness Printer took 138.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:22:05,727 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -192.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.51 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.55 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 197.85 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.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8955.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 82.2 MB). Peak memory consumption was 158.2 MB. Max. memory is 11.5 GB. * Witness Printer took 138.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 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, 18 locations, 1 error locations. Result: UNSAFE, OverallTime: 8.9s, OverallIterations: 12, TraceHistogramMax: 67, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 174 SDtfs, 481 SDslu, 572 SDs, 0 SdLazy, 1362 SolverSat, 458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1353 GetRequests, 1194 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=397occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 45 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2336 NumberOfCodeBlocks, 2255 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1857 ConstructedInterpolants, 0 QuantifiedInterpolants, 500711 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1924 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 12029/16826 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...