./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7e40a98558d0111ea95f3ee60a44cc14c7768182 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:05:21,021 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:05:21,023 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:05:21,035 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:05:21,036 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:05:21,037 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:05:21,038 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:05:21,040 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:05:21,042 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:05:21,043 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:05:21,044 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:05:21,044 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:05:21,045 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:05:21,047 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:05:21,048 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:05:21,049 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:05:21,050 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:05:21,052 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:05:21,054 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:05:21,056 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:05:21,057 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:05:21,058 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:05:21,061 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:05:21,061 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:05:21,061 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:05:21,062 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:05:21,063 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:05:21,065 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:05:21,066 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:05:21,067 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:05:21,067 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:05:21,068 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:05:21,068 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:05:21,068 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:05:21,070 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:05:21,070 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:05:21,071 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-01-01 21:05:21,100 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:05:21,100 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:05:21,102 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:05:21,103 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:05:21,103 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:05:21,103 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:05:21,104 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 21:05:21,104 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:05:21,104 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:05:21,104 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 21:05:21,104 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:05:21,104 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 21:05:21,105 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 21:05:21,105 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 21:05:21,105 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-01 21:05:21,105 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 21:05:21,105 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:05:21,105 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:05:21,106 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 21:05:21,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:05:21,106 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:05:21,106 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 21:05:21,106 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 21:05:21,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 21:05:21,110 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:05:21,110 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 21:05:21,111 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 21:05:21,111 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:05:21,111 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 21:05:21,111 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 21:05:21,111 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e40a98558d0111ea95f3ee60a44cc14c7768182 [2019-01-01 21:05:21,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:05:21,195 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:05:21,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:05:21,203 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:05:21,203 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:05:21,204 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2019-01-01 21:05:21,262 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15480782/86de0efa600b4d5cafbee104e77d4e7f/FLAGd07dfecb3 [2019-01-01 21:05:21,676 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:05:21,676 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2019-01-01 21:05:21,683 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15480782/86de0efa600b4d5cafbee104e77d4e7f/FLAGd07dfecb3 [2019-01-01 21:05:22,050 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c15480782/86de0efa600b4d5cafbee104e77d4e7f [2019-01-01 21:05:22,053 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:05:22,055 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:05:22,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:05:22,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:05:22,064 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:05:22,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:05:22" (1/1) ... [2019-01-01 21:05:22,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b5e6219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:05:22, skipping insertion in model container [2019-01-01 21:05:22,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:05:22" (1/1) ... [2019-01-01 21:05:22,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:05:22,091 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:05:22,271 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:05:22,276 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:05:22,291 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:05:22,303 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:05:22,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:05:22 WrapperNode [2019-01-01 21:05:22,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:05:22,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:05:22,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:05:22,304 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:05:22,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:05:22" (1/1) ... [2019-01-01 21:05:22,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:05:22" (1/1) ... [2019-01-01 21:05:22,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:05:22,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:05:22,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:05:22,333 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:05:22,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:05:22" (1/1) ... [2019-01-01 21:05:22,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:05:22" (1/1) ... [2019-01-01 21:05:22,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:05:22" (1/1) ... [2019-01-01 21:05:22,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:05:22" (1/1) ... [2019-01-01 21:05:22,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:05:22" (1/1) ... [2019-01-01 21:05:22,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:05:22" (1/1) ... [2019-01-01 21:05:22,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:05:22" (1/1) ... [2019-01-01 21:05:22,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:05:22,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:05:22,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:05:22,351 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:05:22,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:05:22" (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 [2019-01-01 21:05:22,471 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-01-01 21:05:22,472 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-01-01 21:05:22,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:05:22,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:05:22,717 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:05:22,718 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-01 21:05:22,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:05:22 BoogieIcfgContainer [2019-01-01 21:05:22,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:05:22,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 21:05:22,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 21:05:22,723 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 21:05:22,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 09:05:22" (1/3) ... [2019-01-01 21:05:22,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c0ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 09:05:22, skipping insertion in model container [2019-01-01 21:05:22,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:05:22" (2/3) ... [2019-01-01 21:05:22,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c0ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 09:05:22, skipping insertion in model container [2019-01-01 21:05:22,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:05:22" (3/3) ... [2019-01-01 21:05:22,727 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci02_true-unreach-call_true-no-overflow_true-termination.c [2019-01-01 21:05:22,739 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 21:05:22,751 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-01 21:05:22,779 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-01 21:05:22,819 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:05:22,820 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 21:05:22,820 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 21:05:22,820 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 21:05:22,820 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:05:22,820 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:05:22,820 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 21:05:22,821 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:05:22,821 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 21:05:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-01-01 21:05:22,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-01 21:05:22,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:22,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:05:22,852 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:22,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:22,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1701129783, now seen corresponding path program 1 times [2019-01-01 21:05:22,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:22,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:22,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:22,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:05:22,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:05:23,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:05:23,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:05:23,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 21:05:23,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:05:23,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:05:23,123 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2019-01-01 21:05:23,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:23,271 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-01-01 21:05:23,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:05:23,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-01 21:05:23,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:23,281 INFO L225 Difference]: With dead ends: 32 [2019-01-01 21:05:23,281 INFO L226 Difference]: Without dead ends: 21 [2019-01-01 21:05:23,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:05:23,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-01 21:05:23,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-01 21:05:23,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 21:05:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-01-01 21:05:23,324 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 6 [2019-01-01 21:05:23,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:23,325 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-01-01 21:05:23,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 21:05:23,326 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-01-01 21:05:23,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-01 21:05:23,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:23,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:05:23,328 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:23,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:23,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1195415763, now seen corresponding path program 1 times [2019-01-01 21:05:23,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:23,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:23,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:23,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:05:23,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:05:23,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:05:23,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:05:23,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 21:05:23,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:05:23,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:05:23,400 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 3 states. [2019-01-01 21:05:23,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:23,528 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-01-01 21:05:23,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:05:23,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-01 21:05:23,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:23,531 INFO L225 Difference]: With dead ends: 23 [2019-01-01 21:05:23,532 INFO L226 Difference]: Without dead ends: 21 [2019-01-01 21:05:23,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:05:23,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-01 21:05:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-01-01 21:05:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 21:05:23,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-01-01 21:05:23,541 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 7 [2019-01-01 21:05:23,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:23,542 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-01 21:05:23,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 21:05:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-01-01 21:05:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-01 21:05:23,543 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:23,543 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:05:23,544 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:23,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:23,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1513310471, now seen corresponding path program 1 times [2019-01-01 21:05:23,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:23,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:23,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:23,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:05:23,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 21:05:23,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:23,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 21:05:23,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:05:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:23,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:05:24,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:24,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2019-01-01 21:05:24,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 21:05:24,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 21:05:24,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-01-01 21:05:24,274 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 11 states. [2019-01-01 21:05:25,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:25,234 INFO L93 Difference]: Finished difference Result 74 states and 100 transitions. [2019-01-01 21:05:25,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 21:05:25,235 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-01-01 21:05:25,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:25,237 INFO L225 Difference]: With dead ends: 74 [2019-01-01 21:05:25,237 INFO L226 Difference]: Without dead ends: 55 [2019-01-01 21:05:25,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-01-01 21:05:25,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-01 21:05:25,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2019-01-01 21:05:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-01 21:05:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2019-01-01 21:05:25,273 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 28 [2019-01-01 21:05:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:25,274 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2019-01-01 21:05:25,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 21:05:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2019-01-01 21:05:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 21:05:25,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:25,277 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:05:25,278 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:25,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:25,279 INFO L82 PathProgramCache]: Analyzing trace with hash 317957503, now seen corresponding path program 1 times [2019-01-01 21:05:25,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:25,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:25,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:25,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:05:25,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-01 21:05:25,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:05:25,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:05:25,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 21:05:25,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:05:25,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:05:25,383 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 5 states. [2019-01-01 21:05:25,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:25,467 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2019-01-01 21:05:25,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:05:25,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-01 21:05:25,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:25,474 INFO L225 Difference]: With dead ends: 74 [2019-01-01 21:05:25,474 INFO L226 Difference]: Without dead ends: 73 [2019-01-01 21:05:25,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:05:25,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-01 21:05:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2019-01-01 21:05:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-01 21:05:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2019-01-01 21:05:25,495 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 30 [2019-01-01 21:05:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:25,495 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2019-01-01 21:05:25,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 21:05:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2019-01-01 21:05:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-01 21:05:25,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:25,497 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:05:25,498 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:25,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:25,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1266748055, now seen corresponding path program 1 times [2019-01-01 21:05:25,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:25,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:25,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:25,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:05:25,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-01 21:05:25,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:25,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:05:25,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:05:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:25,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:05:25,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:25,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9] total 12 [2019-01-01 21:05:25,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 21:05:25,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 21:05:25,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-01-01 21:05:25,898 INFO L87 Difference]: Start difference. First operand 63 states and 81 transitions. Second operand 12 states. [2019-01-01 21:05:26,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:26,808 INFO L93 Difference]: Finished difference Result 111 states and 138 transitions. [2019-01-01 21:05:26,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 21:05:26,809 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-01-01 21:05:26,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:26,811 INFO L225 Difference]: With dead ends: 111 [2019-01-01 21:05:26,812 INFO L226 Difference]: Without dead ends: 66 [2019-01-01 21:05:26,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-01-01 21:05:26,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-01 21:05:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2019-01-01 21:05:26,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-01 21:05:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2019-01-01 21:05:26,829 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 31 [2019-01-01 21:05:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:26,831 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2019-01-01 21:05:26,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 21:05:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2019-01-01 21:05:26,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-01 21:05:26,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:26,834 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:05:26,838 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:26,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:26,838 INFO L82 PathProgramCache]: Analyzing trace with hash 592205183, now seen corresponding path program 1 times [2019-01-01 21:05:26,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:26,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:26,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:26,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:05:26,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 32 proven. 38 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-01-01 21:05:26,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:26,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 21:05:27,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:05:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:27,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 82 proven. 27 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-01 21:05:27,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:27,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2019-01-01 21:05:27,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-01 21:05:27,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 21:05:27,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-01-01 21:05:27,188 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 14 states. [2019-01-01 21:05:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:27,617 INFO L93 Difference]: Finished difference Result 134 states and 174 transitions. [2019-01-01 21:05:27,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 21:05:27,622 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2019-01-01 21:05:27,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:27,624 INFO L225 Difference]: With dead ends: 134 [2019-01-01 21:05:27,624 INFO L226 Difference]: Without dead ends: 88 [2019-01-01 21:05:27,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-01-01 21:05:27,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-01 21:05:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2019-01-01 21:05:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-01 21:05:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2019-01-01 21:05:27,644 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 70 [2019-01-01 21:05:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:27,645 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2019-01-01 21:05:27,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-01 21:05:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2019-01-01 21:05:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-01 21:05:27,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:27,647 INFO L402 BasicCegarLoop]: trace histogram [8, 6, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:05:27,647 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:27,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:27,648 INFO L82 PathProgramCache]: Analyzing trace with hash -721647120, now seen corresponding path program 2 times [2019-01-01 21:05:27,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:27,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:27,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:27,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:05:27,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-01-01 21:05:27,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:05:27,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:05:27,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 21:05:27,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:05:27,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:05:27,899 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand 5 states. [2019-01-01 21:05:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:27,972 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2019-01-01 21:05:27,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:05:27,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-01-01 21:05:27,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:27,977 INFO L225 Difference]: With dead ends: 81 [2019-01-01 21:05:27,977 INFO L226 Difference]: Without dead ends: 80 [2019-01-01 21:05:27,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:05:27,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-01 21:05:27,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-01 21:05:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-01 21:05:27,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2019-01-01 21:05:27,989 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 60 [2019-01-01 21:05:27,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:27,989 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2019-01-01 21:05:27,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 21:05:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2019-01-01 21:05:27,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-01 21:05:27,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:27,991 INFO L402 BasicCegarLoop]: trace histogram [9, 7, 6, 6, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 21:05:27,992 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:27,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1680561052, now seen corresponding path program 1 times [2019-01-01 21:05:27,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:27,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:27,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:27,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:05:27,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-01-01 21:05:28,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:05:28,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 21:05:28,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 21:05:28,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:05:28,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:05:28,116 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand 5 states. [2019-01-01 21:05:28,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:28,191 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2019-01-01 21:05:28,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:05:28,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-01-01 21:05:28,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:28,194 INFO L225 Difference]: With dead ends: 84 [2019-01-01 21:05:28,194 INFO L226 Difference]: Without dead ends: 83 [2019-01-01 21:05:28,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:05:28,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-01 21:05:28,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2019-01-01 21:05:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-01 21:05:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2019-01-01 21:05:28,208 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 67 [2019-01-01 21:05:28,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:28,211 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2019-01-01 21:05:28,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 21:05:28,211 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2019-01-01 21:05:28,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-01 21:05:28,212 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:28,213 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:05:28,213 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:28,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:28,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1669069478, now seen corresponding path program 3 times [2019-01-01 21:05:28,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:28,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:28,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:28,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:05:28,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-01 21:05:28,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:28,358 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 21:05:28,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:05:28,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-01 21:05:28,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:05:28,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:28,443 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-01 21:05:28,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:28,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-01-01 21:05:28,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 21:05:28,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 21:05:28,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-01 21:05:28,471 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand 9 states. [2019-01-01 21:05:28,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:28,561 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2019-01-01 21:05:28,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 21:05:28,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-01-01 21:05:28,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:28,565 INFO L225 Difference]: With dead ends: 102 [2019-01-01 21:05:28,566 INFO L226 Difference]: Without dead ends: 101 [2019-01-01 21:05:28,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-01 21:05:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-01 21:05:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2019-01-01 21:05:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-01 21:05:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2019-01-01 21:05:28,577 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 67 [2019-01-01 21:05:28,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:28,578 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2019-01-01 21:05:28,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 21:05:28,578 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2019-01-01 21:05:28,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-01-01 21:05:28,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:28,580 INFO L402 BasicCegarLoop]: trace histogram [16, 13, 11, 9, 9, 9, 9, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 1, 1, 1] [2019-01-01 21:05:28,581 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:28,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:28,581 INFO L82 PathProgramCache]: Analyzing trace with hash -262542094, now seen corresponding path program 4 times [2019-01-01 21:05:28,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:28,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:28,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:28,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:05:28,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 105 proven. 200 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2019-01-01 21:05:28,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:28,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 21:05:28,726 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 21:05:28,777 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 21:05:28,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:05:28,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 309 proven. 86 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-01-01 21:05:29,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:29,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 18 [2019-01-01 21:05:29,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-01 21:05:29,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-01 21:05:29,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-01-01 21:05:29,168 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand 18 states. [2019-01-01 21:05:30,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:30,103 INFO L93 Difference]: Finished difference Result 212 states and 290 transitions. [2019-01-01 21:05:30,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 21:05:30,110 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 134 [2019-01-01 21:05:30,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:30,112 INFO L225 Difference]: With dead ends: 212 [2019-01-01 21:05:30,112 INFO L226 Difference]: Without dead ends: 133 [2019-01-01 21:05:30,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2019-01-01 21:05:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-01 21:05:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2019-01-01 21:05:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-01 21:05:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 149 transitions. [2019-01-01 21:05:30,149 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 149 transitions. Word has length 134 [2019-01-01 21:05:30,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:30,150 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 149 transitions. [2019-01-01 21:05:30,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-01 21:05:30,151 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 149 transitions. [2019-01-01 21:05:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-01 21:05:30,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:30,152 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 8, 8, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-01-01 21:05:30,156 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:30,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:30,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1904818453, now seen corresponding path program 5 times [2019-01-01 21:05:30,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:30,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:30,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:30,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:05:30,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 105 proven. 34 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-01-01 21:05:30,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:30,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 21:05:30,417 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 21:05:30,553 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-01-01 21:05:30,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:05:30,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 114 proven. 37 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-01-01 21:05:30,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:30,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2019-01-01 21:05:30,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 21:05:30,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 21:05:30,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-01-01 21:05:30,637 INFO L87 Difference]: Start difference. First operand 119 states and 149 transitions. Second operand 12 states. [2019-01-01 21:05:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:31,153 INFO L93 Difference]: Finished difference Result 222 states and 288 transitions. [2019-01-01 21:05:31,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 21:05:31,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-01-01 21:05:31,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:31,159 INFO L225 Difference]: With dead ends: 222 [2019-01-01 21:05:31,160 INFO L226 Difference]: Without dead ends: 117 [2019-01-01 21:05:31,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-01-01 21:05:31,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-01 21:05:31,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 107. [2019-01-01 21:05:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 21:05:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2019-01-01 21:05:31,178 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 93 [2019-01-01 21:05:31,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:31,181 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2019-01-01 21:05:31,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 21:05:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2019-01-01 21:05:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-01 21:05:31,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:31,185 INFO L402 BasicCegarLoop]: trace histogram [16, 14, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1] [2019-01-01 21:05:31,186 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:31,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:31,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1454304577, now seen corresponding path program 6 times [2019-01-01 21:05:31,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:31,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:31,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:31,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:05:31,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:31,986 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 202 proven. 266 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-01-01 21:05:31,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:31,986 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 21:05:32,005 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 21:05:32,074 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-01 21:05:32,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:05:32,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 29 proven. 63 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2019-01-01 21:05:32,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:32,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9] total 29 [2019-01-01 21:05:32,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-01 21:05:32,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-01 21:05:32,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2019-01-01 21:05:32,538 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand 29 states. [2019-01-01 21:05:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:35,036 INFO L93 Difference]: Finished difference Result 269 states and 321 transitions. [2019-01-01 21:05:35,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-01 21:05:35,037 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2019-01-01 21:05:35,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:35,039 INFO L225 Difference]: With dead ends: 269 [2019-01-01 21:05:35,039 INFO L226 Difference]: Without dead ends: 156 [2019-01-01 21:05:35,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1376, Invalid=3736, Unknown=0, NotChecked=0, Total=5112 [2019-01-01 21:05:35,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-01 21:05:35,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2019-01-01 21:05:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-01 21:05:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 159 transitions. [2019-01-01 21:05:35,052 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 159 transitions. Word has length 132 [2019-01-01 21:05:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:35,053 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 159 transitions. [2019-01-01 21:05:35,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-01 21:05:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 159 transitions. [2019-01-01 21:05:35,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-01-01 21:05:35,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:35,055 INFO L402 BasicCegarLoop]: trace histogram [15, 13, 10, 10, 10, 10, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1] [2019-01-01 21:05:35,055 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:35,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:35,055 INFO L82 PathProgramCache]: Analyzing trace with hash -471778112, now seen corresponding path program 2 times [2019-01-01 21:05:35,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:35,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:35,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:35,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:05:35,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 161 proven. 281 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-01-01 21:05:35,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:35,403 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 21:05:35,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:05:35,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:05:35,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:05:35,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:35,598 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 325 proven. 155 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-01-01 21:05:35,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:35,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 24 [2019-01-01 21:05:35,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-01 21:05:35,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-01 21:05:35,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2019-01-01 21:05:35,619 INFO L87 Difference]: Start difference. First operand 134 states and 159 transitions. Second operand 24 states. [2019-01-01 21:05:36,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:36,991 INFO L93 Difference]: Finished difference Result 286 states and 336 transitions. [2019-01-01 21:05:36,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-01 21:05:36,993 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 119 [2019-01-01 21:05:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:36,994 INFO L225 Difference]: With dead ends: 286 [2019-01-01 21:05:36,995 INFO L226 Difference]: Without dead ends: 155 [2019-01-01 21:05:36,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=797, Invalid=1959, Unknown=0, NotChecked=0, Total=2756 [2019-01-01 21:05:36,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-01 21:05:37,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 143. [2019-01-01 21:05:37,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-01 21:05:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 164 transitions. [2019-01-01 21:05:37,010 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 164 transitions. Word has length 119 [2019-01-01 21:05:37,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:37,011 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 164 transitions. [2019-01-01 21:05:37,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-01 21:05:37,011 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 164 transitions. [2019-01-01 21:05:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-01 21:05:37,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:37,014 INFO L402 BasicCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1] [2019-01-01 21:05:37,014 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:37,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:37,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2068608930, now seen corresponding path program 3 times [2019-01-01 21:05:37,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:37,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:37,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:37,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:05:37,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-01-01 21:05:37,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:37,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 21:05:37,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:05:37,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-01 21:05:37,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:05:37,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 62 proven. 5 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-01-01 21:05:37,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:37,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-01-01 21:05:37,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 21:05:37,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 21:05:37,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-01 21:05:37,261 INFO L87 Difference]: Start difference. First operand 143 states and 164 transitions. Second operand 10 states. [2019-01-01 21:05:37,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:37,313 INFO L93 Difference]: Finished difference Result 143 states and 164 transitions. [2019-01-01 21:05:37,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 21:05:37,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2019-01-01 21:05:37,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:37,315 INFO L225 Difference]: With dead ends: 143 [2019-01-01 21:05:37,315 INFO L226 Difference]: Without dead ends: 141 [2019-01-01 21:05:37,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-01 21:05:37,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-01 21:05:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-01-01 21:05:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-01 21:05:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 157 transitions. [2019-01-01 21:05:37,325 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 157 transitions. Word has length 113 [2019-01-01 21:05:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:37,326 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 157 transitions. [2019-01-01 21:05:37,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 21:05:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 157 transitions. [2019-01-01 21:05:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-01 21:05:37,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:37,330 INFO L402 BasicCegarLoop]: trace histogram [19, 16, 14, 11, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 3, 1, 1, 1] [2019-01-01 21:05:37,332 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:37,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1288089853, now seen corresponding path program 7 times [2019-01-01 21:05:37,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:37,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:37,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:37,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:05:37,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2019-01-01 21:05:37,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:37,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 21:05:37,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:05:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:37,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2019-01-01 21:05:38,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:38,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2019-01-01 21:05:38,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-01 21:05:38,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 21:05:38,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-01-01 21:05:38,111 INFO L87 Difference]: Start difference. First operand 141 states and 157 transitions. Second operand 17 states. [2019-01-01 21:05:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:38,228 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2019-01-01 21:05:38,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-01 21:05:38,229 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 165 [2019-01-01 21:05:38,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:38,231 INFO L225 Difference]: With dead ends: 156 [2019-01-01 21:05:38,231 INFO L226 Difference]: Without dead ends: 155 [2019-01-01 21:05:38,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-01-01 21:05:38,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-01 21:05:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 135. [2019-01-01 21:05:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-01 21:05:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 148 transitions. [2019-01-01 21:05:38,245 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 148 transitions. Word has length 165 [2019-01-01 21:05:38,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:38,246 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 148 transitions. [2019-01-01 21:05:38,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-01 21:05:38,246 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 148 transitions. [2019-01-01 21:05:38,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-01-01 21:05:38,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:38,251 INFO L402 BasicCegarLoop]: trace histogram [24, 20, 20, 13, 13, 13, 13, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 4, 1, 1, 1] [2019-01-01 21:05:38,251 INFO L423 AbstractCegarLoop]: === Iteration 16 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:38,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:38,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1250166480, now seen corresponding path program 8 times [2019-01-01 21:05:38,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:38,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:38,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:38,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:05:38,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1662 backedges. 241 proven. 416 refuted. 0 times theorem prover too weak. 1005 trivial. 0 not checked. [2019-01-01 21:05:38,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:38,645 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:05:38,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:05:38,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:05:38,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:05:38,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1662 backedges. 863 proven. 391 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-01-01 21:05:38,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:38,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 23 [2019-01-01 21:05:38,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-01 21:05:38,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-01 21:05:38,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2019-01-01 21:05:38,955 INFO L87 Difference]: Start difference. First operand 135 states and 148 transitions. Second operand 23 states. [2019-01-01 21:05:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:40,349 INFO L93 Difference]: Finished difference Result 286 states and 323 transitions. [2019-01-01 21:05:40,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-01 21:05:40,351 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 218 [2019-01-01 21:05:40,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:40,353 INFO L225 Difference]: With dead ends: 286 [2019-01-01 21:05:40,353 INFO L226 Difference]: Without dead ends: 147 [2019-01-01 21:05:40,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=288, Invalid=1118, Unknown=0, NotChecked=0, Total=1406 [2019-01-01 21:05:40,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-01 21:05:40,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 138. [2019-01-01 21:05:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-01 21:05:40,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2019-01-01 21:05:40,366 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 218 [2019-01-01 21:05:40,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:40,368 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2019-01-01 21:05:40,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-01 21:05:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2019-01-01 21:05:40,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-01-01 21:05:40,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:40,372 INFO L402 BasicCegarLoop]: trace histogram [28, 24, 23, 15, 15, 15, 15, 12, 12, 12, 12, 12, 12, 12, 11, 11, 8, 5, 1, 1, 1] [2019-01-01 21:05:40,373 INFO L423 AbstractCegarLoop]: === Iteration 17 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:40,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:40,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1461844116, now seen corresponding path program 9 times [2019-01-01 21:05:40,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:40,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:40,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:40,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:05:40,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 272 proven. 389 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2019-01-01 21:05:41,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:41,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:05:41,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 21:05:41,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-01 21:05:41,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:05:41,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 272 proven. 389 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2019-01-01 21:05:41,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:41,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2019-01-01 21:05:41,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-01 21:05:41,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 21:05:41,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-01-01 21:05:41,521 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand 21 states. [2019-01-01 21:05:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:41,657 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2019-01-01 21:05:41,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 21:05:41,659 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 257 [2019-01-01 21:05:41,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:41,661 INFO L225 Difference]: With dead ends: 139 [2019-01-01 21:05:41,661 INFO L226 Difference]: Without dead ends: 138 [2019-01-01 21:05:41,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-01-01 21:05:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-01 21:05:41,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-01-01 21:05:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-01 21:05:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2019-01-01 21:05:41,670 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 257 [2019-01-01 21:05:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:41,672 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2019-01-01 21:05:41,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-01 21:05:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2019-01-01 21:05:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-01-01 21:05:41,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:41,676 INFO L402 BasicCegarLoop]: trace histogram [43, 40, 35, 22, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 19, 19, 13, 8, 1, 1, 1] [2019-01-01 21:05:41,676 INFO L423 AbstractCegarLoop]: === Iteration 18 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:41,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:41,677 INFO L82 PathProgramCache]: Analyzing trace with hash 648414394, now seen corresponding path program 10 times [2019-01-01 21:05:41,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:41,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:41,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:41,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:05:41,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 820 proven. 1093 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2019-01-01 21:05:42,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:42,676 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:05:42,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 21:05:42,775 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 21:05:42,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:05:42,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 820 proven. 1093 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2019-01-01 21:05:43,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:43,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2019-01-01 21:05:43,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-01 21:05:43,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-01 21:05:43,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2019-01-01 21:05:43,125 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 25 states. [2019-01-01 21:05:43,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:43,264 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2019-01-01 21:05:43,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-01 21:05:43,265 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 408 [2019-01-01 21:05:43,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:43,268 INFO L225 Difference]: With dead ends: 139 [2019-01-01 21:05:43,268 INFO L226 Difference]: Without dead ends: 138 [2019-01-01 21:05:43,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2019-01-01 21:05:43,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-01 21:05:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-01-01 21:05:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-01 21:05:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2019-01-01 21:05:43,279 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 408 [2019-01-01 21:05:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:43,281 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2019-01-01 21:05:43,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-01 21:05:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2019-01-01 21:05:43,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2019-01-01 21:05:43,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:43,288 INFO L402 BasicCegarLoop]: trace histogram [68, 66, 55, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 32, 32, 21, 13, 1, 1, 1] [2019-01-01 21:05:43,289 INFO L423 AbstractCegarLoop]: === Iteration 19 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:43,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:43,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1470667451, now seen corresponding path program 11 times [2019-01-01 21:05:43,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:43,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:43,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:43,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:05:43,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 15678 backedges. 2390 proven. 2946 refuted. 0 times theorem prover too weak. 10342 trivial. 0 not checked. [2019-01-01 21:05:44,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:44,036 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:05:44,045 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 21:05:44,284 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2019-01-01 21:05:44,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:05:44,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 15678 backedges. 2390 proven. 2946 refuted. 0 times theorem prover too weak. 10342 trivial. 0 not checked. [2019-01-01 21:05:44,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:44,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 28 [2019-01-01 21:05:44,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-01 21:05:44,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-01 21:05:44,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2019-01-01 21:05:44,827 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand 29 states. [2019-01-01 21:05:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:45,027 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2019-01-01 21:05:45,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-01 21:05:45,028 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 657 [2019-01-01 21:05:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:45,031 INFO L225 Difference]: With dead ends: 139 [2019-01-01 21:05:45,031 INFO L226 Difference]: Without dead ends: 138 [2019-01-01 21:05:45,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 789 GetRequests, 762 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2019-01-01 21:05:45,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-01 21:05:45,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-01-01 21:05:45,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-01 21:05:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2019-01-01 21:05:45,041 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 657 [2019-01-01 21:05:45,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:45,044 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions. [2019-01-01 21:05:45,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-01 21:05:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2019-01-01 21:05:45,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1064 [2019-01-01 21:05:45,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 21:05:45,055 INFO L402 BasicCegarLoop]: trace histogram [109, 108, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 53, 34, 21, 1, 1, 1] [2019-01-01 21:05:45,055 INFO L423 AbstractCegarLoop]: === Iteration 20 === [fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-01 21:05:45,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:05:45,056 INFO L82 PathProgramCache]: Analyzing trace with hash 607316682, now seen corresponding path program 12 times [2019-01-01 21:05:45,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:05:45,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:05:45,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:45,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:05:45,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:05:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:05:47,568 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6686 proven. 7802 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2019-01-01 21:05:47,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:05:47,569 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:05:47,582 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-01 21:05:48,105 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 83 check-sat command(s) [2019-01-01 21:05:48,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:05:48,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:05:50,331 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6686 proven. 7802 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2019-01-01 21:05:50,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:05:50,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 32 [2019-01-01 21:05:50,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-01 21:05:50,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-01 21:05:50,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2019-01-01 21:05:50,365 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand 33 states. [2019-01-01 21:05:50,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:05:50,656 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2019-01-01 21:05:50,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-01 21:05:50,657 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1063 [2019-01-01 21:05:50,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 21:05:50,660 INFO L225 Difference]: With dead ends: 138 [2019-01-01 21:05:50,660 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 21:05:50,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1279 GetRequests, 1248 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2019-01-01 21:05:50,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 21:05:50,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 21:05:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 21:05:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 21:05:50,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1063 [2019-01-01 21:05:50,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 21:05:50,664 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:05:50,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-01 21:05:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:05:50,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 21:05:50,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-01 21:05:55,545 WARN L181 SmtUtils]: Spent 4.61 s on a formula simplification. DAG size of input: 129 DAG size of output: 48 [2019-01-01 21:05:55,884 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 16 [2019-01-01 21:05:55,888 INFO L448 ceAbstractionStarter]: For program point fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 21:05:55,888 INFO L448 ceAbstractionStarter]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2019-01-01 21:05:55,888 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 21) no Hoare annotation was computed. [2019-01-01 21:05:55,888 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 21) no Hoare annotation was computed. [2019-01-01 21:05:55,888 INFO L448 ceAbstractionStarter]: For program point fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 21:05:55,888 INFO L448 ceAbstractionStarter]: For program point fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 21:05:55,889 INFO L448 ceAbstractionStarter]: For program point fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 21:05:55,889 INFO L448 ceAbstractionStarter]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2019-01-01 21:05:55,889 INFO L451 ceAbstractionStarter]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2019-01-01 21:05:55,889 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-01 21:05:55,889 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-01-01 21:05:55,889 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (and (or (< 3 |fibonacci_#in~n|) (<= 2 fibonacci_~n)) (or (and (<= |fibonacci_#in~n| fibonacci_~n) (<= fibonacci_~n |fibonacci_#in~n|)) (< 9 |fibonacci_#in~n|))) [2019-01-01 21:05:55,890 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-01-01 21:05:55,890 INFO L448 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2019-01-01 21:05:55,890 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-01-01 21:05:55,890 INFO L444 ceAbstractionStarter]: At program point L20-6(line 20) the Hoare annotation is: (and (or (and (<= |fibonacci_#t~ret0| 21) (<= |fibonacci_#in~n| fibonacci_~n) (<= 1 |fibonacci_#t~ret0|) (<= fibonacci_~n |fibonacci_#in~n|)) (< 9 |fibonacci_#in~n|)) (or (<= |fibonacci_#t~ret0| 5) (< 6 |fibonacci_#in~n|)) (or (< 8 |fibonacci_#in~n|) (<= |fibonacci_#t~ret0| 13)) (or (<= |fibonacci_#t~ret0| 1) (< 4 |fibonacci_#in~n|) (and (<= 4 fibonacci_~n) (<= |fibonacci_#t~ret0| 2))) (or (<= |fibonacci_#t~ret0| 3) (< 5 |fibonacci_#in~n|)) (< 1 |fibonacci_#in~n|) (or (<= |fibonacci_#t~ret0| 8) (< 7 |fibonacci_#in~n|))) [2019-01-01 21:05:55,890 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-01-01 21:05:55,890 INFO L448 ceAbstractionStarter]: For program point L20-8(line 20) no Hoare annotation was computed. [2019-01-01 21:05:55,890 INFO L448 ceAbstractionStarter]: For program point L20-9(line 20) no Hoare annotation was computed. [2019-01-01 21:05:55,890 INFO L448 ceAbstractionStarter]: For program point fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 21:05:55,890 INFO L448 ceAbstractionStarter]: For program point fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-01-01 21:05:55,891 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-01 21:05:55,891 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-01 21:05:55,891 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-01 21:05:55,891 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-01 21:05:55,891 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 32) no Hoare annotation was computed. [2019-01-01 21:05:55,891 INFO L444 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0)) [2019-01-01 21:05:55,891 INFO L448 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2019-01-01 21:05:55,892 INFO L444 ceAbstractionStarter]: At program point L25(lines 25 33) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 9) [2019-01-01 21:05:55,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 09:05:55 BoogieIcfgContainer [2019-01-01 21:05:55,905 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 21:05:55,905 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:05:55,905 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:05:55,905 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:05:55,906 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:05:22" (3/4) ... [2019-01-01 21:05:55,910 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 21:05:55,916 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2019-01-01 21:05:55,920 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-01 21:05:55,920 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-01 21:05:55,968 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 21:05:55,968 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:05:55,969 INFO L168 Benchmark]: Toolchain (without parser) took 33915.11 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 773.8 MB). Free memory was 951.4 MB in the beginning and 1.5 GB in the end (delta: -530.2 MB). Peak memory consumption was 243.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:05:55,971 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:05:55,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.04 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:05:55,972 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.89 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:05:55,972 INFO L168 Benchmark]: Boogie Preprocessor took 17.90 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:05:55,974 INFO L168 Benchmark]: RCFGBuilder took 368.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:05:55,975 INFO L168 Benchmark]: TraceAbstraction took 33185.43 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 628.6 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -365.8 MB). Peak memory consumption was 262.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:05:55,975 INFO L168 Benchmark]: Witness Printer took 63.04 ms. Allocated memory is still 1.8 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:05:55,981 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.04 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 27.89 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.90 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 368.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33185.43 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 628.6 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -365.8 MB). Peak memory consumption was 262.8 MB. Max. memory is 11.5 GB. * Witness Printer took 63.04 ms. Allocated memory is still 1.8 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: x <= 9 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 6 error locations. SAFE Result, 33.0s OverallTime, 20 OverallIterations, 109 TraceHistogramMax, 10.7s AutomataDifference, 0.0s DeadEndRemovalTime, 5.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 478 SDtfs, 2587 SDslu, 2922 SDs, 0 SdLazy, 3776 SolverSat, 1035 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4355 GetRequests, 3950 SyntacticMatches, 3 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3000 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 130 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 278 PreInvPairs, 435 NumberOfFragments, 102 HoareAnnotationTreeSize, 278 FomulaSimplifications, 3380 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 5 FomulaSimplificationsInter, 3040 FormulaSimplificationTreeSizeReductionInter, 4.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 7280 NumberOfCodeBlocks, 7107 NumberOfCodeBlocksAsserted, 210 NumberOfCheckSat, 7245 ConstructedInterpolants, 0 QuantifiedInterpolants, 9753937 SizeOfPredicates, 44 NumberOfNonLiveVariables, 6303 ConjunctsInSsa, 636 ConjunctsInUnsatCore, 35 InterpolantComputations, 5 PerfectInterpolantSequences, 115342/142103 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...