java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/loopAcceleration/loopAccelerationAbstractPathConditions.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:20:51,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:20:51,760 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:20:51,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:20:51,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:20:51,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:20:51,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:20:51,776 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:20:51,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:20:51,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:20:51,779 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:20:51,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:20:51,780 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:20:51,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:20:51,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:20:51,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:20:51,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:20:51,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:20:51,787 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:20:51,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:20:51,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:20:51,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:20:51,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:20:51,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:20:51,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:20:51,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:20:51,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:20:51,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:20:51,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:20:51,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:20:51,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:20:51,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:20:51,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:20:51,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:20:51,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:20:51,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:20:51,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:20:51,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:20:51,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:20:51,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:20:51,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:20:51,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:20:51,847 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:20:51,851 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:20:51,852 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:20:51,853 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:20:51,853 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationAbstractPathConditions.bpl [2019-08-05 11:20:51,854 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationAbstractPathConditions.bpl' [2019-08-05 11:20:51,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:20:51,889 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:20:51,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:20:51,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:20:51,890 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:20:51,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loopAccelerationAbstractPathConditions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:51" (1/1) ... [2019-08-05 11:20:51,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loopAccelerationAbstractPathConditions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:51" (1/1) ... [2019-08-05 11:20:51,924 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:20:51,924 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:20:51,924 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:20:51,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:20:51,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:20:51,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:20:51,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:20:51,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loopAccelerationAbstractPathConditions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:51" (1/1) ... [2019-08-05 11:20:51,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loopAccelerationAbstractPathConditions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:51" (1/1) ... [2019-08-05 11:20:51,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loopAccelerationAbstractPathConditions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:51" (1/1) ... [2019-08-05 11:20:51,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loopAccelerationAbstractPathConditions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:51" (1/1) ... [2019-08-05 11:20:51,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loopAccelerationAbstractPathConditions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:51" (1/1) ... [2019-08-05 11:20:51,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loopAccelerationAbstractPathConditions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:51" (1/1) ... [2019-08-05 11:20:51,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loopAccelerationAbstractPathConditions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:51" (1/1) ... [2019-08-05 11:20:51,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:20:51,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:20:51,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:20:51,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:20:51,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loopAccelerationAbstractPathConditions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:20:52,015 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:20:52,015 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:20:52,015 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:20:52,392 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:20:52,393 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:20:52,394 INFO L202 PluginConnector]: Adding new model loopAccelerationAbstractPathConditions.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:20:52 BoogieIcfgContainer [2019-08-05 11:20:52,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:20:52,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:20:52,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:20:52,405 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:20:52,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loopAccelerationAbstractPathConditions.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:51" (1/2) ... [2019-08-05 11:20:52,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ed9e97 and model type loopAccelerationAbstractPathConditions.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:20:52, skipping insertion in model container [2019-08-05 11:20:52,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loopAccelerationAbstractPathConditions.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:20:52" (2/2) ... [2019-08-05 11:20:52,409 INFO L109 eAbstractionObserver]: Analyzing ICFG loopAccelerationAbstractPathConditions.bpl [2019-08-05 11:20:52,433 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:20:52,450 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:20:52,476 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:20:52,509 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:20:52,509 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:20:52,510 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:20:52,510 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:20:52,510 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:20:52,510 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:20:52,511 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:20:52,511 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:20:52,511 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:20:52,525 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 11:20:52,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:20:52,533 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:52,535 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:20:52,537 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:52,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:52,543 INFO L82 PathProgramCache]: Analyzing trace with hash 936527, now seen corresponding path program 1 times [2019-08-05 11:20:52,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:52,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:20:52,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:52,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:20:52,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:20:52,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:20:52,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:20:52,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:20:52,718 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-08-05 11:20:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:52,753 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:20:52,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:20:52,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:20:52,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:52,767 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:20:52,767 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:20:52,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:20:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:20:52,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:20:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:20:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:20:52,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 11:20:52,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:52,804 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:20:52,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:20:52,805 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:20:52,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:20:52,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:52,805 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:20:52,806 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:52,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:52,806 INFO L82 PathProgramCache]: Analyzing trace with hash 29386932, now seen corresponding path program 1 times [2019-08-05 11:20:52,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:52,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:20:52,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:52,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:20:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:52,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:52,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:20:52,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:20:52,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:20:52,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:20:52,898 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 4 states. [2019-08-05 11:20:52,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:52,922 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:20:52,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:20:52,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:20:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:52,923 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:20:52,923 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:20:52,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:20:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:20:52,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:20:52,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:20:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:20:52,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 11:20:52,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:52,928 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:20:52,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:20:52,928 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:20:52,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:20:52,929 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:52,929 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 11:20:52,929 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:52,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:52,930 INFO L82 PathProgramCache]: Analyzing trace with hash 911349487, now seen corresponding path program 2 times [2019-08-05 11:20:52,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:52,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:20:52,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:53,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:53,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:53,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:20:53,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:20:53,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:20:53,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:20:53,063 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 11:20:53,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:53,092 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:20:53,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:20:53,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:20:53,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:53,095 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:20:53,095 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:20:53,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:20:53,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:20:53,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:20:53,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:20:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:20:53,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 11:20:53,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:53,099 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:20:53,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:20:53,099 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:20:53,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:20:53,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:53,100 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2019-08-05 11:20:53,100 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:53,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:53,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1812582380, now seen corresponding path program 3 times [2019-08-05 11:20:53,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:53,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:20:53,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:53,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:53,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:20:53,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:20:53,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:20:53,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:20:53,272 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-08-05 11:20:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:53,322 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:20:53,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:20:53,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 11:20:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:53,324 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:20:53,324 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:20:53,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:20:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:20:53,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:20:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:20:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:20:53,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 11:20:53,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:53,328 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:20:53,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:20:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:20:53,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:20:53,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:53,329 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2019-08-05 11:20:53,330 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:53,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:53,331 INFO L82 PathProgramCache]: Analyzing trace with hash -355124337, now seen corresponding path program 4 times [2019-08-05 11:20:53,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:53,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:20:53,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:53,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:53,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:20:53,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:20:53,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:20:53,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:20:53,822 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-08-05 11:20:53,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:53,866 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:20:53,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:20:53,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 11:20:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:53,870 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:20:53,870 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:20:53,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:20:53,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:20:53,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:20:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:20:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:20:53,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 11:20:53,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:53,874 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:20:53,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:20:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:20:53,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:20:53,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:53,876 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2019-08-05 11:20:53,876 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:53,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:53,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1876402036, now seen corresponding path program 5 times [2019-08-05 11:20:53,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:53,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:20:53,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:54,176 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:54,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:54,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:20:54,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:20:54,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:20:54,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:20:54,178 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-08-05 11:20:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:54,217 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:20:54,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:20:54,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-08-05 11:20:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:54,224 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:20:54,224 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:20:54,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:20:54,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:20:54,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:20:54,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:20:54,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:20:54,227 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 11:20:54,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:54,228 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:20:54,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:20:54,228 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:20:54,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:20:54,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:54,229 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2019-08-05 11:20:54,229 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:54,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:54,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1960724433, now seen corresponding path program 6 times [2019-08-05 11:20:54,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:54,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:20:54,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:54,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:54,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:20:54,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:20:54,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:20:54,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:20:54,437 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2019-08-05 11:20:54,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:54,467 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:20:54,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:20:54,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-08-05 11:20:54,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:54,469 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:20:54,469 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:20:54,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:20:54,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:20:54,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:20:54,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:20:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:20:54,473 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 11:20:54,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:54,473 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:20:54,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:20:54,473 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:20:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:20:54,474 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:54,474 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2019-08-05 11:20:54,474 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:54,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:54,475 INFO L82 PathProgramCache]: Analyzing trace with hash -652560684, now seen corresponding path program 7 times [2019-08-05 11:20:54,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:54,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:20:54,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:54,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:54,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:20:54,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:20:54,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:20:54,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:20:54,784 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2019-08-05 11:20:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:54,856 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:20:54,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:20:54,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-08-05 11:20:54,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:54,857 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:20:54,857 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:20:54,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:20:54,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:20:54,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:20:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:20:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:20:54,860 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 11:20:54,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:54,861 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:20:54,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:20:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:20:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:20:54,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:54,861 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2019-08-05 11:20:54,862 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:54,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:54,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1245809871, now seen corresponding path program 8 times [2019-08-05 11:20:54,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:54,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:20:54,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:55,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:55,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:20:55,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:20:55,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:20:55,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:20:55,343 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2019-08-05 11:20:55,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:55,404 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:20:55,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:20:55,404 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-08-05 11:20:55,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:55,405 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:20:55,405 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:20:55,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:20:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:20:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:20:55,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:20:55,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:20:55,409 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 11:20:55,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:55,409 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:20:55,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:20:55,409 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:20:55,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:20:55,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:55,410 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1] [2019-08-05 11:20:55,411 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:55,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:55,411 INFO L82 PathProgramCache]: Analyzing trace with hash -34245068, now seen corresponding path program 9 times [2019-08-05 11:20:55,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:55,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:20:55,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:55,610 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:55,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:55,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:20:55,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:20:55,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:20:55,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:20:55,612 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2019-08-05 11:20:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:55,656 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:20:55,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:20:55,656 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-08-05 11:20:55,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:55,657 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:20:55,658 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:20:55,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:20:55,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:20:55,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:20:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:20:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:20:55,661 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 11:20:55,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:55,662 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:20:55,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:20:55,662 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:20:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:20:55,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:55,663 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2019-08-05 11:20:55,663 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:55,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:55,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1061242513, now seen corresponding path program 10 times [2019-08-05 11:20:55,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:55,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:20:55,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:55,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:55,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:20:55,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:20:55,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:20:55,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:20:55,946 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2019-08-05 11:20:55,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:55,985 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:20:55,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:20:55,986 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2019-08-05 11:20:55,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:55,987 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:20:55,987 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:20:55,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:20:55,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:20:55,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:20:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:20:55,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:20:55,991 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 11:20:55,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:55,991 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:20:55,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:20:55,991 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:20:55,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:20:55,992 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:55,992 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1] [2019-08-05 11:20:55,992 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:55,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:55,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1461575060, now seen corresponding path program 11 times [2019-08-05 11:20:55,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:56,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:20:56,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:56,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:56,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:20:56,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:20:56,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:20:56,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:20:56,225 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2019-08-05 11:20:56,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:56,268 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:20:56,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:20:56,269 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-08-05 11:20:56,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:56,270 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:20:56,270 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:20:56,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:20:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:20:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:20:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:20:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:20:56,274 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 11:20:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:56,274 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:20:56,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:20:56,274 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:20:56,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:20:56,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:56,275 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1] [2019-08-05 11:20:56,276 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:56,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:56,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1935458801, now seen corresponding path program 12 times [2019-08-05 11:20:56,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:56,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:20:56,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:56,712 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:56,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:56,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:20:56,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:20:56,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:20:56,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:20:56,714 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2019-08-05 11:20:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:56,774 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:20:56,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:20:56,774 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-08-05 11:20:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:56,775 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:20:56,775 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:20:56,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:20:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:20:56,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:20:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:20:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:20:56,778 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 11:20:56,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:56,778 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:20:56,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:20:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:20:56,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:20:56,779 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:56,779 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1] [2019-08-05 11:20:56,779 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:56,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:56,780 INFO L82 PathProgramCache]: Analyzing trace with hash 130673908, now seen corresponding path program 13 times [2019-08-05 11:20:56,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:56,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:20:56,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:57,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:57,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:20:57,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:20:57,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:20:57,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:20:57,394 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2019-08-05 11:20:57,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:57,423 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:20:57,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:20:57,430 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-08-05 11:20:57,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:57,431 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:20:57,431 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:20:57,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:20:57,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:20:57,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:20:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:20:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:20:57,434 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 11:20:57,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:57,434 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:20:57,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:20:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:20:57,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:20:57,435 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:57,435 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1] [2019-08-05 11:20:57,436 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:57,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:57,436 INFO L82 PathProgramCache]: Analyzing trace with hash -243721553, now seen corresponding path program 14 times [2019-08-05 11:20:57,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:57,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:20:57,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:57,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:57,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:20:57,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:20:57,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:20:57,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:20:57,700 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2019-08-05 11:20:57,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:57,859 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:20:57,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:20:57,860 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2019-08-05 11:20:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:57,861 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:20:57,861 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:20:57,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:20:57,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:20:57,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:20:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:20:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:20:57,870 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 11:20:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:57,871 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:20:57,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:20:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:20:57,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:20:57,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:57,872 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1] [2019-08-05 11:20:57,872 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:57,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:57,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1034921044, now seen corresponding path program 15 times [2019-08-05 11:20:57,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:57,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:20:57,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:58,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:58,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:20:58,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:20:58,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:20:58,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:20:58,212 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 18 states. [2019-08-05 11:20:58,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:58,241 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:20:58,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:20:58,242 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-08-05 11:20:58,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:58,243 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:20:58,243 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:20:58,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:20:58,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:20:58,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:20:58,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:20:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:20:58,247 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 11:20:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:58,247 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:20:58,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:20:58,248 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:20:58,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:20:58,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:58,248 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1] [2019-08-05 11:20:58,249 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:58,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:58,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2018135887, now seen corresponding path program 16 times [2019-08-05 11:20:58,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:58,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:20:58,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:58,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:58,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:20:58,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:20:58,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:20:58,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:20:58,840 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 19 states. [2019-08-05 11:20:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:58,873 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:20:58,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:20:58,874 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2019-08-05 11:20:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:58,874 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:20:58,875 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:20:58,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:20:58,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:20:58,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:20:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:20:58,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:20:58,878 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 11:20:58,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:58,878 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:20:58,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:20:58,878 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:20:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:20:58,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:58,879 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1] [2019-08-05 11:20:58,880 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:58,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:58,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1861942348, now seen corresponding path program 17 times [2019-08-05 11:20:58,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:20:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:20:59,814 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:20:59,839 INFO L202 PluginConnector]: Adding new model loopAccelerationAbstractPathConditions.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:20:59 BoogieIcfgContainer [2019-08-05 11:20:59,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:20:59,841 INFO L168 Benchmark]: Toolchain (without parser) took 7951.82 ms. Allocated memory was 140.5 MB in the beginning and 240.6 MB in the end (delta: 100.1 MB). Free memory was 110.2 MB in the beginning and 105.6 MB in the end (delta: 4.6 MB). Peak memory consumption was 104.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:20:59,842 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 11:20:59,843 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.48 ms. Allocated memory is still 140.5 MB. Free memory was 110.2 MB in the beginning and 108.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:20:59,844 INFO L168 Benchmark]: Boogie Preprocessor took 22.24 ms. Allocated memory is still 140.5 MB. Free memory was 108.2 MB in the beginning and 107.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:20:59,845 INFO L168 Benchmark]: RCFGBuilder took 444.76 ms. Allocated memory is still 140.5 MB. Free memory was 106.9 MB in the beginning and 96.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:20:59,846 INFO L168 Benchmark]: TraceAbstraction took 7442.54 ms. Allocated memory was 140.5 MB in the beginning and 240.6 MB in the end (delta: 100.1 MB). Free memory was 95.8 MB in the beginning and 105.6 MB in the end (delta: -9.8 MB). Peak memory consumption was 90.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:20:59,850 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.48 ms. Allocated memory is still 140.5 MB. Free memory was 110.2 MB in the beginning and 108.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.24 ms. Allocated memory is still 140.5 MB. Free memory was 108.2 MB in the beginning and 107.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 444.76 ms. Allocated memory is still 140.5 MB. Free memory was 106.9 MB in the beginning and 96.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7442.54 ms. Allocated memory was 140.5 MB in the beginning and 240.6 MB in the end (delta: 100.1 MB). Free memory was 95.8 MB in the beginning and 105.6 MB in the end (delta: -9.8 MB). Peak memory consumption was 90.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: assertion can be violated assertion can be violated We found a FailurePath: [L17] k := 0; [L18] i := 3; [L19] n := 20; VAL [i=3, k=0, n=20] [L20] COND TRUE i < n [L21] COND TRUE a[i] == 1 [L22] k := k + 1; [L24] i := i + 1; VAL [i=4, k=1, n=20] [L20] COND TRUE i < n [L21] COND FALSE !(a[i] == 1) [L24] i := i + 1; VAL [i=5, k=1, n=20] [L20] COND TRUE i < n [L21] COND TRUE a[i] == 1 [L22] k := k + 1; [L24] i := i + 1; VAL [i=6, k=2, n=20] [L20] COND TRUE i < n [L21] COND TRUE a[i] == 1 [L22] k := k + 1; [L24] i := i + 1; VAL [i=7, k=3, n=20] [L20] COND TRUE i < n [L21] COND TRUE a[i] == 1 [L22] k := k + 1; [L24] i := i + 1; VAL [i=8, k=4, n=20] [L20] COND TRUE i < n [L21] COND TRUE a[i] == 1 [L22] k := k + 1; [L24] i := i + 1; VAL [i=9, k=5, n=20] [L20] COND TRUE i < n [L21] COND TRUE a[i] == 1 [L22] k := k + 1; [L24] i := i + 1; VAL [i=10, k=6, n=20] [L20] COND TRUE i < n [L21] COND TRUE a[i] == 1 [L22] k := k + 1; [L24] i := i + 1; VAL [i=11, k=7, n=20] [L20] COND TRUE i < n [L21] COND TRUE a[i] == 1 [L22] k := k + 1; [L24] i := i + 1; VAL [i=12, k=8, n=20] [L20] COND TRUE i < n [L21] COND TRUE a[i] == 1 [L22] k := k + 1; [L24] i := i + 1; VAL [i=13, k=9, n=20] [L20] COND TRUE i < n [L21] COND TRUE a[i] == 1 [L22] k := k + 1; [L24] i := i + 1; VAL [i=14, k=10, n=20] [L20] COND TRUE i < n [L21] COND TRUE a[i] == 1 [L22] k := k + 1; [L24] i := i + 1; VAL [i=15, k=11, n=20] [L20] COND TRUE i < n [L21] COND FALSE !(a[i] == 1) [L24] i := i + 1; VAL [i=16, k=11, n=20] [L20] COND TRUE i < n [L21] COND FALSE !(a[i] == 1) [L24] i := i + 1; VAL [i=17, k=11, n=20] [L20] COND TRUE i < n [L21] COND TRUE a[i] == 1 [L22] k := k + 1; [L24] i := i + 1; VAL [i=18, k=12, n=20] [L20] COND TRUE i < n [L21] COND FALSE !(a[i] == 1) [L24] i := i + 1; VAL [i=19, k=12, n=20] [L20] COND TRUE i < n [L21] COND TRUE a[i] == 1 [L22] k := k + 1; [L24] i := i + 1; VAL [i=20, k=13, n=20] [L20] COND FALSE !(i < n) VAL [i=20, k=13, n=20] [L26] COND TRUE k > 12 VAL [i=20, k=13, n=20] [L27] assert false; VAL [i=20, k=13, n=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. UNSAFE Result, 7.3s OverallTime, 18 OverallIterations, 17 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 70 SDtfs, 0 SDslu, 120 SDs, 0 SdLazy, 229 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 14987 SizeOfPredicates, 34 NumberOfNonLiveVariables, 731 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 0/816 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...