/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_5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:28:01,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:28:01,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:28:01,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:28:01,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:28:01,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:28:01,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:28:01,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:28:01,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:28:01,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:28:01,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:28:01,111 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:28:01,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:28:01,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:28:01,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:28:01,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:28:01,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:28:01,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:28:01,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:28:01,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:28:01,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:28:01,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:28:01,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:28:01,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:28:01,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:28:01,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:28:01,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:28:01,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:28:01,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:28:01,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:28:01,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:28:01,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:28:01,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:28:01,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:28:01,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:28:01,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:28:01,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:28:01,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:28:01,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:28:01,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:28:01,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:28:01,137 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:28:01,149 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:28:01,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:28:01,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:28:01,154 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:28:01,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:28:01,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:28:01,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:28:01,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:28:01,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:28:01,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:28:01,159 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:28:01,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:28:01,159 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:28:01,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:28:01,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:28:01,160 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:28:01,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:28:01,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:28:01,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:28:01,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:28:01,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:28:01,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:28:01,161 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:28:01,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:28:01,640 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:28:01,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:28:01,647 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:28:01,647 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:28:01,649 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_5-1.c [2020-09-04 16:28:01,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c8975f2ad/611c83c530e1411eae021ec62fcc445d/FLAG052cfc07d [2020-09-04 16:28:02,292 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:28:02,293 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_5-1.c [2020-09-04 16:28:02,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c8975f2ad/611c83c530e1411eae021ec62fcc445d/FLAG052cfc07d [2020-09-04 16:28:02,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c8975f2ad/611c83c530e1411eae021ec62fcc445d [2020-09-04 16:28:02,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:28:02,602 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:28:02,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:28:02,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:28:02,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:28:02,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:28:02" (1/1) ... [2020-09-04 16:28:02,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc0a92e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:02, skipping insertion in model container [2020-09-04 16:28:02,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:28:02" (1/1) ... [2020-09-04 16:28:02,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:28:02,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:28:02,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:28:02,882 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:28:02,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:28:02,915 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:28:02,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:02 WrapperNode [2020-09-04 16:28:02,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:28:02,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:28:02,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:28:02,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:28:02,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:02" (1/1) ... [2020-09-04 16:28:02,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:02" (1/1) ... [2020-09-04 16:28:02,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:02" (1/1) ... [2020-09-04 16:28:02,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:02" (1/1) ... [2020-09-04 16:28:02,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:02" (1/1) ... [2020-09-04 16:28:02,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:02" (1/1) ... [2020-09-04 16:28:02,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:02" (1/1) ... [2020-09-04 16:28:02,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:28:02,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:28:02,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:28:02,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:28:02,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:02" (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:28:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:28:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:28:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-09-04 16:28:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:28:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:28:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:28:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-09-04 16:28:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:28:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:28:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:28:03,341 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:28:03,342 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:28:03,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:28:03 BoogieIcfgContainer [2020-09-04 16:28:03,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:28:03,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:28:03,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:28:03,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:28:03,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:28:02" (1/3) ... [2020-09-04 16:28:03,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103dd37a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:28:03, skipping insertion in model container [2020-09-04 16:28:03,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:02" (2/3) ... [2020-09-04 16:28:03,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103dd37a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:28:03, skipping insertion in model container [2020-09-04 16:28:03,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:28:03" (3/3) ... [2020-09-04 16:28:03,359 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_5-1.c [2020-09-04 16:28:03,373 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:28:03,385 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:28:03,420 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:28:03,458 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:28:03,458 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:28:03,458 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:28:03,459 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:28:03,459 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:28:03,459 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:28:03,460 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:28:03,460 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:28:03,484 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-09-04 16:28:03,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 16:28:03,500 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:03,501 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:28:03,502 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:03,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:03,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1756383024, now seen corresponding path program 1 times [2020-09-04 16:28:03,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:03,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [981398875] [2020-09-04 16:28:03,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:03,604 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:03,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:03,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:03,786 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:28:03,789 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [981398875] [2020-09-04 16:28:03,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:03,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:28:03,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750076446] [2020-09-04 16:28:03,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:28:03,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:03,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:28:03,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:28:03,822 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2020-09-04 16:28:03,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:03,950 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-09-04 16:28:03,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:28:03,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 16:28:03,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:03,968 INFO L225 Difference]: With dead ends: 44 [2020-09-04 16:28:03,968 INFO L226 Difference]: Without dead ends: 28 [2020-09-04 16:28:03,973 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:28:03,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-04 16:28:04,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-09-04 16:28:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 16:28:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-09-04 16:28:04,041 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2020-09-04 16:28:04,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:04,042 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-09-04 16:28:04,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:28:04,043 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-09-04 16:28:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 16:28:04,046 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:04,046 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:28:04,046 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:28:04,047 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:04,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:04,047 INFO L82 PathProgramCache]: Analyzing trace with hash -389703589, now seen corresponding path program 1 times [2020-09-04 16:28:04,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:04,048 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2091536155] [2020-09-04 16:28:04,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:04,051 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:04,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:04,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:04,127 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:28:04,128 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2091536155] [2020-09-04 16:28:04,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:04,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:28:04,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956953407] [2020-09-04 16:28:04,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:28:04,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:04,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:28:04,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:28:04,132 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2020-09-04 16:28:04,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:04,202 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-09-04 16:28:04,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:28:04,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-04 16:28:04,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:04,205 INFO L225 Difference]: With dead ends: 36 [2020-09-04 16:28:04,205 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 16:28:04,208 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:28:04,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 16:28:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-09-04 16:28:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 16:28:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-09-04 16:28:04,226 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2020-09-04 16:28:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:04,228 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-09-04 16:28:04,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:28:04,229 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-09-04 16:28:04,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 16:28:04,231 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:04,232 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:04,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:28:04,233 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:04,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:04,234 INFO L82 PathProgramCache]: Analyzing trace with hash 50309368, now seen corresponding path program 1 times [2020-09-04 16:28:04,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:04,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1418006400] [2020-09-04 16:28:04,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:04,241 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:04,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:04,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:04,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:04,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 16:28:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 16:28:04,398 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1418006400] [2020-09-04 16:28:04,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:04,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:28:04,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18782789] [2020-09-04 16:28:04,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:28:04,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:04,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:28:04,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:28:04,400 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2020-09-04 16:28:04,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:04,515 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-09-04 16:28:04,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:28:04,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-09-04 16:28:04,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:04,518 INFO L225 Difference]: With dead ends: 52 [2020-09-04 16:28:04,518 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 16:28:04,519 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:28:04,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 16:28:04,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 16:28:04,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 16:28:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-09-04 16:28:04,537 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 33 [2020-09-04 16:28:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:04,538 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-09-04 16:28:04,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:28:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-09-04 16:28:04,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 16:28:04,542 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:04,542 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:04,543 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:28:04,543 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:04,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:04,544 INFO L82 PathProgramCache]: Analyzing trace with hash -643371531, now seen corresponding path program 1 times [2020-09-04 16:28:04,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:04,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1862932875] [2020-09-04 16:28:04,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:04,549 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:04,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:04,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:04,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:04,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 16:28:04,701 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1862932875] [2020-09-04 16:28:04,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:04,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:28:04,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122105661] [2020-09-04 16:28:04,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:28:04,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:04,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:28:04,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:28:04,704 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-09-04 16:28:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:04,875 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2020-09-04 16:28:04,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:28:04,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-09-04 16:28:04,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:04,879 INFO L225 Difference]: With dead ends: 56 [2020-09-04 16:28:04,882 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 16:28:04,883 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:28:04,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 16:28:04,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-09-04 16:28:04,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 16:28:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2020-09-04 16:28:04,922 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2020-09-04 16:28:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:04,923 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-09-04 16:28:04,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:28:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-09-04 16:28:04,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 16:28:04,929 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:04,930 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:04,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:28:04,931 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:04,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1274787059, now seen corresponding path program 2 times [2020-09-04 16:28:04,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:04,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [604914814] [2020-09-04 16:28:04,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:04,936 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-09-04 16:28:05,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [604914814] [2020-09-04 16:28:05,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:05,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:28:05,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953152916] [2020-09-04 16:28:05,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:28:05,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:05,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:28:05,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:28:05,181 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 8 states. [2020-09-04 16:28:05,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:05,338 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2020-09-04 16:28:05,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:28:05,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-09-04 16:28:05,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:05,342 INFO L225 Difference]: With dead ends: 111 [2020-09-04 16:28:05,342 INFO L226 Difference]: Without dead ends: 67 [2020-09-04 16:28:05,344 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:28:05,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-09-04 16:28:05,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2020-09-04 16:28:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-09-04 16:28:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2020-09-04 16:28:05,362 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 51 [2020-09-04 16:28:05,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:05,365 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-09-04 16:28:05,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:28:05,365 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2020-09-04 16:28:05,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 16:28:05,371 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:05,371 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:05,371 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:28:05,375 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:05,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:05,375 INFO L82 PathProgramCache]: Analyzing trace with hash 99184320, now seen corresponding path program 3 times [2020-09-04 16:28:05,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:05,376 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [831705498] [2020-09-04 16:28:05,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:05,380 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 16:28:05,572 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [831705498] [2020-09-04 16:28:05,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:05,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:28:05,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712448998] [2020-09-04 16:28:05,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:28:05,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:05,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:28:05,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:28:05,575 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand 7 states. [2020-09-04 16:28:05,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:05,696 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2020-09-04 16:28:05,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:28:05,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2020-09-04 16:28:05,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:05,700 INFO L225 Difference]: With dead ends: 89 [2020-09-04 16:28:05,700 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 16:28:05,701 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:28:05,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 16:28:05,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2020-09-04 16:28:05,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-09-04 16:28:05,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2020-09-04 16:28:05,729 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 52 [2020-09-04 16:28:05,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:05,730 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2020-09-04 16:28:05,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:28:05,731 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2020-09-04 16:28:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 16:28:05,736 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:05,737 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:05,737 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:28:05,737 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:05,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:05,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1883941443, now seen corresponding path program 4 times [2020-09-04 16:28:05,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:05,739 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1017769773] [2020-09-04 16:28:05,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:05,741 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:05,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:28:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:28:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 11 proven. 69 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2020-09-04 16:28:06,123 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1017769773] [2020-09-04 16:28:06,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:06,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:28:06,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116170937] [2020-09-04 16:28:06,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:28:06,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:06,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:28:06,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:28:06,126 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand 11 states. [2020-09-04 16:28:06,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:06,476 INFO L93 Difference]: Finished difference Result 142 states and 213 transitions. [2020-09-04 16:28:06,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:28:06,477 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2020-09-04 16:28:06,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:06,482 INFO L225 Difference]: With dead ends: 142 [2020-09-04 16:28:06,482 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 16:28:06,484 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:28:06,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 16:28:06,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-09-04 16:28:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 16:28:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2020-09-04 16:28:06,501 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 123 [2020-09-04 16:28:06,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:06,502 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2020-09-04 16:28:06,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:28:06,502 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2020-09-04 16:28:06,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-09-04 16:28:06,505 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:06,505 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:06,505 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:28:06,505 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:06,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:06,506 INFO L82 PathProgramCache]: Analyzing trace with hash 532445701, now seen corresponding path program 5 times [2020-09-04 16:28:06,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:06,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [90979457] [2020-09-04 16:28:06,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:06,510 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:28:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:28:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:06,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:07,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:07,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:07,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:07,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:07,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:28:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:07,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:07,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:07,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:28:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 48 proven. 97 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-09-04 16:28:07,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [90979457] [2020-09-04 16:28:07,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:07,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:28:07,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127318126] [2020-09-04 16:28:07,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:28:07,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:07,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:28:07,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:28:07,154 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 13 states. [2020-09-04 16:28:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:07,623 INFO L93 Difference]: Finished difference Result 149 states and 204 transitions. [2020-09-04 16:28:07,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 16:28:07,623 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 193 [2020-09-04 16:28:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:07,626 INFO L225 Difference]: With dead ends: 149 [2020-09-04 16:28:07,626 INFO L226 Difference]: Without dead ends: 92 [2020-09-04 16:28:07,627 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:28:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-09-04 16:28:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2020-09-04 16:28:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-09-04 16:28:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2020-09-04 16:28:07,643 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 193 [2020-09-04 16:28:07,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:07,643 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2020-09-04 16:28:07,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:28:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2020-09-04 16:28:07,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-04 16:28:07,645 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:07,645 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:07,646 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:28:07,646 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:07,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1618484333, now seen corresponding path program 6 times [2020-09-04 16:28:07,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:07,647 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1194545198] [2020-09-04 16:28:07,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:07,649 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:07,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:07,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:07,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:07,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:07,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:28:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:28:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2020-09-04 16:28:08,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1194545198] [2020-09-04 16:28:08,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:08,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:28:08,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892362192] [2020-09-04 16:28:08,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:28:08,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:08,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:28:08,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:28:08,211 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand 16 states. [2020-09-04 16:28:08,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:08,724 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2020-09-04 16:28:08,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 16:28:08,725 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 140 [2020-09-04 16:28:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:08,727 INFO L225 Difference]: With dead ends: 103 [2020-09-04 16:28:08,727 INFO L226 Difference]: Without dead ends: 97 [2020-09-04 16:28:08,728 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2020-09-04 16:28:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-09-04 16:28:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2020-09-04 16:28:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-09-04 16:28:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2020-09-04 16:28:08,745 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 140 [2020-09-04 16:28:08,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:08,746 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2020-09-04 16:28:08,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:28:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2020-09-04 16:28:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-09-04 16:28:08,749 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:08,749 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:08,749 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:28:08,749 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:08,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:08,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1853518064, now seen corresponding path program 7 times [2020-09-04 16:28:08,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:08,750 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1228672308] [2020-09-04 16:28:08,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:08,752 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:08,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:28:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:28:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-09-04 16:28:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,197 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2020-09-04 16:28:09,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1228672308] [2020-09-04 16:28:09,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:09,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:28:09,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459663762] [2020-09-04 16:28:09,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:28:09,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:09,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:28:09,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:28:09,202 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand 10 states. [2020-09-04 16:28:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:09,400 INFO L93 Difference]: Finished difference Result 171 states and 210 transitions. [2020-09-04 16:28:09,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 16:28:09,403 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 175 [2020-09-04 16:28:09,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:09,405 INFO L225 Difference]: With dead ends: 171 [2020-09-04 16:28:09,405 INFO L226 Difference]: Without dead ends: 88 [2020-09-04 16:28:09,406 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:28:09,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-09-04 16:28:09,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2020-09-04 16:28:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-09-04 16:28:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2020-09-04 16:28:09,435 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 175 [2020-09-04 16:28:09,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:09,437 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2020-09-04 16:28:09,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:28:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2020-09-04 16:28:09,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2020-09-04 16:28:09,444 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:09,444 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 10, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:09,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:28:09,445 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:09,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:09,445 INFO L82 PathProgramCache]: Analyzing trace with hash 2080077336, now seen corresponding path program 8 times [2020-09-04 16:28:09,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:09,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1258957517] [2020-09-04 16:28:09,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:09,448 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:28:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:28:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:09,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 16:28:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:10,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:10,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:10,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:10,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:10,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:10,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:10,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:28:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:10,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:10,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:10,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:28:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:10,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:10,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:10,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:10,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 30 proven. 152 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2020-09-04 16:28:10,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1258957517] [2020-09-04 16:28:10,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:10,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:28:10,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112290663] [2020-09-04 16:28:10,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:28:10,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:10,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:28:10,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:28:10,345 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 15 states. [2020-09-04 16:28:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:10,882 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2020-09-04 16:28:10,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 16:28:10,883 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 281 [2020-09-04 16:28:10,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:10,885 INFO L225 Difference]: With dead ends: 139 [2020-09-04 16:28:10,885 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:28:10,888 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2020-09-04 16:28:10,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:28:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:28:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:28:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:28:10,889 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2020-09-04 16:28:10,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:10,889 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:28:10,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:28:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:28:10,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:28:10,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:28:10,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:28:12,467 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2020-09-04 16:28:12,775 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2020-09-04 16:28:13,030 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-09-04 16:28:13,538 WARN L193 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2020-09-04 16:28:13,935 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2020-09-04 16:28:14,260 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2020-09-04 16:28:14,477 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2020-09-04 16:28:14,765 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2020-09-04 16:28:14,826 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:28:14,826 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:28:14,826 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:28:14,826 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:28:14,827 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:28:14,827 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:28:14,827 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 27) the Hoare annotation is: false [2020-09-04 16:28:14,827 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 23 30) the Hoare annotation is: true [2020-09-04 16:28:14,827 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: false [2020-09-04 16:28:14,828 INFO L264 CegarLoopResult]: At program point L26(lines 26 28) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-09-04 16:28:14,828 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0)) [2020-09-04 16:28:14,828 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 23 30) the Hoare annotation is: (<= 5 main_~x~0) [2020-09-04 16:28:14,828 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (and (<= |main_#t~ret2| 5) (<= main_~x~0 5) (<= 5 |main_#t~ret2|) (<= 5 main_~x~0)) [2020-09-04 16:28:14,828 INFO L264 CegarLoopResult]: At program point L26-2(lines 26 28) the Hoare annotation is: (<= 5 main_~x~0) [2020-09-04 16:28:14,829 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (and (<= |main_#t~ret2| 5) (<= main_~x~0 5) (<= 5 |main_#t~ret2|) (<= 5 main_~x~0)) [2020-09-04 16:28:14,829 INFO L264 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (and (<= |main_#t~ret2| 5) (<= main_~x~0 5) (<= 5 |main_#t~ret2|) (<= 5 main_~x~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-09-04 16:28:14,829 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 23 30) the Hoare annotation is: (<= 5 main_~x~0) [2020-09-04 16:28:14,829 INFO L264 CegarLoopResult]: At program point fiboEXIT(lines 5 13) the Hoare annotation is: (let ((.cse0 (<= |fibo_#in~n| 3))) (and (or (not (<= |fibo_#in~n| 4)) (and (<= |fibo_#res| 3) (<= 3 |fibo_#res|)) .cse0) (let ((.cse1 (= fibo_~n |fibo_#in~n|))) (or (not (<= |fibo_#in~n| 5)) (and (<= 5 |fibo_#res|) .cse1 (<= |fibo_#res| 5)) (and (<= fibo_~n 4) .cse1))) (or (and (<= 0 |fibo_#res|) (<= |fibo_#res| 0)) (<= 1 |fibo_#in~n|)) (or (<= |fibo_#in~n| 0) (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2) (<= 3 |fibo_#in~n|)) (and (<= 1 |fibo_#res|) (<= |fibo_#res| 1) (<= |fibo_#in~n| 2)) (not .cse0)))) [2020-09-04 16:28:14,830 INFO L264 CegarLoopResult]: At program point fiboFINAL(lines 5 13) the Hoare annotation is: (let ((.cse0 (<= |fibo_#in~n| 3))) (and (or (not (<= |fibo_#in~n| 4)) (and (<= |fibo_#res| 3) (<= 3 |fibo_#res|)) .cse0) (let ((.cse1 (= fibo_~n |fibo_#in~n|))) (or (not (<= |fibo_#in~n| 5)) (and (<= 5 |fibo_#res|) .cse1 (<= |fibo_#res| 5)) (and (<= fibo_~n 4) .cse1))) (or (and (<= 0 |fibo_#res|) (<= |fibo_#res| 0)) (<= 1 |fibo_#in~n|)) (or (<= |fibo_#in~n| 0) (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2) (<= 3 |fibo_#in~n|)) (and (<= 1 |fibo_#res|) (<= |fibo_#res| 1) (<= |fibo_#in~n| 2)) (not .cse0)))) [2020-09-04 16:28:14,830 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (or (not (<= |fibo_#in~n| 5)) (= fibo_~n |fibo_#in~n|)) (not (<= |fibo_#in~n| 1))) [2020-09-04 16:28:14,830 INFO L264 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (let ((.cse0 (<= |fibo_#in~n| 3))) (and (or (and (<= 1 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 1)) (not .cse0)) (let ((.cse1 (= fibo_~n |fibo_#in~n|))) (or (not (<= |fibo_#in~n| 5)) (and (<= fibo_~n 4) .cse1) (and (<= 3 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 3) .cse1))) (not (<= |fibo_#in~n| 1)) (or (and (<= 2 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 2)) (not (<= |fibo_#in~n| 4)) .cse0))) [2020-09-04 16:28:14,830 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (let ((.cse0 (<= |fibo_#in~n| 1))) (and (or (not (<= |fibo_#in~n| 5)) .cse0) (or (and (= fibo_~n |fibo_#in~n|) (<= 1 |fibo_#in~n|)) (not .cse0)))) [2020-09-04 16:28:14,831 INFO L264 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (let ((.cse0 (<= |fibo_#in~n| 3))) (and (or (and (<= 1 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 1)) (not .cse0)) (let ((.cse1 (= fibo_~n |fibo_#in~n|))) (or (not (<= |fibo_#in~n| 5)) (and (<= fibo_~n 4) .cse1) (and (<= 3 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 3) .cse1))) (not (<= |fibo_#in~n| 1)) (or (and (<= 2 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 2)) (not (<= |fibo_#in~n| 4)) .cse0))) [2020-09-04 16:28:14,831 INFO L264 CegarLoopResult]: At program point L8(lines 8 12) the Hoare annotation is: (and (or (not (<= |fibo_#in~n| 5)) (= fibo_~n |fibo_#in~n|)) (<= 1 |fibo_#in~n|)) [2020-09-04 16:28:14,831 INFO L264 CegarLoopResult]: At program point L11-3(line 11) the Hoare annotation is: (let ((.cse4 (<= 1 |fibo_#t~ret0|)) (.cse2 (+ |fibo_#t~ret0| |fibo_#t~ret1|)) (.cse5 (<= |fibo_#t~ret0| 1)) (.cse1 (<= |fibo_#in~n| 2))) (let ((.cse0 (and .cse4 (<= 1 .cse2) (<= .cse2 1) .cse5 .cse1)) (.cse3 (<= |fibo_#in~n| 3))) (and (or .cse0 (not .cse1)) (or (not (<= |fibo_#in~n| 4)) (and (<= .cse2 3) (<= 2 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 2) (<= 3 .cse2)) .cse3) (or .cse0 (not .cse3) (and (<= 2 .cse2) .cse4 (<= .cse2 2) .cse5)) (let ((.cse6 (= fibo_~n |fibo_#in~n|))) (or (not (<= |fibo_#in~n| 5)) (and (<= 3 |fibo_#t~ret0|) (<= .cse2 5) (<= |fibo_#t~ret0| 3) (<= 5 .cse2) .cse6) (and (<= fibo_~n 4) .cse6))) (not (<= |fibo_#in~n| 1))))) [2020-09-04 16:28:14,831 INFO L264 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (or (not (<= |fibo_#in~n| 2)) (and (<= |fibo_#in~n| 0) (= fibo_~n |fibo_#in~n|))) (or (not (<= |fibo_#in~n| 5)) (not (<= 3 |fibo_#in~n|)))) [2020-09-04 16:28:14,832 INFO L264 CegarLoopResult]: At program point L11-4(line 11) the Hoare annotation is: (let ((.cse4 (<= 1 |fibo_#t~ret0|)) (.cse2 (+ |fibo_#t~ret0| |fibo_#t~ret1|)) (.cse5 (<= |fibo_#t~ret0| 1)) (.cse1 (<= |fibo_#in~n| 2))) (let ((.cse0 (and .cse4 (<= 1 .cse2) (<= .cse2 1) .cse5 .cse1)) (.cse3 (<= |fibo_#in~n| 3))) (and (or .cse0 (not .cse1)) (or (not (<= |fibo_#in~n| 4)) (and (<= .cse2 3) (<= 2 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 2) (<= 3 .cse2)) .cse3) (or .cse0 (not .cse3) (and (<= 2 .cse2) .cse4 (<= .cse2 2) .cse5)) (let ((.cse6 (= fibo_~n |fibo_#in~n|))) (or (not (<= |fibo_#in~n| 5)) (and (<= 3 |fibo_#t~ret0|) (<= .cse2 5) (<= |fibo_#t~ret0| 3) (<= 5 .cse2) .cse6) (and (<= fibo_~n 4) .cse6))) (not (<= |fibo_#in~n| 1))))) [2020-09-04 16:28:14,832 INFO L264 CegarLoopResult]: At program point L6(lines 6 12) the Hoare annotation is: (or (not (<= |fibo_#in~n| 5)) (= fibo_~n |fibo_#in~n|)) [2020-09-04 16:28:14,832 INFO L264 CegarLoopResult]: At program point L11-5(line 11) the Hoare annotation is: (let ((.cse1 (<= |fibo_#in~n| 3)) (.cse0 (+ |fibo_#t~ret0| |fibo_#t~ret1|))) (and (or (not (<= |fibo_#in~n| 4)) (and (<= .cse0 3) (<= 2 |fibo_#t~ret0|) (<= |fibo_#res| 3) (<= |fibo_#t~ret0| 2) (<= 3 .cse0) (<= 3 |fibo_#res|)) .cse1) (let ((.cse2 (<= 1 |fibo_#t~ret0|)) (.cse3 (<= |fibo_#t~ret0| 1))) (or (and (<= 1 |fibo_#res|) .cse2 (<= 1 .cse0) (<= .cse0 1) .cse3 (<= |fibo_#res| 1) (<= |fibo_#in~n| 2)) (and (<= 2 .cse0) .cse2 (<= 2 |fibo_#res|) (<= .cse0 2) .cse3 (<= |fibo_#res| 2) (<= 3 |fibo_#in~n|)) (not .cse1))) (let ((.cse4 (= fibo_~n |fibo_#in~n|))) (or (not (<= |fibo_#in~n| 5)) (and (<= 3 |fibo_#t~ret0|) (<= 5 |fibo_#res|) (<= .cse0 5) (<= |fibo_#t~ret0| 3) (<= 5 .cse0) .cse4 (<= |fibo_#res| 5)) (and (<= fibo_~n 4) .cse4))) (not (<= |fibo_#in~n| 1)))) [2020-09-04 16:28:14,832 INFO L271 CegarLoopResult]: At program point fiboENTRY(lines 5 13) the Hoare annotation is: true [2020-09-04 16:28:14,833 INFO L264 CegarLoopResult]: At program point L11-6(line 11) the Hoare annotation is: (let ((.cse3 (<= 1 |fibo_#t~ret0|)) (.cse4 (<= |fibo_#t~ret0| 1)) (.cse5 (<= |fibo_#in~n| 2))) (let ((.cse0 (<= |fibo_#in~n| 3)) (.cse2 (and (<= 1 |fibo_#res|) .cse3 (<= 2 |fibo_#in~n|) .cse4 (<= |fibo_#res| 1) .cse5))) (and (or (not (<= |fibo_#in~n| 4)) (and (<= 2 |fibo_#t~ret0|) (<= |fibo_#res| 3) (<= |fibo_#t~ret0| 2) (<= 3 |fibo_#res|)) .cse0) (let ((.cse1 (= fibo_~n |fibo_#in~n|))) (or (not (<= |fibo_#in~n| 5)) (and (<= fibo_~n 4) .cse1) (and (<= 3 |fibo_#t~ret0|) (<= 5 |fibo_#res|) (<= |fibo_#t~ret0| 3) .cse1 (<= |fibo_#res| 5)))) (or .cse2 (not .cse0) (and .cse3 (<= 2 |fibo_#res|) .cse4 (<= |fibo_#res| 2))) (or (not .cse5) .cse2)))) [2020-09-04 16:28:14,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:28:14 BoogieIcfgContainer [2020-09-04 16:28:14,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:28:14,859 INFO L168 Benchmark]: Toolchain (without parser) took 12256.86 ms. Allocated memory was 138.4 MB in the beginning and 405.8 MB in the end (delta: 267.4 MB). Free memory was 103.1 MB in the beginning and 181.5 MB in the end (delta: -78.4 MB). Peak memory consumption was 244.2 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:14,860 INFO L168 Benchmark]: CDTParser took 0.96 ms. Allocated memory is still 138.4 MB. Free memory was 121.0 MB in the beginning and 120.5 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-09-04 16:28:14,860 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.42 ms. Allocated memory is still 138.4 MB. Free memory was 102.7 MB in the beginning and 93.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:14,861 INFO L168 Benchmark]: Boogie Preprocessor took 31.26 ms. Allocated memory is still 138.4 MB. Free memory was 93.5 MB in the beginning and 91.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:14,862 INFO L168 Benchmark]: RCFGBuilder took 400.10 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 91.8 MB in the beginning and 168.8 MB in the end (delta: -77.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:14,863 INFO L168 Benchmark]: TraceAbstraction took 11506.42 ms. Allocated memory was 202.4 MB in the beginning and 405.8 MB in the end (delta: 203.4 MB). Free memory was 168.8 MB in the beginning and 181.5 MB in the end (delta: -12.7 MB). Peak memory consumption was 245.9 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:14,867 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.96 ms. Allocated memory is still 138.4 MB. Free memory was 121.0 MB in the beginning and 120.5 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 311.42 ms. Allocated memory is still 138.4 MB. Free memory was 102.7 MB in the beginning and 93.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.26 ms. Allocated memory is still 138.4 MB. Free memory was 93.5 MB in the beginning and 91.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 400.10 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 91.8 MB in the beginning and 168.8 MB in the end (delta: -77.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11506.42 ms. Allocated memory was 202.4 MB in the beginning and 405.8 MB in the end (delta: 203.4 MB). Free memory was 168.8 MB in the beginning and 181.5 MB in the end (delta: -12.7 MB). Peak memory consumption was 245.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: 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: 23]: Procedure Contract for main Derived contract for procedure main: 5 <= x - ProcedureContractResult [Line: 5]: Procedure Contract for fibo Derived contract for procedure fibo: ((((!(\old(n) <= 4) || (\result <= 3 && 3 <= \result)) || \old(n) <= 3) && ((!(\old(n) <= 5) || ((5 <= \result && n == \old(n)) && \result <= 5)) || (n <= 4 && n == \old(n)))) && ((0 <= \result && \result <= 0) || 1 <= \old(n))) && (((\old(n) <= 0 || ((2 <= \result && \result <= 2) && 3 <= \old(n))) || ((1 <= \result && \result <= 1) && \old(n) <= 2)) || !(\old(n) <= 3)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.4s, OverallIterations: 11, TraceHistogramMax: 31, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 348 SDtfs, 527 SDslu, 1454 SDs, 0 SdLazy, 1310 SolverSat, 214 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 463 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=9, 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, 11 MinimizatonAttempts, 43 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 703 PreInvPairs, 1073 NumberOfFragments, 922 HoareAnnotationTreeSize, 703 FomulaSimplifications, 5774 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 31 FomulaSimplificationsInter, 2622 FormulaSimplificationTreeSizeReductionInter, 2.6s 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...