/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-1.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-8fc6572
[2020-07-10 14:55:31,353 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-07-10 14:55:31,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-07-10 14:55:31,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-07-10 14:55:31,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-07-10 14:55:31,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-07-10 14:55:31,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-07-10 14:55:31,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-07-10 14:55:31,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-07-10 14:55:31,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-07-10 14:55:31,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-07-10 14:55:31,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-07-10 14:55:31,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-07-10 14:55:31,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-07-10 14:55:31,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-07-10 14:55:31,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-07-10 14:55:31,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-07-10 14:55:31,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-07-10 14:55:31,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-07-10 14:55:31,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-07-10 14:55:31,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-07-10 14:55:31,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-07-10 14:55:31,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-07-10 14:55:31,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-07-10 14:55:31,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-07-10 14:55:31,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-07-10 14:55:31,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-07-10 14:55:31,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-07-10 14:55:31,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-07-10 14:55:31,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-07-10 14:55:31,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-07-10 14:55:31,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-07-10 14:55:31,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-07-10 14:55:31,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-07-10 14:55:31,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-07-10 14:55:31,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-07-10 14:55:31,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-07-10 14:55:31,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-07-10 14:55:31,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-07-10 14:55:31,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-07-10 14:55:31,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-07-10 14:55:31,406 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-07-10 14:55:31,421 INFO L113 SettingsManager]: Loading preferences was successful
[2020-07-10 14:55:31,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-07-10 14:55:31,423 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-07-10 14:55:31,423 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2020-07-10 14:55:31,423 INFO L138 SettingsManager]: * Use SBE=true
[2020-07-10 14:55:31,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-07-10 14:55:31,424 INFO L138 SettingsManager]: * sizeof long=4
[2020-07-10 14:55:31,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-07-10 14:55:31,424 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-07-10 14:55:31,425 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-07-10 14:55:31,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-07-10 14:55:31,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-07-10 14:55:31,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-07-10 14:55:31,425 INFO L138 SettingsManager]: * sizeof long double=12
[2020-07-10 14:55:31,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-07-10 14:55:31,426 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-07-10 14:55:31,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-07-10 14:55:31,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-07-10 14:55:31,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2020-07-10 14:55:31,427 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-07-10 14:55:31,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-07-10 14:55:31,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-10 14:55:31,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-07-10 14:55:31,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2020-07-10 14:55:31,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-07-10 14:55:31,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2020-07-10 14:55:31,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-10 14:55:31,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-07-10 14:55:31,428 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2020-07-10 14:55:31,429 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2020-07-10 14:55:31,723 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2020-07-10 14:55:31,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-07-10 14:55:31,742 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-07-10 14:55:31,744 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-07-10 14:55:31,744 INFO L275 PluginConnector]: CDTParser initialized
[2020-07-10 14:55:31,745 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-1.c
[2020-07-10 14:55:31,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2aed37c/e1e47fb921bb413cb429ad26d0e081c0/FLAGffb879a33
[2020-07-10 14:55:32,357 INFO L306 CDTParser]: Found 1 translation units.
[2020-07-10 14:55:32,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_2-1.c
[2020-07-10 14:55:32,365 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2aed37c/e1e47fb921bb413cb429ad26d0e081c0/FLAGffb879a33
[2020-07-10 14:55:32,745 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2aed37c/e1e47fb921bb413cb429ad26d0e081c0
[2020-07-10 14:55:32,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-07-10 14:55:32,762 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2020-07-10 14:55:32,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-07-10 14:55:32,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-07-10 14:55:32,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-07-10 14:55:32,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:55:32" (1/1) ...
[2020-07-10 14:55:32,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b6b2236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:32, skipping insertion in model container
[2020-07-10 14:55:32,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:55:32" (1/1) ...
[2020-07-10 14:55:32,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-07-10 14:55:32,803 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-07-10 14:55:32,972 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-07-10 14:55:32,977 INFO L203 MainTranslator]: Completed pre-run
[2020-07-10 14:55:32,993 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-07-10 14:55:33,008 INFO L208 MainTranslator]: Completed translation
[2020-07-10 14:55:33,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:33 WrapperNode
[2020-07-10 14:55:33,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-07-10 14:55:33,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-07-10 14:55:33,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-07-10 14:55:33,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-07-10 14:55:33,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:33" (1/1) ...
[2020-07-10 14:55:33,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:33" (1/1) ...
[2020-07-10 14:55:33,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:33" (1/1) ...
[2020-07-10 14:55:33,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:33" (1/1) ...
[2020-07-10 14:55:33,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:33" (1/1) ...
[2020-07-10 14:55:33,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:33" (1/1) ...
[2020-07-10 14:55:33,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:33" (1/1) ...
[2020-07-10 14:55:33,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-07-10 14:55:33,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-07-10 14:55:33,144 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-07-10 14:55:33,144 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-07-10 14:55:33,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:33" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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
[2020-07-10 14:55:33,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-07-10 14:55:33,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-07-10 14:55:33,217 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1
[2020-07-10 14:55:33,218 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2
[2020-07-10 14:55:33,218 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2020-07-10 14:55:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-07-10 14:55:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-07-10 14:55:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1
[2020-07-10 14:55:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2
[2020-07-10 14:55:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2020-07-10 14:55:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-07-10 14:55:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-07-10 14:55:33,540 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-07-10 14:55:33,540 INFO L295 CfgBuilder]: Removed 0 assume(true) statements.
[2020-07-10 14:55:33,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:55:33 BoogieIcfgContainer
[2020-07-10 14:55:33,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-07-10 14:55:33,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-07-10 14:55:33,546 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-07-10 14:55:33,550 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-07-10 14:55:33,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:55:32" (1/3) ...
[2020-07-10 14:55:33,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b55eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:55:33, skipping insertion in model container
[2020-07-10 14:55:33,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:55:33" (2/3) ...
[2020-07-10 14:55:33,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b55eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:55:33, skipping insertion in model container
[2020-07-10 14:55:33,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:55:33" (3/3) ...
[2020-07-10 14:55:33,554 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-1.c
[2020-07-10 14:55:33,568 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-07-10 14:55:33,576 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-07-10 14:55:33,592 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-07-10 14:55:33,620 INFO L375 AbstractCegarLoop]: Interprodecural is true
[2020-07-10 14:55:33,620 INFO L376 AbstractCegarLoop]: Hoare is true
[2020-07-10 14:55:33,620 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-07-10 14:55:33,621 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-07-10 14:55:33,621 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-07-10 14:55:33,621 INFO L380 AbstractCegarLoop]: Difference is false
[2020-07-10 14:55:33,621 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-07-10 14:55:33,621 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-07-10 14:55:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states.
[2020-07-10 14:55:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-07-10 14:55:33,657 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-10 14:55:33,658 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-10 14:55:33,658 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 14:55:33,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 14:55:33,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times
[2020-07-10 14:55:33,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-10 14:55:33,682 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538569209]
[2020-07-10 14:55:33,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 14:55:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 14:55:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 14:55:33,913 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} assume true; {36#true} is VALID
[2020-07-10 14:55:33,914 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {36#true} {36#true} #47#return; {36#true} is VALID
[2020-07-10 14:55:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 14:55:34,004 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} ~n := #in~n; {45#(= fibo1_~n |fibo1_#in~n|)} is VALID
[2020-07-10 14:55:34,006 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {46#(<= |fibo1_#in~n| 0)} is VALID
[2020-07-10 14:55:34,008 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#(<= |fibo1_#in~n| 0)} assume true; {46#(<= |fibo1_#in~n| 0)} is VALID
[2020-07-10 14:55:34,011 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {46#(<= |fibo1_#in~n| 0)} {40#(<= 2 main_~x~0)} #51#return; {37#false} is VALID
[2020-07-10 14:55:34,012 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID
[2020-07-10 14:55:34,012 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID
[2020-07-10 14:55:34,013 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #47#return; {36#true} is VALID
[2020-07-10 14:55:34,013 INFO L263 TraceCheckUtils]: 3: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID
[2020-07-10 14:55:34,015 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#true} ~x~0 := 2; {40#(<= 2 main_~x~0)} is VALID
[2020-07-10 14:55:34,015 INFO L263 TraceCheckUtils]: 5: Hoare triple {40#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {36#true} is VALID
[2020-07-10 14:55:34,016 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} ~n := #in~n; {45#(= fibo1_~n |fibo1_#in~n|)} is VALID
[2020-07-10 14:55:34,017 INFO L280 TraceCheckUtils]: 7: Hoare triple {45#(= fibo1_~n |fibo1_#in~n|)} assume ~n < 1;#res := 0; {46#(<= |fibo1_#in~n| 0)} is VALID
[2020-07-10 14:55:34,018 INFO L280 TraceCheckUtils]: 8: Hoare triple {46#(<= |fibo1_#in~n| 0)} assume true; {46#(<= |fibo1_#in~n| 0)} is VALID
[2020-07-10 14:55:34,020 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {46#(<= |fibo1_#in~n| 0)} {40#(<= 2 main_~x~0)} #51#return; {37#false} is VALID
[2020-07-10 14:55:34,020 INFO L280 TraceCheckUtils]: 10: Hoare triple {37#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {37#false} is VALID
[2020-07-10 14:55:34,021 INFO L280 TraceCheckUtils]: 11: Hoare triple {37#false} assume 1 == ~result~0; {37#false} is VALID
[2020-07-10 14:55:34,022 INFO L280 TraceCheckUtils]: 12: Hoare triple {37#false} assume !false; {37#false} is VALID
[2020-07-10 14:55:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-10 14:55:34,024 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538569209]
[2020-07-10 14:55:34,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-10 14:55:34,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-07-10 14:55:34,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102247292]
[2020-07-10 14:55:34,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2020-07-10 14:55:34,037 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-10 14:55:34,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states.
[2020-07-10 14:55:34,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 14:55:34,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-07-10 14:55:34,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-10 14:55:34,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-07-10 14:55:34,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-07-10 14:55:34,104 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states.
[2020-07-10 14:55:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 14:55:34,433 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions.
[2020-07-10 14:55:34,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-07-10 14:55:34,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2020-07-10 14:55:34,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 14:55:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-07-10 14:55:34,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions.
[2020-07-10 14:55:34,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-07-10 14:55:34,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions.
[2020-07-10 14:55:34,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions.
[2020-07-10 14:55:34,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 14:55:34,567 INFO L225 Difference]: With dead ends: 44
[2020-07-10 14:55:34,568 INFO L226 Difference]: Without dead ends: 30
[2020-07-10 14:55:34,572 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-07-10 14:55:34,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2020-07-10 14:55:34,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2020-07-10 14:55:34,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 14:55:34,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states.
[2020-07-10 14:55:34,628 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states.
[2020-07-10 14:55:34,629 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states.
[2020-07-10 14:55:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 14:55:34,637 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions.
[2020-07-10 14:55:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions.
[2020-07-10 14:55:34,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 14:55:34,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 14:55:34,639 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states.
[2020-07-10 14:55:34,639 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states.
[2020-07-10 14:55:34,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 14:55:34,646 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions.
[2020-07-10 14:55:34,646 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions.
[2020-07-10 14:55:34,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 14:55:34,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 14:55:34,648 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-10 14:55:34,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 14:55:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2020-07-10 14:55:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions.
[2020-07-10 14:55:34,670 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13
[2020-07-10 14:55:34,670 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-10 14:55:34,670 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions.
[2020-07-10 14:55:34,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-07-10 14:55:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions.
[2020-07-10 14:55:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-07-10 14:55:34,672 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-10 14:55:34,672 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-10 14:55:34,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-07-10 14:55:34,673 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 14:55:34,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 14:55:34,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times
[2020-07-10 14:55:34,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-10 14:55:34,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607967415]
[2020-07-10 14:55:34,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 14:55:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 14:55:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 14:55:34,716 INFO L280 TraceCheckUtils]: 0: Hoare triple {207#true} assume true; {207#true} is VALID
[2020-07-10 14:55:34,717 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {207#true} {207#true} #47#return; {207#true} is VALID
[2020-07-10 14:55:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 14:55:34,756 INFO L280 TraceCheckUtils]: 0: Hoare triple {207#true} ~n := #in~n; {217#(= fibo1_~n |fibo1_#in~n|)} is VALID
[2020-07-10 14:55:34,757 INFO L280 TraceCheckUtils]: 1: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {217#(= fibo1_~n |fibo1_#in~n|)} is VALID
[2020-07-10 14:55:34,758 INFO L280 TraceCheckUtils]: 2: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {218#(<= |fibo1_#in~n| 1)} is VALID
[2020-07-10 14:55:34,759 INFO L280 TraceCheckUtils]: 3: Hoare triple {218#(<= |fibo1_#in~n| 1)} assume true; {218#(<= |fibo1_#in~n| 1)} is VALID
[2020-07-10 14:55:34,760 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {218#(<= |fibo1_#in~n| 1)} {211#(<= 2 main_~x~0)} #51#return; {208#false} is VALID
[2020-07-10 14:55:34,761 INFO L263 TraceCheckUtils]: 0: Hoare triple {207#true} call ULTIMATE.init(); {207#true} is VALID
[2020-07-10 14:55:34,761 INFO L280 TraceCheckUtils]: 1: Hoare triple {207#true} assume true; {207#true} is VALID
[2020-07-10 14:55:34,762 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {207#true} {207#true} #47#return; {207#true} is VALID
[2020-07-10 14:55:34,762 INFO L263 TraceCheckUtils]: 3: Hoare triple {207#true} call #t~ret5 := main(); {207#true} is VALID
[2020-07-10 14:55:34,763 INFO L280 TraceCheckUtils]: 4: Hoare triple {207#true} ~x~0 := 2; {211#(<= 2 main_~x~0)} is VALID
[2020-07-10 14:55:34,763 INFO L263 TraceCheckUtils]: 5: Hoare triple {211#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {207#true} is VALID
[2020-07-10 14:55:34,764 INFO L280 TraceCheckUtils]: 6: Hoare triple {207#true} ~n := #in~n; {217#(= fibo1_~n |fibo1_#in~n|)} is VALID
[2020-07-10 14:55:34,765 INFO L280 TraceCheckUtils]: 7: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume !(~n < 1); {217#(= fibo1_~n |fibo1_#in~n|)} is VALID
[2020-07-10 14:55:34,766 INFO L280 TraceCheckUtils]: 8: Hoare triple {217#(= fibo1_~n |fibo1_#in~n|)} assume 1 == ~n;#res := 1; {218#(<= |fibo1_#in~n| 1)} is VALID
[2020-07-10 14:55:34,767 INFO L280 TraceCheckUtils]: 9: Hoare triple {218#(<= |fibo1_#in~n| 1)} assume true; {218#(<= |fibo1_#in~n| 1)} is VALID
[2020-07-10 14:55:34,768 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {218#(<= |fibo1_#in~n| 1)} {211#(<= 2 main_~x~0)} #51#return; {208#false} is VALID
[2020-07-10 14:55:34,769 INFO L280 TraceCheckUtils]: 11: Hoare triple {208#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {208#false} is VALID
[2020-07-10 14:55:34,769 INFO L280 TraceCheckUtils]: 12: Hoare triple {208#false} assume 1 == ~result~0; {208#false} is VALID
[2020-07-10 14:55:34,770 INFO L280 TraceCheckUtils]: 13: Hoare triple {208#false} assume !false; {208#false} is VALID
[2020-07-10 14:55:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-10 14:55:34,771 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607967415]
[2020-07-10 14:55:34,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-10 14:55:34,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-07-10 14:55:34,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319602188]
[2020-07-10 14:55:34,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2020-07-10 14:55:34,774 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-10 14:55:34,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states.
[2020-07-10 14:55:34,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 14:55:34,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-07-10 14:55:34,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-10 14:55:34,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-07-10 14:55:34,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-07-10 14:55:34,799 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states.
[2020-07-10 14:55:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 14:55:35,017 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions.
[2020-07-10 14:55:35,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-07-10 14:55:35,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2020-07-10 14:55:35,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 14:55:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-07-10 14:55:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions.
[2020-07-10 14:55:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-07-10 14:55:35,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions.
[2020-07-10 14:55:35,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions.
[2020-07-10 14:55:35,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 14:55:35,094 INFO L225 Difference]: With dead ends: 36
[2020-07-10 14:55:35,094 INFO L226 Difference]: Without dead ends: 32
[2020-07-10 14:55:35,096 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-07-10 14:55:35,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2020-07-10 14:55:35,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30.
[2020-07-10 14:55:35,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 14:55:35,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states.
[2020-07-10 14:55:35,115 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states.
[2020-07-10 14:55:35,115 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states.
[2020-07-10 14:55:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 14:55:35,120 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions.
[2020-07-10 14:55:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions.
[2020-07-10 14:55:35,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 14:55:35,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 14:55:35,122 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states.
[2020-07-10 14:55:35,122 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states.
[2020-07-10 14:55:35,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 14:55:35,127 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions.
[2020-07-10 14:55:35,127 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions.
[2020-07-10 14:55:35,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 14:55:35,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 14:55:35,129 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-10 14:55:35,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 14:55:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2020-07-10 14:55:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions.
[2020-07-10 14:55:35,133 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14
[2020-07-10 14:55:35,133 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-10 14:55:35,133 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions.
[2020-07-10 14:55:35,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-07-10 14:55:35,133 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions.
[2020-07-10 14:55:35,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2020-07-10 14:55:35,135 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-10 14:55:35,136 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-10 14:55:35,136 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-07-10 14:55:35,136 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 14:55:35,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 14:55:35,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times
[2020-07-10 14:55:35,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-10 14:55:35,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303461867]
[2020-07-10 14:55:35,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 14:55:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 14:55:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 14:55:35,188 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} assume true; {375#true} is VALID
[2020-07-10 14:55:35,189 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID
[2020-07-10 14:55:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 14:55:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 14:55:35,280 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID
[2020-07-10 14:55:35,281 INFO L280 TraceCheckUtils]: 1: Hoare triple {407#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID
[2020-07-10 14:55:35,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID
[2020-07-10 14:55:35,284 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {398#(< 1 fibo1_~n)} #57#return; {376#false} is VALID
[2020-07-10 14:55:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 14:55:35,291 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID
[2020-07-10 14:55:35,292 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID
[2020-07-10 14:55:35,292 INFO L280 TraceCheckUtils]: 2: Hoare triple {375#true} assume true; {375#true} is VALID
[2020-07-10 14:55:35,292 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID
[2020-07-10 14:55:35,293 INFO L280 TraceCheckUtils]: 0: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID
[2020-07-10 14:55:35,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume !(~n < 1); {397#(< 0 fibo1_~n)} is VALID
[2020-07-10 14:55:35,295 INFO L280 TraceCheckUtils]: 2: Hoare triple {397#(< 0 fibo1_~n)} assume !(1 == ~n); {398#(< 1 fibo1_~n)} is VALID
[2020-07-10 14:55:35,296 INFO L263 TraceCheckUtils]: 3: Hoare triple {398#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {375#true} is VALID
[2020-07-10 14:55:35,297 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID
[2020-07-10 14:55:35,298 INFO L280 TraceCheckUtils]: 5: Hoare triple {407#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID
[2020-07-10 14:55:35,298 INFO L280 TraceCheckUtils]: 6: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID
[2020-07-10 14:55:35,300 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {398#(< 1 fibo1_~n)} #57#return; {376#false} is VALID
[2020-07-10 14:55:35,300 INFO L280 TraceCheckUtils]: 8: Hoare triple {376#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {376#false} is VALID
[2020-07-10 14:55:35,301 INFO L263 TraceCheckUtils]: 9: Hoare triple {376#false} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID
[2020-07-10 14:55:35,301 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID
[2020-07-10 14:55:35,301 INFO L280 TraceCheckUtils]: 11: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID
[2020-07-10 14:55:35,302 INFO L280 TraceCheckUtils]: 12: Hoare triple {375#true} assume true; {375#true} is VALID
[2020-07-10 14:55:35,302 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID
[2020-07-10 14:55:35,302 INFO L280 TraceCheckUtils]: 14: Hoare triple {376#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {376#false} is VALID
[2020-07-10 14:55:35,303 INFO L280 TraceCheckUtils]: 15: Hoare triple {376#false} assume true; {376#false} is VALID
[2020-07-10 14:55:35,303 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {376#false} {379#(<= 2 main_~x~0)} #51#return; {376#false} is VALID
[2020-07-10 14:55:35,304 INFO L263 TraceCheckUtils]: 0: Hoare triple {375#true} call ULTIMATE.init(); {375#true} is VALID
[2020-07-10 14:55:35,304 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume true; {375#true} is VALID
[2020-07-10 14:55:35,305 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID
[2020-07-10 14:55:35,305 INFO L263 TraceCheckUtils]: 3: Hoare triple {375#true} call #t~ret5 := main(); {375#true} is VALID
[2020-07-10 14:55:35,306 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~x~0 := 2; {379#(<= 2 main_~x~0)} is VALID
[2020-07-10 14:55:35,307 INFO L263 TraceCheckUtils]: 5: Hoare triple {379#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {375#true} is VALID
[2020-07-10 14:55:35,307 INFO L280 TraceCheckUtils]: 6: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID
[2020-07-10 14:55:35,308 INFO L280 TraceCheckUtils]: 7: Hoare triple {375#true} assume !(~n < 1); {397#(< 0 fibo1_~n)} is VALID
[2020-07-10 14:55:35,309 INFO L280 TraceCheckUtils]: 8: Hoare triple {397#(< 0 fibo1_~n)} assume !(1 == ~n); {398#(< 1 fibo1_~n)} is VALID
[2020-07-10 14:55:35,309 INFO L263 TraceCheckUtils]: 9: Hoare triple {398#(< 1 fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {375#true} is VALID
[2020-07-10 14:55:35,310 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {407#(= fibo2_~n |fibo2_#in~n|)} is VALID
[2020-07-10 14:55:35,311 INFO L280 TraceCheckUtils]: 11: Hoare triple {407#(= fibo2_~n |fibo2_#in~n|)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID
[2020-07-10 14:55:35,312 INFO L280 TraceCheckUtils]: 12: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID
[2020-07-10 14:55:35,313 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {398#(< 1 fibo1_~n)} #57#return; {376#false} is VALID
[2020-07-10 14:55:35,314 INFO L280 TraceCheckUtils]: 14: Hoare triple {376#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {376#false} is VALID
[2020-07-10 14:55:35,314 INFO L263 TraceCheckUtils]: 15: Hoare triple {376#false} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID
[2020-07-10 14:55:35,314 INFO L280 TraceCheckUtils]: 16: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID
[2020-07-10 14:55:35,315 INFO L280 TraceCheckUtils]: 17: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID
[2020-07-10 14:55:35,315 INFO L280 TraceCheckUtils]: 18: Hoare triple {375#true} assume true; {375#true} is VALID
[2020-07-10 14:55:35,315 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {375#true} {376#false} #59#return; {376#false} is VALID
[2020-07-10 14:55:35,316 INFO L280 TraceCheckUtils]: 20: Hoare triple {376#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {376#false} is VALID
[2020-07-10 14:55:35,316 INFO L280 TraceCheckUtils]: 21: Hoare triple {376#false} assume true; {376#false} is VALID
[2020-07-10 14:55:35,316 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {376#false} {379#(<= 2 main_~x~0)} #51#return; {376#false} is VALID
[2020-07-10 14:55:35,317 INFO L280 TraceCheckUtils]: 23: Hoare triple {376#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {376#false} is VALID
[2020-07-10 14:55:35,317 INFO L280 TraceCheckUtils]: 24: Hoare triple {376#false} assume 1 == ~result~0; {376#false} is VALID
[2020-07-10 14:55:35,317 INFO L280 TraceCheckUtils]: 25: Hoare triple {376#false} assume !false; {376#false} is VALID
[2020-07-10 14:55:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2020-07-10 14:55:35,319 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303461867]
[2020-07-10 14:55:35,319 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294785183]
[2020-07-10 14:55:35,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-07-10 14:55:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 14:55:35,371 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core
[2020-07-10 14:55:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 14:55:35,394 INFO L287 TraceCheckSpWp]: Computing forward predicates...
[2020-07-10 14:55:35,564 INFO L263 TraceCheckUtils]: 0: Hoare triple {375#true} call ULTIMATE.init(); {375#true} is VALID
[2020-07-10 14:55:35,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#true} assume true; {375#true} is VALID
[2020-07-10 14:55:35,565 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {375#true} {375#true} #47#return; {375#true} is VALID
[2020-07-10 14:55:35,565 INFO L263 TraceCheckUtils]: 3: Hoare triple {375#true} call #t~ret5 := main(); {375#true} is VALID
[2020-07-10 14:55:35,566 INFO L280 TraceCheckUtils]: 4: Hoare triple {375#true} ~x~0 := 2; {379#(<= 2 main_~x~0)} is VALID
[2020-07-10 14:55:35,567 INFO L263 TraceCheckUtils]: 5: Hoare triple {379#(<= 2 main_~x~0)} call #t~ret4 := fibo1(~x~0); {375#true} is VALID
[2020-07-10 14:55:35,568 INFO L280 TraceCheckUtils]: 6: Hoare triple {375#true} ~n := #in~n; {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID
[2020-07-10 14:55:35,569 INFO L280 TraceCheckUtils]: 7: Hoare triple {430#(<= |fibo1_#in~n| fibo1_~n)} assume !(~n < 1); {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID
[2020-07-10 14:55:35,570 INFO L280 TraceCheckUtils]: 8: Hoare triple {430#(<= |fibo1_#in~n| fibo1_~n)} assume !(1 == ~n); {430#(<= |fibo1_#in~n| fibo1_~n)} is VALID
[2020-07-10 14:55:35,571 INFO L263 TraceCheckUtils]: 9: Hoare triple {430#(<= |fibo1_#in~n| fibo1_~n)} call #t~ret0 := fibo2(~n - 1); {375#true} is VALID
[2020-07-10 14:55:35,572 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#true} ~n := #in~n; {443#(<= |fibo2_#in~n| fibo2_~n)} is VALID
[2020-07-10 14:55:35,573 INFO L280 TraceCheckUtils]: 11: Hoare triple {443#(<= |fibo2_#in~n| fibo2_~n)} assume ~n < 1;#res := 0; {408#(<= |fibo2_#in~n| 0)} is VALID
[2020-07-10 14:55:35,573 INFO L280 TraceCheckUtils]: 12: Hoare triple {408#(<= |fibo2_#in~n| 0)} assume true; {408#(<= |fibo2_#in~n| 0)} is VALID
[2020-07-10 14:55:35,577 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {408#(<= |fibo2_#in~n| 0)} {430#(<= |fibo1_#in~n| fibo1_~n)} #57#return; {453#(<= |fibo1_#in~n| 1)} is VALID
[2020-07-10 14:55:35,578 INFO L280 TraceCheckUtils]: 14: Hoare triple {453#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {453#(<= |fibo1_#in~n| 1)} is VALID
[2020-07-10 14:55:35,579 INFO L263 TraceCheckUtils]: 15: Hoare triple {453#(<= |fibo1_#in~n| 1)} call #t~ret1 := fibo2(~n - 2); {375#true} is VALID
[2020-07-10 14:55:35,579 INFO L280 TraceCheckUtils]: 16: Hoare triple {375#true} ~n := #in~n; {375#true} is VALID
[2020-07-10 14:55:35,579 INFO L280 TraceCheckUtils]: 17: Hoare triple {375#true} assume ~n < 1;#res := 0; {375#true} is VALID
[2020-07-10 14:55:35,580 INFO L280 TraceCheckUtils]: 18: Hoare triple {375#true} assume true; {375#true} is VALID
[2020-07-10 14:55:35,581 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {375#true} {453#(<= |fibo1_#in~n| 1)} #59#return; {453#(<= |fibo1_#in~n| 1)} is VALID
[2020-07-10 14:55:35,583 INFO L280 TraceCheckUtils]: 20: Hoare triple {453#(<= |fibo1_#in~n| 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret0 + #t~ret1;havoc #t~ret0;havoc #t~ret1; {453#(<= |fibo1_#in~n| 1)} is VALID
[2020-07-10 14:55:35,584 INFO L280 TraceCheckUtils]: 21: Hoare triple {453#(<= |fibo1_#in~n| 1)} assume true; {453#(<= |fibo1_#in~n| 1)} is VALID
[2020-07-10 14:55:35,585 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {453#(<= |fibo1_#in~n| 1)} {379#(<= 2 main_~x~0)} #51#return; {376#false} is VALID
[2020-07-10 14:55:35,586 INFO L280 TraceCheckUtils]: 23: Hoare triple {376#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~result~0 := #t~ret4;havoc #t~ret4; {376#false} is VALID
[2020-07-10 14:55:35,586 INFO L280 TraceCheckUtils]: 24: Hoare triple {376#false} assume 1 == ~result~0; {376#false} is VALID
[2020-07-10 14:55:35,587 INFO L280 TraceCheckUtils]: 25: Hoare triple {376#false} assume !false; {376#false} is VALID
[2020-07-10 14:55:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2020-07-10 14:55:35,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2020-07-10 14:55:35,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10
[2020-07-10 14:55:35,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520079367]
[2020-07-10 14:55:35,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26
[2020-07-10 14:55:35,592 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-10 14:55:35,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states.
[2020-07-10 14:55:35,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 14:55:35,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-07-10 14:55:35,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-10 14:55:35,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-07-10 14:55:35,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2020-07-10 14:55:35,658 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 10 states.
[2020-07-10 14:55:36,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 14:55:36,354 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions.
[2020-07-10 14:55:36,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2020-07-10 14:55:36,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26
[2020-07-10 14:55:36,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 14:55:36,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2020-07-10 14:55:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions.
[2020-07-10 14:55:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2020-07-10 14:55:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions.
[2020-07-10 14:55:36,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 75 transitions.
[2020-07-10 14:55:36,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 14:55:36,480 INFO L225 Difference]: With dead ends: 58
[2020-07-10 14:55:36,481 INFO L226 Difference]: Without dead ends: 34
[2020-07-10 14:55:36,482 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210
[2020-07-10 14:55:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2020-07-10 14:55:36,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32.
[2020-07-10 14:55:36,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 14:55:36,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states.
[2020-07-10 14:55:36,503 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states.
[2020-07-10 14:55:36,503 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states.
[2020-07-10 14:55:36,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 14:55:36,512 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions.
[2020-07-10 14:55:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions.
[2020-07-10 14:55:36,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 14:55:36,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 14:55:36,513 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states.
[2020-07-10 14:55:36,514 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states.
[2020-07-10 14:55:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 14:55:36,521 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions.
[2020-07-10 14:55:36,522 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions.
[2020-07-10 14:55:36,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 14:55:36,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 14:55:36,524 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-10 14:55:36,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 14:55:36,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2020-07-10 14:55:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions.
[2020-07-10 14:55:36,531 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26
[2020-07-10 14:55:36,531 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-10 14:55:36,532 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions.
[2020-07-10 14:55:36,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-07-10 14:55:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions.
[2020-07-10 14:55:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-07-10 14:55:36,534 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-10 14:55:36,534 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-10 14:55:36,752 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2020-07-10 14:55:36,752 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 14:55:36,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 14:55:36,754 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times
[2020-07-10 14:55:36,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-10 14:55:36,755 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728190207]
[2020-07-10 14:55:36,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 14:55:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-10 14:55:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-10 14:55:36,818 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-07-10 14:55:36,819 INFO L520 BasicCegarLoop]: Counterexample might be feasible
[2020-07-10 14:55:36,819 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-07-10 14:55:36,852 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2020-07-10 14:55:36,852 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2020-07-10 14:55:36,853 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2020-07-10 14:55:36,853 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation
[2020-07-10 14:55:36,853 WARN L170 areAnnotationChecker]: fibo2ENTRY has no Hoare annotation
[2020-07-10 14:55:36,853 WARN L170 areAnnotationChecker]: fibo1ENTRY has no Hoare annotation
[2020-07-10 14:55:36,853 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2020-07-10 14:55:36,853 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation
[2020-07-10 14:55:36,853 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation
[2020-07-10 14:55:36,858 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation
[2020-07-10 14:55:36,859 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation
[2020-07-10 14:55:36,859 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation
[2020-07-10 14:55:36,859 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation
[2020-07-10 14:55:36,859 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation
[2020-07-10 14:55:36,859 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation
[2020-07-10 14:55:36,859 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2020-07-10 14:55:36,861 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation
[2020-07-10 14:55:36,862 WARN L170 areAnnotationChecker]: fibo2FINAL has no Hoare annotation
[2020-07-10 14:55:36,862 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation
[2020-07-10 14:55:36,862 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation
[2020-07-10 14:55:36,862 WARN L170 areAnnotationChecker]: fibo1FINAL has no Hoare annotation
[2020-07-10 14:55:36,862 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation
[2020-07-10 14:55:36,862 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation
[2020-07-10 14:55:36,862 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation
[2020-07-10 14:55:36,862 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation
[2020-07-10 14:55:36,863 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation
[2020-07-10 14:55:36,863 WARN L170 areAnnotationChecker]: fibo2EXIT has no Hoare annotation
[2020-07-10 14:55:36,863 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation
[2020-07-10 14:55:36,863 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation
[2020-07-10 14:55:36,863 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation
[2020-07-10 14:55:36,864 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation
[2020-07-10 14:55:36,864 WARN L170 areAnnotationChecker]: fibo1EXIT has no Hoare annotation
[2020-07-10 14:55:36,864 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation
[2020-07-10 14:55:36,864 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation
[2020-07-10 14:55:36,864 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation
[2020-07-10 14:55:36,864 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation
[2020-07-10 14:55:36,864 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation
[2020-07-10 14:55:36,865 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation
[2020-07-10 14:55:36,865 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation
[2020-07-10 14:55:36,865 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation
[2020-07-10 14:55:36,865 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation
[2020-07-10 14:55:36,865 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation
[2020-07-10 14:55:36,865 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation
[2020-07-10 14:55:36,865 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation
[2020-07-10 14:55:36,865 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation
[2020-07-10 14:55:36,865 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation
[2020-07-10 14:55:36,866 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation
[2020-07-10 14:55:36,866 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2020-07-10 14:55:36,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:55:36 BoogieIcfgContainer
[2020-07-10 14:55:36,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-07-10 14:55:36,872 INFO L168 Benchmark]: Toolchain (without parser) took 4111.67 ms. Allocated memory was 144.2 MB in the beginning and 250.1 MB in the end (delta: 105.9 MB). Free memory was 100.7 MB in the beginning and 115.1 MB in the end (delta: -14.4 MB). Peak memory consumption was 91.5 MB. Max. memory is 7.1 GB.
[2020-07-10 14:55:36,873 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-07-10 14:55:36,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.14 ms. Allocated memory is still 144.2 MB. Free memory was 99.9 MB in the beginning and 90.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB.
[2020-07-10 14:55:36,874 INFO L168 Benchmark]: Boogie Preprocessor took 133.76 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 90.2 MB in the beginning and 180.1 MB in the end (delta: -89.9 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB.
[2020-07-10 14:55:36,875 INFO L168 Benchmark]: RCFGBuilder took 401.02 ms. Allocated memory is still 201.3 MB. Free memory was 179.4 MB in the beginning and 160.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB.
[2020-07-10 14:55:36,876 INFO L168 Benchmark]: TraceAbstraction took 3322.88 ms. Allocated memory was 201.3 MB in the beginning and 250.1 MB in the end (delta: 48.8 MB). Free memory was 160.5 MB in the beginning and 115.1 MB in the end (delta: 45.4 MB). Peak memory consumption was 94.1 MB. Max. memory is 7.1 GB.
[2020-07-10 14:55:36,880 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- AssertionsEnabledResult: Assertions are enabled
Assertions are enabled
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.31 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 245.14 ms. Allocated memory is still 144.2 MB. Free memory was 99.9 MB in the beginning and 90.2 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 133.76 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 90.2 MB in the beginning and 180.1 MB in the end (delta: -89.9 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 401.02 ms. Allocated memory is still 201.3 MB. Free memory was 179.4 MB in the beginning and 160.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 3322.88 ms. Allocated memory was 201.3 MB in the beginning and 250.1 MB in the end (delta: 48.8 MB). Free memory was 160.5 MB in the beginning and 115.1 MB in the end (delta: 45.4 MB). Peak memory consumption was 94.1 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable
a call of __VERIFIER_error() is reachable
We found a FailurePath:
[L36] int x = 2;
VAL [x=2]
[L37] CALL, EXPR fibo1(x)
VAL [\old(n)=2]
[L8] COND FALSE !(n < 1)
VAL [\old(n)=2, n=2]
[L10] COND FALSE !(n == 1)
VAL [\old(n)=2, n=2]
[L13] CALL, EXPR fibo2(n-1)
VAL [\old(n)=1]
[L18] COND FALSE !(n < 1)
VAL [\old(n)=1, n=1]
[L20] COND TRUE n == 1
[L21] return 1;
VAL [\old(n)=1, \result=1, n=1]
[L13] RET, EXPR fibo2(n-1)
VAL [\old(n)=2, fibo2(n-1)=1, n=2]
[L13] CALL, EXPR fibo2(n-2)
VAL [\old(n)=0]
[L18] COND TRUE n < 1
[L19] return 0;
VAL [\old(n)=0, \result=0, n=0]
[L13] RET, EXPR fibo2(n-2)
VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2]
[L13] return fibo2(n-1) + fibo2(n-2);
[L37] RET, EXPR fibo1(x)
VAL [fibo1(x)=1, x=2]
[L37] int result = fibo1(x);
[L38] COND TRUE result == 1
VAL [result=1, x=2]
[L39] __VERIFIER_error()
VAL [result=1, x=2]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.2s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 82 SDtfs, 50 SDslu, 259 SDs, 0 SdLazy, 179 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 2689 SizeOfPredicates, 3 NumberOfNonLiveVariables, 60 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...