/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:25:42,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:25:42,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:25:42,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:25:42,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:25:42,865 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:25:42,867 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:25:42,868 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:25:42,870 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:25:42,871 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:25:42,872 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:25:42,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:25:42,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:25:42,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:25:42,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:25:42,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:25:42,878 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:25:42,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:25:42,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:25:42,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:25:42,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:25:42,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:25:42,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:25:42,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:25:42,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:25:42,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:25:42,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:25:42,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:25:42,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:25:42,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:25:42,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:25:42,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:25:42,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:25:42,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:25:42,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:25:42,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:25:42,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:25:42,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:25:42,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:25:42,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:25:42,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:25:42,911 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 16:25:42,923 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:25:42,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:25:42,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:25:42,925 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:25:42,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:25:42,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:25:42,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:25:42,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:25:42,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:25:42,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:25:42,926 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:25:42,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:25:42,927 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:25:42,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:25:42,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:25:42,927 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:25:42,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:25:42,928 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:25:42,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:25:42,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:25:42,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:25:42,928 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:25:42,929 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:25:43,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:25:43,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:25:43,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:25:43,418 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:25:43,419 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:25:43,420 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c [2020-09-04 16:25:43,514 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/347116451/d875eed3bc80404da810562661d08dea/FLAG02d323709 [2020-09-04 16:25:44,106 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:25:44,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_2calls_2-2.c [2020-09-04 16:25:44,117 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/347116451/d875eed3bc80404da810562661d08dea/FLAG02d323709 [2020-09-04 16:25:44,439 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/347116451/d875eed3bc80404da810562661d08dea [2020-09-04 16:25:44,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:25:44,457 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:25:44,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:25:44,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:25:44,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:25:44,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:25:44" (1/1) ... [2020-09-04 16:25:44,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c20a301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:25:44, skipping insertion in model container [2020-09-04 16:25:44,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:25:44" (1/1) ... [2020-09-04 16:25:44,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:25:44,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:25:44,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:25:44,729 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:25:44,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:25:44,769 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:25:44,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:25:44 WrapperNode [2020-09-04 16:25:44,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:25:44,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:25:44,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:25:44,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:25:44,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:25:44" (1/1) ... [2020-09-04 16:25:44,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:25:44" (1/1) ... [2020-09-04 16:25:44,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:25:44" (1/1) ... [2020-09-04 16:25:44,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:25:44" (1/1) ... [2020-09-04 16:25:44,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:25:44" (1/1) ... [2020-09-04 16:25:44,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:25:44" (1/1) ... [2020-09-04 16:25:44,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:25:44" (1/1) ... [2020-09-04 16:25:44,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:25:44,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:25:44,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:25:44,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:25:44,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:25:44" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:25:44,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:25:44,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:25:44,964 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-09-04 16:25:44,964 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-09-04 16:25:44,964 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:25:44,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:25:44,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:25:44,965 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-09-04 16:25:44,965 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-09-04 16:25:44,965 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:25:44,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:25:44,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:25:45,208 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:25:45,209 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:25:45,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:25:45 BoogieIcfgContainer [2020-09-04 16:25:45,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:25:45,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:25:45,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:25:45,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:25:45,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:25:44" (1/3) ... [2020-09-04 16:25:45,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a818577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:25:45, skipping insertion in model container [2020-09-04 16:25:45,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:25:44" (2/3) ... [2020-09-04 16:25:45,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a818577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:25:45, skipping insertion in model container [2020-09-04 16:25:45,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:25:45" (3/3) ... [2020-09-04 16:25:45,227 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-2.c [2020-09-04 16:25:45,241 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:25:45,253 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:25:45,278 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:25:45,310 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:25:45,310 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:25:45,310 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:25:45,310 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:25:45,311 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:25:45,311 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:25:45,311 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:25:45,311 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:25:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-09-04 16:25:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 16:25:45,348 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:25:45,349 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:25:45,353 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:25:45,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:25:45,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-09-04 16:25:45,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:25:45,381 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [201209130] [2020-09-04 16:25:45,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:25:45,450 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:25:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:45,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:25:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:45,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:25:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:25:45,671 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [201209130] [2020-09-04 16:25:45,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:25:45,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:25:45,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442080305] [2020-09-04 16:25:45,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:25:45,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:25:45,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:25:45,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:25:45,696 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-09-04 16:25:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:25:45,860 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-09-04 16:25:45,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:25:45,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 16:25:45,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:25:45,878 INFO L225 Difference]: With dead ends: 58 [2020-09-04 16:25:45,878 INFO L226 Difference]: Without dead ends: 42 [2020-09-04 16:25:45,884 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:25:45,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-09-04 16:25:45,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-09-04 16:25:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 16:25:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-09-04 16:25:45,942 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-09-04 16:25:45,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:25:45,942 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-09-04 16:25:45,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:25:45,943 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-09-04 16:25:45,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 16:25:45,945 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:25:45,946 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:25:45,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:25:45,946 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:25:45,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:25:45,947 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-09-04 16:25:45,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:25:45,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [705051647] [2020-09-04 16:25:45,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:25:45,950 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:25:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:45,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:25:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:45,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:25:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:25:46,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [705051647] [2020-09-04 16:25:46,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:25:46,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:25:46,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69425386] [2020-09-04 16:25:46,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:25:46,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:25:46,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:25:46,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:25:46,033 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-09-04 16:25:46,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:25:46,109 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-09-04 16:25:46,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:25:46,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-04 16:25:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:25:46,112 INFO L225 Difference]: With dead ends: 50 [2020-09-04 16:25:46,112 INFO L226 Difference]: Without dead ends: 44 [2020-09-04 16:25:46,115 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:25:46,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-09-04 16:25:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-09-04 16:25:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 16:25:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-09-04 16:25:46,130 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-09-04 16:25:46,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:25:46,130 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-09-04 16:25:46,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:25:46,131 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-09-04 16:25:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 16:25:46,133 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:25:46,133 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:25:46,133 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:25:46,134 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:25:46,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:25:46,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-09-04 16:25:46,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:25:46,135 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1658219965] [2020-09-04 16:25:46,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:25:46,138 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:25:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:46,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:25:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:46,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:25:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:46,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:25:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:46,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 16:25:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 16:25:46,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1658219965] [2020-09-04 16:25:46,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:25:46,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:25:46,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98999609] [2020-09-04 16:25:46,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:25:46,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:25:46,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:25:46,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:25:46,283 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-09-04 16:25:46,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:25:46,393 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-09-04 16:25:46,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:25:46,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-09-04 16:25:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:25:46,396 INFO L225 Difference]: With dead ends: 82 [2020-09-04 16:25:46,396 INFO L226 Difference]: Without dead ends: 46 [2020-09-04 16:25:46,398 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:25:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-09-04 16:25:46,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-09-04 16:25:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-09-04 16:25:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-09-04 16:25:46,414 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-09-04 16:25:46,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:25:46,415 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-09-04 16:25:46,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:25:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-09-04 16:25:46,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 16:25:46,418 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:25:46,418 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:25:46,419 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:25:46,419 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:25:46,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:25:46,420 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-09-04 16:25:46,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:25:46,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [961308196] [2020-09-04 16:25:46,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:25:46,423 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:25:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:46,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:25:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:46,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:25:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:46,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:25:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:46,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:25:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 16:25:46,695 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [961308196] [2020-09-04 16:25:46,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:25:46,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:25:46,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220988995] [2020-09-04 16:25:46,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:25:46,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:25:46,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:25:46,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:25:46,698 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 9 states. [2020-09-04 16:25:46,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:25:46,869 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2020-09-04 16:25:46,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:25:46,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2020-09-04 16:25:46,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:25:46,873 INFO L225 Difference]: With dead ends: 66 [2020-09-04 16:25:46,873 INFO L226 Difference]: Without dead ends: 60 [2020-09-04 16:25:46,874 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:25:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-04 16:25:46,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2020-09-04 16:25:46,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-09-04 16:25:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2020-09-04 16:25:46,890 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 34 [2020-09-04 16:25:46,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:25:46,890 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2020-09-04 16:25:46,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:25:46,891 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2020-09-04 16:25:46,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-09-04 16:25:46,893 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:25:46,893 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:25:46,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:25:46,894 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:25:46,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:25:46,894 INFO L82 PathProgramCache]: Analyzing trace with hash 186293384, now seen corresponding path program 1 times [2020-09-04 16:25:46,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:25:46,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [943673634] [2020-09-04 16:25:46,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:25:46,897 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:25:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:46,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:25:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:46,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:25:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:46,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:25:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:47,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:25:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 16:25:47,064 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [943673634] [2020-09-04 16:25:47,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:25:47,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:25:47,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724957528] [2020-09-04 16:25:47,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:25:47,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:25:47,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:25:47,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:25:47,067 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 7 states. [2020-09-04 16:25:47,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:25:47,240 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2020-09-04 16:25:47,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:25:47,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-09-04 16:25:47,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:25:47,243 INFO L225 Difference]: With dead ends: 101 [2020-09-04 16:25:47,244 INFO L226 Difference]: Without dead ends: 54 [2020-09-04 16:25:47,245 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:25:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-09-04 16:25:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-09-04 16:25:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-04 16:25:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2020-09-04 16:25:47,269 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 35 [2020-09-04 16:25:47,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:25:47,270 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2020-09-04 16:25:47,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:25:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2020-09-04 16:25:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-09-04 16:25:47,282 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:25:47,283 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:25:47,283 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:25:47,284 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:25:47,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:25:47,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-09-04 16:25:47,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:25:47,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [984528148] [2020-09-04 16:25:47,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:25:47,313 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:25:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:47,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:25:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:47,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:25:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:47,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:25:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:47,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:25:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:47,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 16:25:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:47,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 16:25:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 16:25:47,454 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [984528148] [2020-09-04 16:25:47,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:25:47,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:25:47,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222069660] [2020-09-04 16:25:47,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:25:47,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:25:47,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:25:47,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:25:47,456 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 7 states. [2020-09-04 16:25:47,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:25:47,549 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2020-09-04 16:25:47,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:25:47,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2020-09-04 16:25:47,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:25:47,551 INFO L225 Difference]: With dead ends: 104 [2020-09-04 16:25:47,551 INFO L226 Difference]: Without dead ends: 56 [2020-09-04 16:25:47,553 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:25:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-09-04 16:25:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-09-04 16:25:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-09-04 16:25:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2020-09-04 16:25:47,568 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 50 [2020-09-04 16:25:47,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:25:47,569 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2020-09-04 16:25:47,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:25:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2020-09-04 16:25:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 16:25:47,571 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:25:47,571 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:25:47,571 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:25:47,572 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:25:47,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:25:47,572 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-09-04 16:25:47,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:25:47,573 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1705386222] [2020-09-04 16:25:47,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:25:47,579 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:25:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:47,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:25:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:47,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:25:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:47,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:25:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:47,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:25:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:47,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:25:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:47,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:25:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:25:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 16:25:47,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1705386222] [2020-09-04 16:25:47,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:25:47,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:25:47,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77438146] [2020-09-04 16:25:47,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:25:47,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:25:47,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:25:47,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:25:47,747 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 8 states. [2020-09-04 16:25:47,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:25:47,930 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2020-09-04 16:25:47,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:25:47,931 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-09-04 16:25:47,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:25:47,932 INFO L225 Difference]: With dead ends: 56 [2020-09-04 16:25:47,932 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:25:47,934 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:25:47,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:25:47,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:25:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:25:47,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:25:47,935 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2020-09-04 16:25:47,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:25:47,935 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:25:47,935 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:25:47,935 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:25:47,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:25:47,936 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:25:47,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:25:48,597 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2020-09-04 16:25:48,845 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2020-09-04 16:25:49,334 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:25:49,335 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:25:49,335 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:25:49,335 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:25:49,335 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:25:49,336 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:25:49,336 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) the Hoare annotation is: false [2020-09-04 16:25:49,336 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-09-04 16:25:49,336 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 35 42) the Hoare annotation is: (<= 2 main_~x~0) [2020-09-04 16:25:49,336 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 35 42) the Hoare annotation is: (<= 2 main_~x~0) [2020-09-04 16:25:49,337 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: false [2020-09-04 16:25:49,337 INFO L264 CegarLoopResult]: At program point L38(lines 38 40) the Hoare annotation is: (and (<= 2 main_~x~0) (<= main_~result~0 1) (< 0 main_~result~0)) [2020-09-04 16:25:49,337 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 2 main_~x~0) (<= main_~x~0 2)) [2020-09-04 16:25:49,337 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= 2 main_~x~0) (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1)) [2020-09-04 16:25:49,337 INFO L264 CegarLoopResult]: At program point L38-2(lines 38 40) the Hoare annotation is: (<= 2 main_~x~0) [2020-09-04 16:25:49,338 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (<= 2 main_~x~0) (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1)) [2020-09-04 16:25:49,338 INFO L264 CegarLoopResult]: At program point L37-3(line 37) the Hoare annotation is: (and (<= 2 main_~x~0) (<= main_~result~0 1) (<= 1 |main_#t~ret4|) (<= |main_#t~ret4| 1) (< 0 main_~result~0)) [2020-09-04 16:25:49,338 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-09-04 16:25:49,338 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-09-04 16:25:49,338 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-09-04 16:25:49,339 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 1) (< 0 fibo2_~n)) [2020-09-04 16:25:49,339 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-09-04 16:25:49,339 INFO L264 CegarLoopResult]: At program point L20(lines 20 24) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 0 fibo2_~n)) [2020-09-04 16:25:49,339 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-09-04 16:25:49,339 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 0)) [2020-09-04 16:25:49,339 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-09-04 16:25:49,340 INFO L264 CegarLoopResult]: At program point L18(lines 18 24) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-09-04 16:25:49,340 INFO L264 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-09-04 16:25:49,340 INFO L264 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-09-04 16:25:49,340 INFO L264 CegarLoopResult]: At program point fibo2FINAL(lines 17 25) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (or (and (<= 1 |fibo2_#in~n|) (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1)) (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|) (<= |fibo2_#in~n| 0)) (not (<= |fibo2_#in~n| 1)))) [2020-09-04 16:25:49,340 INFO L264 CegarLoopResult]: At program point fibo2EXIT(lines 17 25) the Hoare annotation is: (and (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse0) (and .cse0 (<= 2 |fibo2_#in~n|)) (and .cse0 (<= |fibo2_#in~n| 0)))) (or (<= 1 |fibo2_#in~n|) (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)))) [2020-09-04 16:25:49,341 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-09-04 16:25:49,341 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (< 1 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-09-04 16:25:49,341 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#t~ret0| 1) (< 1 fibo1_~n) (<= 1 |fibo1_#t~ret0|) .cse0))) [2020-09-04 16:25:49,341 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-09-04 16:25:49,341 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#t~ret0| 1) (< 1 fibo1_~n) (<= 1 |fibo1_#t~ret0|) .cse0))) [2020-09-04 16:25:49,342 INFO L264 CegarLoopResult]: At program point fibo1FINAL(lines 7 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (and .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (and (<= |fibo1_#in~n| 1) .cse0))) [2020-09-04 16:25:49,342 INFO L264 CegarLoopResult]: At program point L10(lines 10 14) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-09-04 16:25:49,342 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (let ((.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (let ((.cse0 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (<= .cse0 1) (<= |fibo1_#t~ret0| 1) (<= 1 .cse0) (< 1 fibo1_~n) (<= 1 |fibo1_#t~ret0|) .cse1)) (and .cse1 (<= 3 |fibo1_#in~n|)))) [2020-09-04 16:25:49,342 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (<= |fibo1_#in~n| 0) (= fibo1_~n |fibo1_#in~n|)) [2020-09-04 16:25:49,343 INFO L264 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (let ((.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (let ((.cse0 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (<= .cse0 1) (<= |fibo1_#t~ret0| 1) (<= 1 .cse0) (< 1 fibo1_~n) (<= 1 |fibo1_#t~ret0|) .cse1)) (and .cse1 (<= 3 |fibo1_#in~n|)))) [2020-09-04 16:25:49,343 INFO L264 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-09-04 16:25:49,343 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (let ((.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (<= .cse1 1) (<= |fibo1_#t~ret0| 1) (<= 1 .cse1) (< 1 fibo1_~n) (<= 1 |fibo1_#t~ret0|) .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|))))) [2020-09-04 16:25:49,343 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#t~ret0| 1) (< 1 fibo1_~n) (<= 1 |fibo1_#t~ret0|) .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)))) [2020-09-04 16:25:49,343 INFO L264 CegarLoopResult]: At program point fibo1EXIT(lines 7 15) the Hoare annotation is: (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= 3 |fibo1_#in~n|)) (and .cse0 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (and (<= |fibo1_#in~n| 1) .cse0))) [2020-09-04 16:25:49,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:25:49 BoogieIcfgContainer [2020-09-04 16:25:49,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:25:49,372 INFO L168 Benchmark]: Toolchain (without parser) took 4915.24 ms. Allocated memory was 138.9 MB in the beginning and 248.0 MB in the end (delta: 109.1 MB). Free memory was 103.3 MB in the beginning and 173.0 MB in the end (delta: -69.7 MB). Peak memory consumption was 116.0 MB. Max. memory is 7.1 GB. [2020-09-04 16:25:49,372 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 16:25:49,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.31 ms. Allocated memory is still 138.9 MB. Free memory was 102.9 MB in the beginning and 93.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-09-04 16:25:49,375 INFO L168 Benchmark]: Boogie Preprocessor took 112.42 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 93.4 MB in the beginning and 181.1 MB in the end (delta: -87.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-09-04 16:25:49,375 INFO L168 Benchmark]: RCFGBuilder took 332.79 ms. Allocated memory is still 202.4 MB. Free memory was 181.1 MB in the beginning and 166.8 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:25:49,376 INFO L168 Benchmark]: TraceAbstraction took 4151.49 ms. Allocated memory was 202.4 MB in the beginning and 248.0 MB in the end (delta: 45.6 MB). Free memory was 166.8 MB in the beginning and 173.0 MB in the end (delta: -6.2 MB). Peak memory consumption was 116.1 MB. Max. memory is 7.1 GB. [2020-09-04 16:25:49,381 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 312.31 ms. Allocated memory is still 138.9 MB. Free memory was 102.9 MB in the beginning and 93.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.42 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 93.4 MB in the beginning and 181.1 MB in the end (delta: -87.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 332.79 ms. Allocated memory is still 202.4 MB. Free memory was 181.1 MB in the beginning and 166.8 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4151.49 ms. Allocated memory was 202.4 MB in the beginning and 248.0 MB in the end (delta: 45.6 MB). Free memory was 166.8 MB in the beginning and 173.0 MB in the end (delta: -6.2 MB). Peak memory consumption was 116.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 35]: Procedure Contract for main Derived contract for procedure main: 2 <= x - ProcedureContractResult [Line: 17]: Procedure Contract for fibo2 Derived contract for procedure fibo2: ((((1 <= \result && \result <= 1) && n == \old(n)) || (n == \old(n) && 2 <= \old(n))) || (n == \old(n) && \old(n) <= 0)) && (1 <= \old(n) || (\result <= 0 && 0 <= \result)) - ProcedureContractResult [Line: 7]: Procedure Contract for fibo1 Derived contract for procedure fibo1: ((n == \old(n) && 3 <= \old(n)) || ((n == \old(n) && \result <= 1) && 1 <= \result)) || (\old(n) <= 1 && n == \old(n)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.6s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 294 SDtfs, 177 SDslu, 1053 SDs, 0 SdLazy, 372 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 297 PreInvPairs, 434 NumberOfFragments, 474 HoareAnnotationTreeSize, 297 FomulaSimplifications, 2056 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 45 FomulaSimplificationsInter, 655 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...