./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0bc64117ef8398002009c167867d7baf0a85044 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:57:04,478 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:57:04,480 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:57:04,489 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:57:04,490 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:57:04,490 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:57:04,492 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:57:04,493 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:57:04,494 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:57:04,495 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:57:04,496 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:57:04,496 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:57:04,497 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:57:04,498 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:57:04,499 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:57:04,499 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:57:04,500 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:57:04,502 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:57:04,503 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:57:04,505 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:57:04,506 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:57:04,507 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:57:04,509 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:57:04,509 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:57:04,509 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:57:04,510 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:57:04,511 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:57:04,511 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:57:04,512 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:57:04,513 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:57:04,513 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:57:04,514 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:57:04,514 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:57:04,514 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:57:04,515 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:57:04,516 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:57:04,516 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 21:57:04,527 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:57:04,528 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:57:04,528 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:57:04,529 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 21:57:04,529 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 21:57:04,529 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 21:57:04,529 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 21:57:04,529 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 21:57:04,529 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 21:57:04,529 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 21:57:04,530 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 21:57:04,530 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:57:04,530 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:57:04,530 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:57:04,531 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:57:04,531 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:57:04,531 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:57:04,531 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:57:04,531 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:57:04,531 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:57:04,531 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:57:04,531 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:57:04,532 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:57:04,532 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:57:04,532 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:57:04,534 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:57:04,534 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:57:04,535 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:57:04,535 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:57:04,535 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:57:04,535 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 21:57:04,535 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:57:04,535 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:57:04,535 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:57:04,535 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0bc64117ef8398002009c167867d7baf0a85044 [2018-10-26 21:57:04,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:57:04,574 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:57:04,577 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:57:04,578 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:57:04,579 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:57:04,579 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-10-26 21:57:04,624 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/data/f3e05eda2/8dc6b8d5a5414830a4ccd5ecf048ba4b/FLAG6ad07de88 [2018-10-26 21:57:05,002 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:57:05,003 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-10-26 21:57:05,007 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/data/f3e05eda2/8dc6b8d5a5414830a4ccd5ecf048ba4b/FLAG6ad07de88 [2018-10-26 21:57:05,017 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/data/f3e05eda2/8dc6b8d5a5414830a4ccd5ecf048ba4b [2018-10-26 21:57:05,020 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:57:05,021 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:57:05,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:57:05,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:57:05,026 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:57:05,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:57:05" (1/1) ... [2018-10-26 21:57:05,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@255b6356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:57:05, skipping insertion in model container [2018-10-26 21:57:05,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:57:05" (1/1) ... [2018-10-26 21:57:05,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:57:05,050 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:57:05,172 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:57:05,175 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:57:05,187 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:57:05,197 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:57:05,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:57:05 WrapperNode [2018-10-26 21:57:05,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:57:05,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:57:05,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:57:05,199 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:57:05,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:57:05" (1/1) ... [2018-10-26 21:57:05,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:57:05" (1/1) ... [2018-10-26 21:57:05,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:57:05,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:57:05,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:57:05,218 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:57:05,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:57:05" (1/1) ... [2018-10-26 21:57:05,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:57:05" (1/1) ... [2018-10-26 21:57:05,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:57:05" (1/1) ... [2018-10-26 21:57:05,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:57:05" (1/1) ... [2018-10-26 21:57:05,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:57:05" (1/1) ... [2018-10-26 21:57:05,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:57:05" (1/1) ... [2018-10-26 21:57:05,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:57:05" (1/1) ... [2018-10-26 21:57:05,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:57:05,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:57:05,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:57:05,237 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:57:05,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:57:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:57:05,387 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-10-26 21:57:05,388 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-10-26 21:57:05,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 21:57:05,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 21:57:05,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:57:05,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:57:05,389 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 21:57:05,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 21:57:05,800 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:57:05,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:57:05 BoogieIcfgContainer [2018-10-26 21:57:05,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:57:05,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:57:05,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:57:05,805 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:57:05,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:57:05" (1/3) ... [2018-10-26 21:57:05,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d32bc35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:57:05, skipping insertion in model container [2018-10-26 21:57:05,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:57:05" (2/3) ... [2018-10-26 21:57:05,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d32bc35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:57:05, skipping insertion in model container [2018-10-26 21:57:05,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:57:05" (3/3) ... [2018-10-26 21:57:05,808 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-10-26 21:57:05,817 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:57:05,824 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:57:05,838 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:57:05,866 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:57:05,866 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:57:05,866 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:57:05,866 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:57:05,866 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:57:05,866 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:57:05,866 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:57:05,866 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:57:05,881 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-26 21:57:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 21:57:05,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:57:05,887 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:57:05,889 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:57:05,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:57:05,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2018-10-26 21:57:05,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:57:05,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:05,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:57:05,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:05,951 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:57:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:57:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:57:06,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:57:06,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:57:06,077 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:57:06,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:57:06,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:57:06,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:57:06,091 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-10-26 21:57:06,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:57:06,223 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-10-26 21:57:06,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:57:06,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-26 21:57:06,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:57:06,233 INFO L225 Difference]: With dead ends: 35 [2018-10-26 21:57:06,234 INFO L226 Difference]: Without dead ends: 21 [2018-10-26 21:57:06,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:57:06,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-26 21:57:06,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-26 21:57:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-26 21:57:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-10-26 21:57:06,271 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-10-26 21:57:06,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:57:06,272 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-10-26 21:57:06,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:57:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-10-26 21:57:06,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 21:57:06,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:57:06,273 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:57:06,274 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:57:06,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:57:06,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2018-10-26 21:57:06,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:57:06,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:06,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:57:06,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:06,275 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:57:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:57:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:57:06,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:57:06,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:57:06,331 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:57:06,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:57:06,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:57:06,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:57:06,338 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-10-26 21:57:06,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:57:06,595 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-10-26 21:57:06,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:57:06,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-26 21:57:06,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:57:06,596 INFO L225 Difference]: With dead ends: 27 [2018-10-26 21:57:06,597 INFO L226 Difference]: Without dead ends: 23 [2018-10-26 21:57:06,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:57:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-26 21:57:06,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-10-26 21:57:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-26 21:57:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-10-26 21:57:06,603 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-10-26 21:57:06,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:57:06,603 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-10-26 21:57:06,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:57:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-10-26 21:57:06,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 21:57:06,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:57:06,606 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:57:06,606 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:57:06,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:57:06,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2018-10-26 21:57:06,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:57:06,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:06,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:57:06,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:06,608 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:57:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:57:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 21:57:06,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:06,742 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:57:06,743 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-10-26 21:57:06,745 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [13], [14], [18], [20], [24], [26], [29], [30], [31], [32], [33], [34], [35], [37], [38] [2018-10-26 21:57:06,791 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:57:06,791 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:57:06,924 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 21:57:06,924 INFO L272 AbstractInterpreter]: Visited 16 different actions 31 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-10-26 21:57:06,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:57:06,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 21:57:06,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:06,941 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:57:06,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:57:06,951 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 21:57:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:57:06,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:57:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 21:57:07,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:57:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 21:57:07,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:57:07,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2018-10-26 21:57:07,497 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:57:07,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 21:57:07,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 21:57:07,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:57:07,498 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-10-26 21:57:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:57:07,817 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-10-26 21:57:07,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 21:57:07,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-10-26 21:57:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:57:07,818 INFO L225 Difference]: With dead ends: 38 [2018-10-26 21:57:07,818 INFO L226 Difference]: Without dead ends: 23 [2018-10-26 21:57:07,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-10-26 21:57:07,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-26 21:57:07,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-26 21:57:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-26 21:57:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-10-26 21:57:07,822 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-10-26 21:57:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:57:07,823 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-26 21:57:07,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 21:57:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-10-26 21:57:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:57:07,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:57:07,824 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:57:07,824 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:57:07,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:57:07,825 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2018-10-26 21:57:07,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:57:07,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:07,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:57:07,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:07,826 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:57:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:57:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 21:57:07,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:07,880 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:57:07,880 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-10-26 21:57:07,881 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [13], [14], [18], [20], [24], [26], [29], [30], [31], [32], [33], [34], [35], [37], [38] [2018-10-26 21:57:07,882 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 21:57:07,882 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 21:57:10,994 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 21:57:10,996 INFO L272 AbstractInterpreter]: Visited 22 different actions 6846 times. Merged at 10 different actions 1830 times. Never widened. Found 730 fixpoints after 5 different actions. Largest state had 5 variables. [2018-10-26 21:57:11,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:57:11,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 21:57:11,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:11,042 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 21:57:11,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:57:11,052 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:57:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:57:11,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:57:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 21:57:11,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:57:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 21:57:11,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:57:11,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2018-10-26 21:57:11,311 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:57:11,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:57:11,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:57:11,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-26 21:57:11,312 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-10-26 21:57:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:57:11,408 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-10-26 21:57:11,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:57:11,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-10-26 21:57:11,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:57:11,410 INFO L225 Difference]: With dead ends: 32 [2018-10-26 21:57:11,410 INFO L226 Difference]: Without dead ends: 28 [2018-10-26 21:57:11,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:57:11,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-26 21:57:11,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-26 21:57:11,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-26 21:57:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-10-26 21:57:11,417 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-10-26 21:57:11,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:57:11,418 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-10-26 21:57:11,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:57:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-10-26 21:57:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:57:11,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:57:11,419 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:57:11,419 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:57:11,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:57:11,420 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2018-10-26 21:57:11,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:57:11,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:11,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:57:11,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:11,421 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:57:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:57:11,563 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 21:57:11,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:11,563 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:57:11,563 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:57:11,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:57:11,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:11,564 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:57:11,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 21:57:11,572 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 21:57:11,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-26 21:57:11,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:57:11,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:57:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 21:57:11,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:57:11,835 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 21:57:11,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:57:11,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2018-10-26 21:57:11,859 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:57:11,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:57:11,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:57:11,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-26 21:57:11,860 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 6 states. [2018-10-26 21:57:11,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:57:11,910 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2018-10-26 21:57:11,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:57:11,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-10-26 21:57:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:57:11,914 INFO L225 Difference]: With dead ends: 38 [2018-10-26 21:57:11,914 INFO L226 Difference]: Without dead ends: 34 [2018-10-26 21:57:11,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:57:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-26 21:57:11,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-10-26 21:57:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-26 21:57:11,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-10-26 21:57:11,920 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 40 [2018-10-26 21:57:11,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:57:11,920 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-10-26 21:57:11,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:57:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-10-26 21:57:11,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 21:57:11,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:57:11,922 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:57:11,922 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:57:11,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:57:11,922 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2018-10-26 21:57:11,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:57:11,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:11,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 21:57:11,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:11,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:57:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:57:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 21:57:12,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:12,025 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:57:12,025 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:57:12,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:57:12,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:12,026 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:57:12,032 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 21:57:12,033 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-26 21:57:12,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 21:57:12,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:57:12,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:57:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 21:57:12,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:57:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 21:57:12,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:57:12,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 12 [2018-10-26 21:57:12,377 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:57:12,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:57:12,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:57:12,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:57:12,378 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 7 states. [2018-10-26 21:57:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:57:12,470 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2018-10-26 21:57:12,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 21:57:12,470 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-10-26 21:57:12,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:57:12,471 INFO L225 Difference]: With dead ends: 40 [2018-10-26 21:57:12,471 INFO L226 Difference]: Without dead ends: 36 [2018-10-26 21:57:12,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-10-26 21:57:12,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-26 21:57:12,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-10-26 21:57:12,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-26 21:57:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-10-26 21:57:12,478 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 41 [2018-10-26 21:57:12,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:57:12,479 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-10-26 21:57:12,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:57:12,479 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-10-26 21:57:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-26 21:57:12,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:57:12,481 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 8, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:57:12,481 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:57:12,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:57:12,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1317930072, now seen corresponding path program 4 times [2018-10-26 21:57:12,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:57:12,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:12,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 21:57:12,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:12,483 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:57:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:57:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 57 proven. 95 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-10-26 21:57:12,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:12,611 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:57:12,611 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:57:12,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:57:12,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:12,611 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:57:12,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:57:12,619 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 21:57:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:57:12,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:57:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 27 proven. 154 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-10-26 21:57:12,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:57:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 27 proven. 169 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-10-26 21:57:13,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:57:13,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 20 [2018-10-26 21:57:13,500 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:57:13,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 21:57:13,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 21:57:13,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-10-26 21:57:13,501 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 14 states. [2018-10-26 21:57:13,674 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-26 21:57:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:57:14,032 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2018-10-26 21:57:14,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 21:57:14,033 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 93 [2018-10-26 21:57:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:57:14,035 INFO L225 Difference]: With dead ends: 79 [2018-10-26 21:57:14,035 INFO L226 Difference]: Without dead ends: 50 [2018-10-26 21:57:14,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 169 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=285, Invalid=771, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 21:57:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-26 21:57:14,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-10-26 21:57:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-26 21:57:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2018-10-26 21:57:14,046 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 93 [2018-10-26 21:57:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:57:14,047 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2018-10-26 21:57:14,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 21:57:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2018-10-26 21:57:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 21:57:14,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:57:14,048 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:57:14,049 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:57:14,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:57:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 5 times [2018-10-26 21:57:14,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:57:14,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:14,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:57:14,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:14,050 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:57:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:57:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 174 proven. 59 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-10-26 21:57:14,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:14,159 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:57:14,159 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:57:14,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:57:14,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:14,160 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:57:14,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 21:57:14,170 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 21:57:14,192 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-26 21:57:14,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:57:14,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:57:14,222 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 41 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-10-26 21:57:14,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:57:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 50 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2018-10-26 21:57:14,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:57:14,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 13 [2018-10-26 21:57:14,560 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:57:14,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 21:57:14,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 21:57:14,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:57:14,561 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand 8 states. [2018-10-26 21:57:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:57:14,657 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2018-10-26 21:57:14,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 21:57:14,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2018-10-26 21:57:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:57:14,659 INFO L225 Difference]: With dead ends: 55 [2018-10-26 21:57:14,659 INFO L226 Difference]: Without dead ends: 51 [2018-10-26 21:57:14,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 212 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-10-26 21:57:14,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-26 21:57:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-10-26 21:57:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-26 21:57:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2018-10-26 21:57:14,669 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 109 [2018-10-26 21:57:14,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:57:14,669 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2018-10-26 21:57:14,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 21:57:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2018-10-26 21:57:14,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-26 21:57:14,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:57:14,670 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:57:14,671 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:57:14,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:57:14,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1066463687, now seen corresponding path program 6 times [2018-10-26 21:57:14,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:57:14,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:14,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 21:57:14,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:14,672 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:57:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:57:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 76 proven. 241 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2018-10-26 21:57:14,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:14,800 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:57:14,800 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:57:14,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:57:14,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:14,800 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:57:14,807 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 21:57:14,807 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-26 21:57:14,856 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 21:57:14,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:57:14,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:57:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 189 proven. 343 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2018-10-26 21:57:15,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:57:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 365 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-10-26 21:57:15,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:57:15,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 18] total 23 [2018-10-26 21:57:15,948 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:57:15,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 21:57:15,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 21:57:15,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-10-26 21:57:15,949 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand 15 states. [2018-10-26 21:57:16,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:57:16,305 INFO L93 Difference]: Finished difference Result 111 states and 177 transitions. [2018-10-26 21:57:16,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-26 21:57:16,306 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 136 [2018-10-26 21:57:16,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:57:16,307 INFO L225 Difference]: With dead ends: 111 [2018-10-26 21:57:16,307 INFO L226 Difference]: Without dead ends: 66 [2018-10-26 21:57:16,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 246 SyntacticMatches, 15 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=371, Invalid=1035, Unknown=0, NotChecked=0, Total=1406 [2018-10-26 21:57:16,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-26 21:57:16,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-10-26 21:57:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-26 21:57:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-10-26 21:57:16,313 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 136 [2018-10-26 21:57:16,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:57:16,313 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-10-26 21:57:16,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 21:57:16,314 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-10-26 21:57:16,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-26 21:57:16,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:57:16,316 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:57:16,316 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:57:16,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:57:16,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1120272490, now seen corresponding path program 7 times [2018-10-26 21:57:16,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:57:16,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:16,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 21:57:16,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:16,318 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:57:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:57:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 669 proven. 122 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2018-10-26 21:57:16,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:16,563 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:57:16,563 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:57:16,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:57:16,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:16,563 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:57:16,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:57:16,571 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 21:57:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:57:16,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:57:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 653 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-10-26 21:57:16,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:57:17,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 693 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2018-10-26 21:57:17,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:57:17,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 15] total 26 [2018-10-26 21:57:17,699 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:57:17,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-26 21:57:17,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-26 21:57:17,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2018-10-26 21:57:17,701 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 18 states. [2018-10-26 21:57:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:57:18,196 INFO L93 Difference]: Finished difference Result 144 states and 228 transitions. [2018-10-26 21:57:18,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-26 21:57:18,197 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 204 [2018-10-26 21:57:18,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:57:18,199 INFO L225 Difference]: With dead ends: 144 [2018-10-26 21:57:18,199 INFO L226 Difference]: Without dead ends: 86 [2018-10-26 21:57:18,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 387 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=508, Invalid=1562, Unknown=0, NotChecked=0, Total=2070 [2018-10-26 21:57:18,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-26 21:57:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2018-10-26 21:57:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-26 21:57:18,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2018-10-26 21:57:18,211 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 204 [2018-10-26 21:57:18,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:57:18,211 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2018-10-26 21:57:18,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-26 21:57:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2018-10-26 21:57:18,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-26 21:57:18,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:57:18,218 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:57:18,218 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:57:18,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:57:18,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1795105459, now seen corresponding path program 8 times [2018-10-26 21:57:18,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:57:18,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:18,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:57:18,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:18,219 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:57:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:57:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 238 proven. 1112 refuted. 0 times theorem prover too weak. 4689 trivial. 0 not checked. [2018-10-26 21:57:18,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:18,425 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:57:18,425 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:57:18,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:57:18,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:18,426 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:57:18,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 21:57:18,434 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 21:57:18,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-26 21:57:18,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:57:18,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:57:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1187 proven. 123 refuted. 0 times theorem prover too weak. 4729 trivial. 0 not checked. [2018-10-26 21:57:18,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:57:19,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1187 proven. 134 refuted. 0 times theorem prover too weak. 4718 trivial. 0 not checked. [2018-10-26 21:57:19,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:57:19,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 20 [2018-10-26 21:57:19,985 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:57:19,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 21:57:19,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 21:57:19,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-10-26 21:57:19,987 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand 15 states. [2018-10-26 21:57:20,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:57:20,442 INFO L93 Difference]: Finished difference Result 182 states and 280 transitions. [2018-10-26 21:57:20,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-26 21:57:20,443 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 327 [2018-10-26 21:57:20,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:57:20,444 INFO L225 Difference]: With dead ends: 182 [2018-10-26 21:57:20,444 INFO L226 Difference]: Without dead ends: 103 [2018-10-26 21:57:20,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 639 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2018-10-26 21:57:20,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-26 21:57:20,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2018-10-26 21:57:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-26 21:57:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2018-10-26 21:57:20,458 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 327 [2018-10-26 21:57:20,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:57:20,459 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2018-10-26 21:57:20,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 21:57:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2018-10-26 21:57:20,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-10-26 21:57:20,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:57:20,469 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:57:20,470 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:57:20,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:57:20,470 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2018-10-26 21:57:20,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:57:20,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:20,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 21:57:20,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:20,471 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:57:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:57:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2762 proven. 751 refuted. 0 times theorem prover too weak. 12894 trivial. 0 not checked. [2018-10-26 21:57:20,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:20,928 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 21:57:20,928 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 21:57:20,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 21:57:20,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:57:20,928 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:57:20,935 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 21:57:20,935 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-26 21:57:21,015 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 21:57:21,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 21:57:21,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:57:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1814 proven. 3252 refuted. 0 times theorem prover too weak. 11341 trivial. 0 not checked. [2018-10-26 21:57:21,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 21:57:22,000 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-26 21:57:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1809 proven. 3349 refuted. 0 times theorem prover too weak. 11249 trivial. 0 not checked. [2018-10-26 21:57:24,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 21:57:24,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 30] total 37 [2018-10-26 21:57:24,553 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 21:57:24,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-26 21:57:24,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-26 21:57:24,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2018-10-26 21:57:24,555 INFO L87 Difference]: Start difference. First operand 96 states and 130 transitions. Second operand 23 states. [2018-10-26 21:57:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:57:25,233 INFO L93 Difference]: Finished difference Result 229 states and 395 transitions. [2018-10-26 21:57:25,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-26 21:57:25,234 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 531 [2018-10-26 21:57:25,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:57:25,236 INFO L225 Difference]: With dead ends: 229 [2018-10-26 21:57:25,236 INFO L226 Difference]: Without dead ends: 139 [2018-10-26 21:57:25,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1112 GetRequests, 1019 SyntacticMatches, 28 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1071, Invalid=3351, Unknown=0, NotChecked=0, Total=4422 [2018-10-26 21:57:25,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-26 21:57:25,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 110. [2018-10-26 21:57:25,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-26 21:57:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2018-10-26 21:57:25,251 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 531 [2018-10-26 21:57:25,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:57:25,253 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2018-10-26 21:57:25,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-26 21:57:25,254 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2018-10-26 21:57:25,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-10-26 21:57:25,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:57:25,256 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:57:25,256 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:57:25,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:57:25,257 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2018-10-26 21:57:25,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:57:25,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:25,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 21:57:25,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:57:25,258 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:57:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:57:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:57:25,359 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 21:57:25,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:57:25 BoogieIcfgContainer [2018-10-26 21:57:25,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:57:25,440 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 21:57:25,440 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 21:57:25,440 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 21:57:25,442 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:57:05" (3/4) ... [2018-10-26 21:57:25,444 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 21:57:25,538 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_227ce248-581b-4254-8762-1d0302075e18/bin-2019/utaipan/witness.graphml [2018-10-26 21:57:25,538 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 21:57:25,539 INFO L168 Benchmark]: Toolchain (without parser) took 20518.65 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 668.5 MB). Free memory was 954.4 MB in the beginning and 1.2 GB in the end (delta: -236.1 MB). Peak memory consumption was 432.4 MB. Max. memory is 11.5 GB. [2018-10-26 21:57:25,539 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:57:25,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.57 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:57:25,540 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.35 ms. Allocated memory is still 1.0 GB. Free memory is still 943.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:57:25,540 INFO L168 Benchmark]: Boogie Preprocessor took 18.38 ms. Allocated memory is still 1.0 GB. Free memory was 943.7 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 21:57:25,544 INFO L168 Benchmark]: RCFGBuilder took 564.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 941.0 MB in the beginning and 1.2 GB in the end (delta: -219.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-10-26 21:57:25,544 INFO L168 Benchmark]: TraceAbstraction took 19637.45 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 492.8 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -46.5 MB). Peak memory consumption was 446.3 MB. Max. memory is 11.5 GB. [2018-10-26 21:57:25,545 INFO L168 Benchmark]: Witness Printer took 98.39 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-10-26 21:57:25,546 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 176.57 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.35 ms. Allocated memory is still 1.0 GB. Free memory is still 943.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.38 ms. Allocated memory is still 1.0 GB. Free memory was 943.7 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 564.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 941.0 MB in the beginning and 1.2 GB in the end (delta: -219.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19637.45 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 492.8 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -46.5 MB). Peak memory consumption was 446.3 MB. Max. memory is 11.5 GB. * Witness Printer took 98.39 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] 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] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] 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] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L27] EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L31] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. UNSAFE Result, 19.5s OverallTime, 13 OverallIterations, 77 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 260 SDtfs, 697 SDslu, 1007 SDs, 0 SdLazy, 1855 SolverSat, 780 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3296 GetRequests, 2921 SyntacticMatches, 92 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2527 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 63 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 3558 NumberOfCodeBlocks, 3232 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 4597 ConstructedInterpolants, 0 QuantifiedInterpolants, 2065332 SizeOfPredicates, 67 NumberOfNonLiveVariables, 2640 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 68306/80136 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...