./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Fibonacci02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/recursive/Fibonacci02.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-30f4e4a [2019-11-28 02:53:26,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:53:26,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:53:26,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:53:26,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:53:26,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:53:26,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:53:26,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:53:26,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:53:26,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:53:26,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:53:26,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:53:26,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:53:26,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:53:26,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:53:26,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:53:26,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:53:26,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:53:26,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:53:26,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:53:26,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:53:26,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:53:26,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:53:26,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:53:26,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:53:26,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:53:26,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:53:26,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:53:26,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:53:26,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:53:26,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:53:26,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:53:26,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:53:26,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:53:26,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:53:26,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:53:26,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:53:26,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:53:26,253 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:53:26,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:53:26,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:53:26,257 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-28 02:53:26,293 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:53:26,293 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:53:26,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:53:26,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:53:26,298 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:53:26,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:53:26,298 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:53:26,299 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:53:26,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:53:26,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:53:26,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:53:26,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 02:53:26,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:53:26,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 02:53:26,302 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 02:53:26,302 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:53:26,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:53:26,302 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:53:26,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 02:53:26,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:53:26,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:53:26,304 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:53:26,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:53:26,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:53:26,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:53:26,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:53:26,305 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 02:53:26,306 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:53:26,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:53:26,306 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 02:53:26,307 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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-11-28 02:53:26,633 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:53:26,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:53:26,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:53:26,660 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:53:26,661 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:53:26,663 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci02.c [2019-11-28 02:53:26,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8838984b1/d0cfe9a0e98e48958acfd883f3df1b37/FLAGcbd23b334 [2019-11-28 02:53:27,199 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:53:27,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c [2019-11-28 02:53:27,204 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8838984b1/d0cfe9a0e98e48958acfd883f3df1b37/FLAGcbd23b334 [2019-11-28 02:53:27,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8838984b1/d0cfe9a0e98e48958acfd883f3df1b37 [2019-11-28 02:53:27,580 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:53:27,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:53:27,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:53:27,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:53:27,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:53:27,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:53:27" (1/1) ... [2019-11-28 02:53:27,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c98246f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27, skipping insertion in model container [2019-11-28 02:53:27,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:53:27" (1/1) ... [2019-11-28 02:53:27,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:53:27,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:53:27,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:53:27,855 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:53:27,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:53:27,893 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:53:27,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27 WrapperNode [2019-11-28 02:53:27,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:53:27,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:53:27,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:53:27,896 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:53:27,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2019-11-28 02:53:27,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2019-11-28 02:53:28,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:53:28,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:53:28,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:53:28,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:53:28,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2019-11-28 02:53:28,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2019-11-28 02:53:28,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2019-11-28 02:53:28,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2019-11-28 02:53:28,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2019-11-28 02:53:28,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2019-11-28 02:53:28,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (1/1) ... [2019-11-28 02:53:28,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:53:28,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:53:28,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:53:28,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:53:28,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (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-11-28 02:53:28,112 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-11-28 02:53:28,113 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-11-28 02:53:28,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:53:28,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:53:28,307 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:53:28,308 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 02:53:28,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:53:28 BoogieIcfgContainer [2019-11-28 02:53:28,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:53:28,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:53:28,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:53:28,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:53:28,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:53:27" (1/3) ... [2019-11-28 02:53:28,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8a16c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:53:28, skipping insertion in model container [2019-11-28 02:53:28,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:27" (2/3) ... [2019-11-28 02:53:28,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8a16c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:53:28, skipping insertion in model container [2019-11-28 02:53:28,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:53:28" (3/3) ... [2019-11-28 02:53:28,318 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2019-11-28 02:53:28,329 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:53:28,337 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-28 02:53:28,360 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 02:53:28,423 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:53:28,423 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 02:53:28,424 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:53:28,424 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:53:28,424 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:53:28,424 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:53:28,425 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:53:28,425 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:53:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-28 02:53:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 02:53:28,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:28,464 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 02:53:28,464 INFO L410 AbstractCegarLoop]: === Iteration 1 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:28,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:28,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1701129783, now seen corresponding path program 1 times [2019-11-28 02:53:28,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:28,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581404494] [2019-11-28 02:53:28,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:53:28,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581404494] [2019-11-28 02:53:28,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:53:28,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:53:28,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457975947] [2019-11-28 02:53:28,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:53:28,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:28,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:53:28,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:53:28,749 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2019-11-28 02:53:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:28,876 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-11-28 02:53:28,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:53:28,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-11-28 02:53:28,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:28,886 INFO L225 Difference]: With dead ends: 32 [2019-11-28 02:53:28,886 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 02:53:28,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:53:28,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 02:53:28,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-28 02:53:28,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 02:53:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-28 02:53:28,933 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 6 [2019-11-28 02:53:28,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:28,934 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-28 02:53:28,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:53:28,934 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-28 02:53:28,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 02:53:28,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:28,936 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:28,936 INFO L410 AbstractCegarLoop]: === Iteration 2 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:28,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:28,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1195415763, now seen corresponding path program 1 times [2019-11-28 02:53:28,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:28,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2722012] [2019-11-28 02:53:28,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:53:28,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2722012] [2019-11-28 02:53:28,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:53:28,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:53:28,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760609643] [2019-11-28 02:53:28,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:53:28,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:28,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:53:28,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:53:28,967 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 3 states. [2019-11-28 02:53:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:28,986 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-11-28 02:53:28,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:53:28,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 02:53:28,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:28,989 INFO L225 Difference]: With dead ends: 23 [2019-11-28 02:53:28,989 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 02:53:28,990 INFO L630 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-11-28 02:53:28,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 02:53:28,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-28 02:53:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 02:53:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-28 02:53:28,998 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 7 [2019-11-28 02:53:28,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:28,999 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-28 02:53:28,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:53:28,999 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-11-28 02:53:29,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 02:53:29,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:29,000 INFO L410 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:29,001 INFO L410 AbstractCegarLoop]: === Iteration 3 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:29,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:29,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1513310471, now seen corresponding path program 1 times [2019-11-28 02:53:29,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:29,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786795041] [2019-11-28 02:53:29,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:53:29,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786795041] [2019-11-28 02:53:29,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817764080] [2019-11-28 02:53:29,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:29,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:53:29,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:53:29,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:53:29,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2019-11-28 02:53:29,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313165017] [2019-11-28 02:53:29,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 02:53:29,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:29,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:53:29,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:53:29,415 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 13 states. [2019-11-28 02:53:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:29,826 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2019-11-28 02:53:29,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:53:29,827 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-11-28 02:53:29,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:29,829 INFO L225 Difference]: With dead ends: 72 [2019-11-28 02:53:29,829 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 02:53:29,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-11-28 02:53:29,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 02:53:29,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2019-11-28 02:53:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 02:53:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2019-11-28 02:53:29,853 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 28 [2019-11-28 02:53:29,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:29,854 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2019-11-28 02:53:29,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 02:53:29,854 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2019-11-28 02:53:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 02:53:29,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:29,858 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:30,064 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:30,065 INFO L410 AbstractCegarLoop]: === Iteration 4 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:30,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:30,066 INFO L82 PathProgramCache]: Analyzing trace with hash 317957503, now seen corresponding path program 1 times [2019-11-28 02:53:30,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:30,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495030628] [2019-11-28 02:53:30,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:53:30,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495030628] [2019-11-28 02:53:30,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071017066] [2019-11-28 02:53:30,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:30,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:53:30,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:53:30,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:53:30,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 14 [2019-11-28 02:53:30,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278821572] [2019-11-28 02:53:30,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 02:53:30,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:30,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 02:53:30,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:53:30,366 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 14 states. [2019-11-28 02:53:30,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:30,753 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2019-11-28 02:53:30,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 02:53:30,754 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-11-28 02:53:30,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:30,755 INFO L225 Difference]: With dead ends: 90 [2019-11-28 02:53:30,758 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 02:53:30,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2019-11-28 02:53:30,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 02:53:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2019-11-28 02:53:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 02:53:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2019-11-28 02:53:30,791 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 30 [2019-11-28 02:53:30,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:30,791 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2019-11-28 02:53:30,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 02:53:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2019-11-28 02:53:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 02:53:30,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:30,797 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:30,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:30,999 INFO L410 AbstractCegarLoop]: === Iteration 5 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:30,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:31,000 INFO L82 PathProgramCache]: Analyzing trace with hash -345552101, now seen corresponding path program 2 times [2019-11-28 02:53:31,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:31,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239209520] [2019-11-28 02:53:31,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:53:31,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239209520] [2019-11-28 02:53:31,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566652476] [2019-11-28 02:53:31,186 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:31,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:53:31,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:53:31,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:53:31,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-28 02:53:31,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:53:31,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2019-11-28 02:53:31,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458595333] [2019-11-28 02:53:31,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:53:31,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:31,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:53:31,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:53:31,277 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand 5 states. [2019-11-28 02:53:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:31,323 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2019-11-28 02:53:31,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:53:31,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-28 02:53:31,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:31,325 INFO L225 Difference]: With dead ends: 57 [2019-11-28 02:53:31,325 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 02:53:31,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:53:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 02:53:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-11-28 02:53:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 02:53:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-11-28 02:53:31,345 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 34 [2019-11-28 02:53:31,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:31,348 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-11-28 02:53:31,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:53:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2019-11-28 02:53:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 02:53:31,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:31,350 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:31,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:31,569 INFO L410 AbstractCegarLoop]: === Iteration 6 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:31,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:31,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1803486695, now seen corresponding path program 1 times [2019-11-28 02:53:31,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:31,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263346434] [2019-11-28 02:53:31,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:53:31,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263346434] [2019-11-28 02:53:31,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877781132] [2019-11-28 02:53:31,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:31,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 02:53:31,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 12 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:53:31,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:53:31,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 17 [2019-11-28 02:53:31,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958426506] [2019-11-28 02:53:31,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 02:53:31,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:31,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 02:53:31,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-11-28 02:53:31,864 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 17 states. [2019-11-28 02:53:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:32,457 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2019-11-28 02:53:32,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 02:53:32,458 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2019-11-28 02:53:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:32,459 INFO L225 Difference]: With dead ends: 130 [2019-11-28 02:53:32,460 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 02:53:32,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2019-11-28 02:53:32,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 02:53:32,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2019-11-28 02:53:32,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-28 02:53:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2019-11-28 02:53:32,479 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 41 [2019-11-28 02:53:32,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:32,479 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2019-11-28 02:53:32,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 02:53:32,480 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2019-11-28 02:53:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 02:53:32,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:32,481 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:32,684 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:32,685 INFO L410 AbstractCegarLoop]: === Iteration 7 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:32,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:32,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1458107581, now seen corresponding path program 2 times [2019-11-28 02:53:32,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:32,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290755925] [2019-11-28 02:53:32,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:53:32,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290755925] [2019-11-28 02:53:32,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933587157] [2019-11-28 02:53:32,866 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:32,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:53:32,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:53:32,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 02:53:32,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 17 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:53:32,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:53:32,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 18 [2019-11-28 02:53:32,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827107619] [2019-11-28 02:53:32,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 02:53:32,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:32,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 02:53:32,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-28 02:53:32,948 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand 18 states. [2019-11-28 02:53:33,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:33,569 INFO L93 Difference]: Finished difference Result 158 states and 189 transitions. [2019-11-28 02:53:33,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 02:53:33,569 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2019-11-28 02:53:33,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:33,571 INFO L225 Difference]: With dead ends: 158 [2019-11-28 02:53:33,571 INFO L226 Difference]: Without dead ends: 91 [2019-11-28 02:53:33,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2019-11-28 02:53:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-28 02:53:33,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2019-11-28 02:53:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 02:53:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2019-11-28 02:53:33,584 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 42 [2019-11-28 02:53:33,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:33,585 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2019-11-28 02:53:33,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 02:53:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2019-11-28 02:53:33,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 02:53:33,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:33,586 INFO L410 BasicCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:33,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:33,791 INFO L410 AbstractCegarLoop]: === Iteration 8 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:33,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:33,792 INFO L82 PathProgramCache]: Analyzing trace with hash -248795849, now seen corresponding path program 2 times [2019-11-28 02:53:33,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:33,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239385343] [2019-11-28 02:53:33,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:53:33,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239385343] [2019-11-28 02:53:33,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656405276] [2019-11-28 02:53:33,983 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:34,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:53:34,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:53:34,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:53:34,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-28 02:53:34,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:53:34,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [17] total 19 [2019-11-28 02:53:34,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195890599] [2019-11-28 02:53:34,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:53:34,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:34,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:53:34,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-11-28 02:53:34,067 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand 5 states. [2019-11-28 02:53:34,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:34,099 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2019-11-28 02:53:34,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:53:34,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-28 02:53:34,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:34,102 INFO L225 Difference]: With dead ends: 89 [2019-11-28 02:53:34,102 INFO L226 Difference]: Without dead ends: 88 [2019-11-28 02:53:34,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-11-28 02:53:34,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-28 02:53:34,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2019-11-28 02:53:34,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-28 02:53:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2019-11-28 02:53:34,113 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 47 [2019-11-28 02:53:34,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:34,114 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2019-11-28 02:53:34,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:53:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2019-11-28 02:53:34,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 02:53:34,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:34,116 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:34,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:34,319 INFO L410 AbstractCegarLoop]: === Iteration 9 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:34,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:34,320 INFO L82 PathProgramCache]: Analyzing trace with hash -714183989, now seen corresponding path program 1 times [2019-11-28 02:53:34,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:34,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716160762] [2019-11-28 02:53:34,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:34,522 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:53:34,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716160762] [2019-11-28 02:53:34,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955421934] [2019-11-28 02:53:34,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:34,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 02:53:34,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 22 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:53:34,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:53:34,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 21 [2019-11-28 02:53:34,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093076215] [2019-11-28 02:53:34,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 02:53:34,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:34,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 02:53:34,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2019-11-28 02:53:34,597 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand 21 states. [2019-11-28 02:53:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:35,460 INFO L93 Difference]: Finished difference Result 206 states and 257 transitions. [2019-11-28 02:53:35,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 02:53:35,460 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2019-11-28 02:53:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:35,462 INFO L225 Difference]: With dead ends: 206 [2019-11-28 02:53:35,462 INFO L226 Difference]: Without dead ends: 134 [2019-11-28 02:53:35,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=978, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 02:53:35,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-28 02:53:35,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 122. [2019-11-28 02:53:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 02:53:35,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2019-11-28 02:53:35,483 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 53 [2019-11-28 02:53:35,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:35,483 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2019-11-28 02:53:35,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 02:53:35,483 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2019-11-28 02:53:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 02:53:35,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:35,485 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:35,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:35,694 INFO L410 AbstractCegarLoop]: === Iteration 10 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:35,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:35,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1889266439, now seen corresponding path program 3 times [2019-11-28 02:53:35,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:35,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213869525] [2019-11-28 02:53:35,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 1 proven. 128 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 02:53:35,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213869525] [2019-11-28 02:53:35,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423937233] [2019-11-28 02:53:35,948 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:35,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-28 02:53:35,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:53:35,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:53:35,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-28 02:53:36,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:53:36,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [20] total 23 [2019-11-28 02:53:36,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149937754] [2019-11-28 02:53:36,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:53:36,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:36,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:53:36,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-11-28 02:53:36,033 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand 5 states. [2019-11-28 02:53:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:36,068 INFO L93 Difference]: Finished difference Result 147 states and 184 transitions. [2019-11-28 02:53:36,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:53:36,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-11-28 02:53:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:36,070 INFO L225 Difference]: With dead ends: 147 [2019-11-28 02:53:36,070 INFO L226 Difference]: Without dead ends: 146 [2019-11-28 02:53:36,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-11-28 02:53:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-28 02:53:36,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 132. [2019-11-28 02:53:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 02:53:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2019-11-28 02:53:36,085 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 54 [2019-11-28 02:53:36,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:36,085 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2019-11-28 02:53:36,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:53:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2019-11-28 02:53:36,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 02:53:36,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:36,087 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 7, 7, 7, 7, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:36,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:36,300 INFO L410 AbstractCegarLoop]: === Iteration 11 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:36,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:36,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1250306354, now seen corresponding path program 1 times [2019-11-28 02:53:36,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:36,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582854440] [2019-11-28 02:53:36,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 12 proven. 186 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 02:53:36,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582854440] [2019-11-28 02:53:36,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444105937] [2019-11-28 02:53:36,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:36,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 02:53:36,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 80 proven. 108 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-28 02:53:36,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:53:36,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 24 [2019-11-28 02:53:36,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957598198] [2019-11-28 02:53:36,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 02:53:36,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:36,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 02:53:36,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-11-28 02:53:36,703 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand 24 states. [2019-11-28 02:53:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:37,612 INFO L93 Difference]: Finished difference Result 263 states and 338 transitions. [2019-11-28 02:53:37,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-28 02:53:37,612 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2019-11-28 02:53:37,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:37,614 INFO L225 Difference]: With dead ends: 263 [2019-11-28 02:53:37,614 INFO L226 Difference]: Without dead ends: 145 [2019-11-28 02:53:37,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=327, Invalid=1155, Unknown=0, NotChecked=0, Total=1482 [2019-11-28 02:53:37,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-28 02:53:37,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 133. [2019-11-28 02:53:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-28 02:53:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2019-11-28 02:53:37,629 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 163 transitions. Word has length 73 [2019-11-28 02:53:37,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:37,629 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 163 transitions. [2019-11-28 02:53:37,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 02:53:37,629 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 163 transitions. [2019-11-28 02:53:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-28 02:53:37,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:37,640 INFO L410 BasicCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 02:53:37,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:37,850 INFO L410 AbstractCegarLoop]: === Iteration 12 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:37,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:37,851 INFO L82 PathProgramCache]: Analyzing trace with hash -453713612, now seen corresponding path program 2 times [2019-11-28 02:53:37,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:37,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61835548] [2019-11-28 02:53:37,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 174 proven. 127 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 02:53:38,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61835548] [2019-11-28 02:53:38,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938768329] [2019-11-28 02:53:38,300 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:38,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:53:38,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:53:38,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 02:53:38,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 178 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 02:53:38,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:53:38,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21] total 31 [2019-11-28 02:53:38,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971527020] [2019-11-28 02:53:38,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-28 02:53:38,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:38,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-28 02:53:38,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2019-11-28 02:53:38,430 INFO L87 Difference]: Start difference. First operand 133 states and 163 transitions. Second operand 31 states. [2019-11-28 02:53:40,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:40,146 INFO L93 Difference]: Finished difference Result 275 states and 347 transitions. [2019-11-28 02:53:40,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-11-28 02:53:40,146 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 85 [2019-11-28 02:53:40,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:40,148 INFO L225 Difference]: With dead ends: 275 [2019-11-28 02:53:40,148 INFO L226 Difference]: Without dead ends: 156 [2019-11-28 02:53:40,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1353, Invalid=4197, Unknown=0, NotChecked=0, Total=5550 [2019-11-28 02:53:40,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-28 02:53:40,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2019-11-28 02:53:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-28 02:53:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2019-11-28 02:53:40,170 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 85 [2019-11-28 02:53:40,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:40,171 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2019-11-28 02:53:40,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-28 02:53:40,171 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2019-11-28 02:53:40,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-28 02:53:40,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:40,181 INFO L410 BasicCegarLoop]: trace histogram [12, 10, 8, 8, 8, 8, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1] [2019-11-28 02:53:40,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:40,385 INFO L410 AbstractCegarLoop]: === Iteration 13 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:40,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:40,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1738955289, now seen corresponding path program 3 times [2019-11-28 02:53:40,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:40,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306820737] [2019-11-28 02:53:40,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 16 proven. 272 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-28 02:53:40,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306820737] [2019-11-28 02:53:40,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845429298] [2019-11-28 02:53:40,755 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:40,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-28 02:53:40,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:53:40,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:53:40,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:40,942 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 100 proven. 51 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-28 02:53:40,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:53:40,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 33 [2019-11-28 02:53:40,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959448768] [2019-11-28 02:53:40,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-28 02:53:40,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:40,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-28 02:53:40,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 02:53:40,945 INFO L87 Difference]: Start difference. First operand 128 states and 149 transitions. Second operand 33 states. [2019-11-28 02:53:42,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:42,299 INFO L93 Difference]: Finished difference Result 265 states and 311 transitions. [2019-11-28 02:53:42,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-28 02:53:42,299 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 92 [2019-11-28 02:53:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:42,301 INFO L225 Difference]: With dead ends: 265 [2019-11-28 02:53:42,301 INFO L226 Difference]: Without dead ends: 142 [2019-11-28 02:53:42,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=517, Invalid=2453, Unknown=0, NotChecked=0, Total=2970 [2019-11-28 02:53:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-28 02:53:42,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2019-11-28 02:53:42,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 02:53:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 151 transitions. [2019-11-28 02:53:42,321 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 151 transitions. Word has length 92 [2019-11-28 02:53:42,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:42,323 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 151 transitions. [2019-11-28 02:53:42,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-28 02:53:42,324 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2019-11-28 02:53:42,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-28 02:53:42,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:42,327 INFO L410 BasicCegarLoop]: trace histogram [14, 11, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1] [2019-11-28 02:53:42,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:42,533 INFO L410 AbstractCegarLoop]: === Iteration 14 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:42,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:42,534 INFO L82 PathProgramCache]: Analyzing trace with hash -934108332, now seen corresponding path program 4 times [2019-11-28 02:53:42,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:42,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795242192] [2019-11-28 02:53:42,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 41 proven. 340 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-11-28 02:53:43,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795242192] [2019-11-28 02:53:43,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009713099] [2019-11-28 02:53:43,096 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:43,163 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:53:43,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:53:43,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 02:53:43,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:43,296 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 186 proven. 214 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 02:53:43,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:53:43,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18] total 28 [2019-11-28 02:53:43,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15854440] [2019-11-28 02:53:43,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 02:53:43,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:43,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 02:53:43,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2019-11-28 02:53:43,302 INFO L87 Difference]: Start difference. First operand 132 states and 151 transitions. Second operand 28 states. [2019-11-28 02:53:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:44,396 INFO L93 Difference]: Finished difference Result 260 states and 297 transitions. [2019-11-28 02:53:44,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-28 02:53:44,396 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 111 [2019-11-28 02:53:44,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:44,399 INFO L225 Difference]: With dead ends: 260 [2019-11-28 02:53:44,399 INFO L226 Difference]: Without dead ends: 142 [2019-11-28 02:53:44,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=417, Invalid=1745, Unknown=0, NotChecked=0, Total=2162 [2019-11-28 02:53:44,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-28 02:53:44,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2019-11-28 02:53:44,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 02:53:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 150 transitions. [2019-11-28 02:53:44,416 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 150 transitions. Word has length 111 [2019-11-28 02:53:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:44,417 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 150 transitions. [2019-11-28 02:53:44,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 02:53:44,418 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 150 transitions. [2019-11-28 02:53:44,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-28 02:53:44,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:44,419 INFO L410 BasicCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1] [2019-11-28 02:53:44,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:44,623 INFO L410 AbstractCegarLoop]: === Iteration 15 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:44,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:44,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1590749972, now seen corresponding path program 5 times [2019-11-28 02:53:44,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:44,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434570887] [2019-11-28 02:53:44,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:44,765 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 23 proven. 35 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-11-28 02:53:44,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434570887] [2019-11-28 02:53:44,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053564141] [2019-11-28 02:53:44,766 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:44,822 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-11-28 02:53:44,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:53:44,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 02:53:44,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 23 proven. 35 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-11-28 02:53:44,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:53:44,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-11-28 02:53:44,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39851952] [2019-11-28 02:53:44,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 02:53:44,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:44,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:53:44,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:53:44,898 INFO L87 Difference]: Start difference. First operand 132 states and 150 transitions. Second operand 13 states. [2019-11-28 02:53:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:44,968 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2019-11-28 02:53:44,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:53:44,969 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2019-11-28 02:53:44,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:44,970 INFO L225 Difference]: With dead ends: 134 [2019-11-28 02:53:44,971 INFO L226 Difference]: Without dead ends: 133 [2019-11-28 02:53:44,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:53:44,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-28 02:53:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-11-28 02:53:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 02:53:44,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2019-11-28 02:53:44,980 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 112 [2019-11-28 02:53:44,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:44,981 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2019-11-28 02:53:44,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 02:53:44,981 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2019-11-28 02:53:44,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-28 02:53:44,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:44,982 INFO L410 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-11-28 02:53:45,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:45,187 INFO L410 AbstractCegarLoop]: === Iteration 16 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:45,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:45,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2068608930, now seen corresponding path program 1 times [2019-11-28 02:53:45,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:45,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739501792] [2019-11-28 02:53:45,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 38 proven. 23 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-11-28 02:53:45,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739501792] [2019-11-28 02:53:45,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663699180] [2019-11-28 02:53:45,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:45,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 02:53:45,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 30 proven. 44 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-11-28 02:53:45,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:53:45,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2019-11-28 02:53:45,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525585308] [2019-11-28 02:53:45,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 02:53:45,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:45,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 02:53:45,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:53:45,644 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand 15 states. [2019-11-28 02:53:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:45,737 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2019-11-28 02:53:45,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:53:45,738 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 113 [2019-11-28 02:53:45,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:45,740 INFO L225 Difference]: With dead ends: 132 [2019-11-28 02:53:45,740 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 02:53:45,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:53:45,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 02:53:45,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-28 02:53:45,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 02:53:45,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2019-11-28 02:53:45,753 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 113 [2019-11-28 02:53:45,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:45,754 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2019-11-28 02:53:45,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 02:53:45,754 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2019-11-28 02:53:45,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-28 02:53:45,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:45,757 INFO L410 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-11-28 02:53:45,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:45,966 INFO L410 AbstractCegarLoop]: === Iteration 17 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:45,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:45,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1288089853, now seen corresponding path program 6 times [2019-11-28 02:53:45,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:45,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437423473] [2019-11-28 02:53:45,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2019-11-28 02:53:46,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437423473] [2019-11-28 02:53:46,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556558884] [2019-11-28 02:53:46,211 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:46,282 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-11-28 02:53:46,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:53:46,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-28 02:53:46,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2019-11-28 02:53:46,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:53:46,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2019-11-28 02:53:46,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339602014] [2019-11-28 02:53:46,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 02:53:46,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:46,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 02:53:46,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-11-28 02:53:46,430 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 17 states. [2019-11-28 02:53:46,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:46,503 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2019-11-28 02:53:46,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 02:53:46,504 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 165 [2019-11-28 02:53:46,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:46,506 INFO L225 Difference]: With dead ends: 131 [2019-11-28 02:53:46,506 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 02:53:46,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-11-28 02:53:46,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 02:53:46,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-28 02:53:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 02:53:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2019-11-28 02:53:46,525 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 165 [2019-11-28 02:53:46,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:46,526 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2019-11-28 02:53:46,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 02:53:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2019-11-28 02:53:46,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-28 02:53:46,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:46,535 INFO L410 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-11-28 02:53:46,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:46,740 INFO L410 AbstractCegarLoop]: === Iteration 18 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:46,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:46,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1461844116, now seen corresponding path program 7 times [2019-11-28 02:53:46,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:46,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816288628] [2019-11-28 02:53:46,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 272 proven. 389 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2019-11-28 02:53:47,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816288628] [2019-11-28 02:53:47,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44692635] [2019-11-28 02:53:47,176 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:47,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-28 02:53:47,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:47,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2327 backedges. 272 proven. 389 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2019-11-28 02:53:47,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:53:47,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2019-11-28 02:53:47,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197154447] [2019-11-28 02:53:47,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 02:53:47,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:47,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 02:53:47,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-28 02:53:47,569 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand 21 states. [2019-11-28 02:53:47,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:47,659 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2019-11-28 02:53:47,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 02:53:47,660 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 257 [2019-11-28 02:53:47,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:47,662 INFO L225 Difference]: With dead ends: 131 [2019-11-28 02:53:47,662 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 02:53:47,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-11-28 02:53:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 02:53:47,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-28 02:53:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 02:53:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2019-11-28 02:53:47,678 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 257 [2019-11-28 02:53:47,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:47,679 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2019-11-28 02:53:47,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 02:53:47,680 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2019-11-28 02:53:47,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-11-28 02:53:47,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:47,689 INFO L410 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-11-28 02:53:47,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:47,895 INFO L410 AbstractCegarLoop]: === Iteration 19 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:47,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:47,896 INFO L82 PathProgramCache]: Analyzing trace with hash 648414394, now seen corresponding path program 8 times [2019-11-28 02:53:47,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:47,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216677907] [2019-11-28 02:53:47,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 820 proven. 1093 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2019-11-28 02:53:48,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216677907] [2019-11-28 02:53:48,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651127522] [2019-11-28 02:53:48,900 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:49,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:53:49,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:53:49,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 81 conjunts are in the unsatisfiable core [2019-11-28 02:53:49,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:49,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 820 proven. 1093 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2019-11-28 02:53:49,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:53:49,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2019-11-28 02:53:49,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637706858] [2019-11-28 02:53:49,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 02:53:49,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:49,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 02:53:49,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2019-11-28 02:53:49,519 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 25 states. [2019-11-28 02:53:49,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:49,617 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2019-11-28 02:53:49,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 02:53:49,618 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 408 [2019-11-28 02:53:49,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:49,620 INFO L225 Difference]: With dead ends: 131 [2019-11-28 02:53:49,620 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 02:53:49,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2019-11-28 02:53:49,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 02:53:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-28 02:53:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 02:53:49,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2019-11-28 02:53:49,628 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 408 [2019-11-28 02:53:49,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:49,629 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2019-11-28 02:53:49,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 02:53:49,629 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2019-11-28 02:53:49,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2019-11-28 02:53:49,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:49,646 INFO L410 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-11-28 02:53:49,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:49,850 INFO L410 AbstractCegarLoop]: === Iteration 20 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:49,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:49,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1470667451, now seen corresponding path program 9 times [2019-11-28 02:53:49,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:49,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195222922] [2019-11-28 02:53:49,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 15678 backedges. 2390 proven. 2946 refuted. 0 times theorem prover too weak. 10342 trivial. 0 not checked. [2019-11-28 02:53:51,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195222922] [2019-11-28 02:53:51,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19862461] [2019-11-28 02:53:51,806 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:52,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-11-28 02:53:52,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:53:52,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 133 conjunts are in the unsatisfiable core [2019-11-28 02:53:52,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 15678 backedges. 2390 proven. 2946 refuted. 0 times theorem prover too weak. 10342 trivial. 0 not checked. [2019-11-28 02:53:52,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:53:52,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 28 [2019-11-28 02:53:52,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511241375] [2019-11-28 02:53:52,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-28 02:53:52,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:52,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-28 02:53:52,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2019-11-28 02:53:52,670 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand 29 states. [2019-11-28 02:53:52,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:52,795 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2019-11-28 02:53:52,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 02:53:52,795 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 657 [2019-11-28 02:53:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:52,798 INFO L225 Difference]: With dead ends: 131 [2019-11-28 02:53:52,798 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 02:53:52,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 921 GetRequests, 894 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2019-11-28 02:53:52,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 02:53:52,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-28 02:53:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 02:53:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2019-11-28 02:53:52,807 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 657 [2019-11-28 02:53:52,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:52,809 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2019-11-28 02:53:52,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-28 02:53:52,809 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2019-11-28 02:53:52,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1064 [2019-11-28 02:53:52,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:53:52,823 INFO L410 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-11-28 02:53:53,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:53,038 INFO L410 AbstractCegarLoop]: === Iteration 21 === [fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 02:53:53,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:53:53,039 INFO L82 PathProgramCache]: Analyzing trace with hash 607316682, now seen corresponding path program 10 times [2019-11-28 02:53:53,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:53:53,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644544402] [2019-11-28 02:53:53,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:53:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:53:56,859 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6686 proven. 7802 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2019-11-28 02:53:56,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644544402] [2019-11-28 02:53:56,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548196209] [2019-11-28 02:53:56,860 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:57,157 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:53:57,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:53:57,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 1968 conjuncts, 217 conjunts are in the unsatisfiable core [2019-11-28 02:53:57,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:53:58,286 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6686 proven. 7802 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2019-11-28 02:53:58,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:53:58,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 32 [2019-11-28 02:53:58,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870544471] [2019-11-28 02:53:58,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-28 02:53:58,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:53:58,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-28 02:53:58,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 02:53:58,291 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 33 states. [2019-11-28 02:53:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:53:58,389 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-11-28 02:53:58,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 02:53:58,389 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1063 [2019-11-28 02:53:58,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:53:58,392 INFO L225 Difference]: With dead ends: 130 [2019-11-28 02:53:58,392 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:53:58,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1495 GetRequests, 1464 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 02:53:58,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:53:58,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:53:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:53:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:53:58,394 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1063 [2019-11-28 02:53:58,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:53:58,394 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:53:58,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-28 02:53:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:53:58,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:53:58,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:53:58,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 02:53:59,327 WARN L192 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 72 [2019-11-28 02:53:59,494 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 11 [2019-11-28 02:53:59,500 INFO L246 CegarLoopResult]: For program point fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:53:59,500 INFO L246 CegarLoopResult]: For program point fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:53:59,500 INFO L246 CegarLoopResult]: For program point fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:53:59,500 INFO L246 CegarLoopResult]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2019-11-28 02:53:59,500 INFO L246 CegarLoopResult]: For program point L17(lines 17 21) no Hoare annotation was computed. [2019-11-28 02:53:59,500 INFO L246 CegarLoopResult]: For program point L15(lines 15 21) no Hoare annotation was computed. [2019-11-28 02:53:59,501 INFO L246 CegarLoopResult]: For program point fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:53:59,501 INFO L246 CegarLoopResult]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2019-11-28 02:53:59,501 INFO L246 CegarLoopResult]: For program point fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:53:59,501 INFO L246 CegarLoopResult]: For program point fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-11-28 02:53:59,502 INFO L249 CegarLoopResult]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2019-11-28 02:53:59,502 INFO L246 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-28 02:53:59,502 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-11-28 02:53:59,502 INFO L242 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (or (= fibonacci_~n |fibonacci_#in~n|) (not (<= |fibonacci_#in~n| 9))) (not (<= |fibonacci_#in~n| 1))) [2019-11-28 02:53:59,502 INFO L246 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-11-28 02:53:59,502 INFO L246 CegarLoopResult]: For program point L20-4(line 20) no Hoare annotation was computed. [2019-11-28 02:53:59,502 INFO L246 CegarLoopResult]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-11-28 02:53:59,503 INFO L242 CegarLoopResult]: At program point L20-6(line 20) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|)) (.cse1 (<= 2 |fibonacci_#t~ret0|))) (and (or (not (<= |fibonacci_#in~n| 4)) (not (<= 4 |fibonacci_#in~n|)) (and (<= |fibonacci_#t~ret0| 2) .cse0 .cse1)) (or (< 1 fibonacci_~n) (not (<= |fibonacci_#in~n| 2))) (or (not (<= 9 |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 9)) (and (<= |fibonacci_#t~ret0| 21) .cse0 .cse1)) (or (not (<= |fibonacci_#in~n| 7)) (not (<= 7 |fibonacci_#in~n|)) (and (<= |fibonacci_#t~ret0| 8) .cse0 .cse1)) (or (not (<= |fibonacci_#in~n| 5)) (and (<= |fibonacci_#t~ret0| 3) (<= fibonacci_~n 5) .cse1 (<= 5 fibonacci_~n)) (not (<= 5 |fibonacci_#in~n|))) (or (and (<= |fibonacci_#t~ret0| 1) (<= 1 |fibonacci_#t~ret0|) .cse0) (not (<= |fibonacci_#in~n| 3))) (or (and .cse0 .cse1 (<= |fibonacci_#t~ret0| 13)) (not (<= 8 |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 8))) (or (and (<= |fibonacci_#t~ret0| 5) .cse0 .cse1) (not (<= 6 |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 6))))) [2019-11-28 02:53:59,504 INFO L246 CegarLoopResult]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-11-28 02:53:59,504 INFO L246 CegarLoopResult]: For program point L20-8(line 20) no Hoare annotation was computed. [2019-11-28 02:53:59,504 INFO L246 CegarLoopResult]: For program point L20-9(line 20) no Hoare annotation was computed. [2019-11-28 02:53:59,504 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 02:53:59,504 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-28 02:53:59,505 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 02:53:59,505 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 02:53:59,505 INFO L246 CegarLoopResult]: For program point L28(lines 28 32) no Hoare annotation was computed. [2019-11-28 02:53:59,505 INFO L242 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0)) [2019-11-28 02:53:59,505 INFO L246 CegarLoopResult]: For program point L27-1(line 27) no Hoare annotation was computed. [2019-11-28 02:53:59,506 INFO L242 CegarLoopResult]: At program point L25(lines 25 33) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 9) [2019-11-28 02:53:59,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:53:59 BoogieIcfgContainer [2019-11-28 02:53:59,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:53:59,525 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:53:59,526 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:53:59,526 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:53:59,527 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:53:28" (3/4) ... [2019-11-28 02:53:59,533 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:53:59,540 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2019-11-28 02:53:59,553 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 02:53:59,555 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:53:59,619 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:53:59,619 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:53:59,621 INFO L168 Benchmark]: Toolchain (without parser) took 32040.19 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 960.4 MB in the beginning and 1.5 GB in the end (delta: -587.6 MB). Peak memory consumption was 521.3 MB. Max. memory is 11.5 GB. [2019-11-28 02:53:59,622 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:53:59,622 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.33 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:53:59,623 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:53:59,623 INFO L168 Benchmark]: Boogie Preprocessor took 32.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:53:59,624 INFO L168 Benchmark]: RCFGBuilder took 267.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:53:59,624 INFO L168 Benchmark]: TraceAbstraction took 31214.84 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 992.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -455.8 MB). Peak memory consumption was 536.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:53:59,624 INFO L168 Benchmark]: Witness Printer took 94.17 ms. Allocated memory is still 2.1 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:53:59,627 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.33 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.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 112.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 267.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31214.84 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 992.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -455.8 MB). Peak memory consumption was 536.1 MB. Max. memory is 11.5 GB. * Witness Printer took 94.17 ms. Allocated memory is still 2.1 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. Result: SAFE, OverallTime: 30.1s, OverallIterations: 21, TraceHistogramMax: 109, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 599 SDtfs, 2654 SDslu, 3666 SDs, 0 SdLazy, 6109 SolverSat, 1001 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5006 GetRequests, 4475 SyntacticMatches, 0 SemanticMatches, 531 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3656 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 122 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 302 PreInvPairs, 355 NumberOfFragments, 165 HoareAnnotationTreeSize, 302 FomulaSimplifications, 263 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 1203 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 6943 NumberOfCodeBlocks, 6842 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 6903 ConstructedInterpolants, 0 QuantifiedInterpolants, 9620914 SizeOfPredicates, 60 NumberOfNonLiveVariables, 6257 ConjunctsInSsa, 675 ConjunctsInUnsatCore, 40 InterpolantComputations, 5 PerfectInterpolantSequences, 111077/138086 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...