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/toy/110517_Martin01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:43:25,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:43:25,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:43:25,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:43:25,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:43:25,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:43:25,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:43:25,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:43:25,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:43:25,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:43:25,023 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:43:25,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:43:25,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:43:25,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:43:25,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:43:25,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:43:25,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:43:25,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:43:25,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:43:25,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:43:25,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:43:25,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:43:25,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:43:25,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:43:25,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:43:25,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:43:25,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:43:25,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:43:25,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:43:25,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:43:25,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:43:25,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:43:25,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:43:25,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:43:25,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:43:25,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:43:25,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:43:25,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:43:25,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:43:25,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:43:25,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:43:25,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:43:25,090 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:43:25,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:43:25,094 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:43:25,094 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:43:25,095 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/110517_Martin01.bpl [2019-08-05 10:43:25,095 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/110517_Martin01.bpl' [2019-08-05 10:43:25,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:43:25,122 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:43:25,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:43:25,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:43:25,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:43:25,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:25" (1/1) ... [2019-08-05 10:43:25,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:25" (1/1) ... [2019-08-05 10:43:25,153 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:43:25,154 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:43:25,154 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:43:25,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:43:25,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:43:25,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:43:25,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:43:25,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:25" (1/1) ... [2019-08-05 10:43:25,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:25" (1/1) ... [2019-08-05 10:43:25,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:25" (1/1) ... [2019-08-05 10:43:25,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:25" (1/1) ... [2019-08-05 10:43:25,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:25" (1/1) ... [2019-08-05 10:43:25,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:25" (1/1) ... [2019-08-05 10:43:25,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:25" (1/1) ... [2019-08-05 10:43:25,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:43:25,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:43:25,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:43:25,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:43:25,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:25" (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 10:43:25,245 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2019-08-05 10:43:25,245 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-08-05 10:43:25,246 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-08-05 10:43:25,485 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:43:25,485 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:43:25,487 INFO L202 PluginConnector]: Adding new model 110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:43:25 BoogieIcfgContainer [2019-08-05 10:43:25,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:43:25,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:43:25,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:43:25,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:43:25,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:25" (1/2) ... [2019-08-05 10:43:25,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fc02e9 and model type 110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:43:25, skipping insertion in model container [2019-08-05 10:43:25,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:43:25" (2/2) ... [2019-08-05 10:43:25,496 INFO L109 eAbstractionObserver]: Analyzing ICFG 110517_Martin01.bpl [2019-08-05 10:43:25,507 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:43:25,514 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:43:25,531 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:43:25,557 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:43:25,557 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:43:25,558 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:43:25,558 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:43:25,558 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:43:25,558 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:43:25,558 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:43:25,559 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:43:25,559 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:43:25,573 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:43:25,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:43:25,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:25,582 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:43:25,584 INFO L418 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:25,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:25,590 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-08-05 10:43:25,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:25,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:43:25,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:25,727 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 10:43:25,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:43:25,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:43:25,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:43:25,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:43:25,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:43:25,751 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:43:25,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:25,791 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:43:25,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:43:25,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:43:25,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:25,804 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:43:25,804 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:43:25,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:43:25,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:43:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:43:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:43:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:43:25,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:43:25,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:25,839 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:43:25,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:43:25,839 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:43:25,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:43:25,840 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:25,840 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:43:25,841 INFO L418 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:25,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:25,841 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-08-05 10:43:25,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:25,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:43:25,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:25,952 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 10:43:25,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:25,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:43:25,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:43:25,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:43:25,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:43:25,957 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:43:26,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:26,031 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:43:26,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:43:26,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:43:26,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:26,032 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:43:26,032 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:43:26,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 10:43:26,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:43:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:43:26,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:43:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:43:26,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:43:26,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:26,035 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:43:26,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:43:26,036 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:43:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:43:26,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:26,037 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:43:26,037 INFO L418 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:26,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:26,037 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-08-05 10:43:26,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:26,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:43:26,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:26,167 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 10:43:26,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:26,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:43:26,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:43:26,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:43:26,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:43:26,170 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:43:26,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:26,230 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:43:26,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:43:26,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:43:26,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:26,231 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:43:26,232 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:43:26,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 10:43:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:43:26,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:43:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:43:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:43:26,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:43:26,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:26,235 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:43:26,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:43:26,235 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:43:26,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:43:26,236 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:26,236 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:43:26,237 INFO L418 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:26,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:26,237 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-08-05 10:43:26,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:26,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:43:26,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:26,337 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 10:43:26,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:26,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:43:26,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:43:26,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:43:26,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:43:26,339 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:43:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:26,361 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:43:26,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:43:26,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:43:26,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:26,362 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:43:26,363 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:43:26,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:43:26,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:43:26,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:43:26,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:43:26,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:43:26,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:43:26,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:26,366 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:43:26,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:43:26,366 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:43:26,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:43:26,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:26,367 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:43:26,367 INFO L418 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:26,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:26,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-08-05 10:43:26,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:26,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:43:26,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:26,549 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 10:43:26,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:26,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:43:26,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:43:26,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:43:26,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:26,551 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:43:26,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:26,596 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:43:26,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:43:26,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:43:26,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:26,597 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:43:26,597 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:43:26,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:43:26,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:43:26,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:43:26,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:43:26,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:43:26,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:26,601 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:43:26,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:43:26,601 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:43:26,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:43:26,601 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:26,602 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:43:26,602 INFO L418 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:26,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:26,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-08-05 10:43:26,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:26,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:43:26,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:26,825 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 10:43:26,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:26,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:43:26,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:43:26,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:43:26,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:26,827 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:43:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:26,869 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:43:26,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:43:26,870 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:43:26,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:26,870 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:43:26,871 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:43:26,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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 10:43:26,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:43:26,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:43:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:43:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:43:26,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:43:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:26,875 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:43:26,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:43:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:43:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:43:26,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:26,876 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:43:26,876 INFO L418 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:26,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:26,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-08-05 10:43:26,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:26,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:43:26,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:27,124 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 10:43:27,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:27,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:43:27,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:43:27,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:43:27,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:27,126 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:43:27,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:27,148 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:43:27,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:43:27,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:43:27,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:27,150 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:43:27,150 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:43:27,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:27,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:43:27,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:43:27,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:43:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:43:27,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:43:27,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:27,156 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:43:27,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:43:27,156 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:43:27,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:43:27,157 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:27,157 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:43:27,157 INFO L418 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:27,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:27,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-08-05 10:43:27,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:27,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:43:27,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:27,280 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 10:43:27,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:27,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:43:27,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:43:27,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:43:27,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:27,284 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:43:27,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:27,328 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:43:27,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:43:27,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:43:27,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:27,329 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:43:27,329 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:43:27,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:27,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:43:27,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:43:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:43:27,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:43:27,332 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:43:27,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:27,333 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:43:27,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:43:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:43:27,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:43:27,333 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:27,333 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:43:27,334 INFO L418 AbstractCegarLoop]: === Iteration 9 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:27,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:27,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2019-08-05 10:43:27,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:27,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:43:27,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:27,769 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 10:43:27,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:27,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:43:27,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:43:27,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:43:27,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:27,771 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:43:27,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:27,813 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:43:27,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:43:27,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:43:27,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:27,816 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:43:27,816 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:43:27,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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 10:43:27,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:43:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:43:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:43:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:43:27,819 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:43:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:27,820 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:43:27,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:43:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:43:27,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:43:27,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:27,820 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:43:27,821 INFO L418 AbstractCegarLoop]: === Iteration 10 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:27,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:27,821 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2019-08-05 10:43:27,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:27,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:43:27,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:28,009 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 10:43:28,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:28,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:43:28,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:43:28,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:43:28,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:28,011 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:43:28,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:28,072 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:43:28,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:43:28,073 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:43:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:28,073 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:43:28,073 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:43:28,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 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 10:43:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:43:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:43:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:43:28,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:43:28,077 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:43:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:28,077 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:43:28,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:43:28,078 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:43:28,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:43:28,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:28,078 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:43:28,079 INFO L418 AbstractCegarLoop]: === Iteration 11 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:28,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:28,079 INFO L82 PathProgramCache]: Analyzing trace with hash -258347808, now seen corresponding path program 10 times [2019-08-05 10:43:28,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:28,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:43:28,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:28,332 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 10:43:28,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:28,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:43:28,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:43:28,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:43:28,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:28,334 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:43:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:28,354 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:43:28,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:43:28,355 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:43:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:28,356 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:43:28,356 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:43:28,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 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 10:43:28,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:43:28,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:43:28,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:43:28,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:43:28,360 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:43:28,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:28,368 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:43:28,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:43:28,368 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:43:28,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:43:28,368 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:28,368 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:43:28,369 INFO L418 AbstractCegarLoop]: === Iteration 12 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:28,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:28,369 INFO L82 PathProgramCache]: Analyzing trace with hash 581150598, now seen corresponding path program 11 times [2019-08-05 10:43:28,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:28,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:43:28,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:28,588 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 10:43:28,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:28,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:43:28,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:43:28,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:43:28,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:28,590 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:43:28,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:28,672 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:43:28,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:43:28,672 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:43:28,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:28,673 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:43:28,674 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:43:28,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 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 10:43:28,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:43:28,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:43:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:43:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:43:28,678 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:43:28,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:28,678 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:43:28,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:43:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:43:28,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:43:28,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:28,679 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:43:28,679 INFO L418 AbstractCegarLoop]: === Iteration 13 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:28,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:28,681 INFO L82 PathProgramCache]: Analyzing trace with hash 835797408, now seen corresponding path program 12 times [2019-08-05 10:43:28,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:28,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:43:28,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:28,848 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 10:43:28,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:28,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:43:28,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:43:28,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:43:28,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:28,850 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:43:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:28,888 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:43:28,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:43:28,888 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:43:28,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:28,890 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:43:28,890 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:43:28,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:43:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:43:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:43:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:43:28,894 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:43:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:28,894 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:43:28,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:43:28,895 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:43:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:43:28,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:28,895 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:43:28,895 INFO L418 AbstractCegarLoop]: === Iteration 14 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:28,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:28,896 INFO L82 PathProgramCache]: Analyzing trace with hash 139913926, now seen corresponding path program 13 times [2019-08-05 10:43:28,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:28,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:43:28,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:29,142 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 10:43:29,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:29,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:43:29,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:43:29,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:43:29,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:29,143 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:43:29,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:29,167 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:43:29,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:43:29,168 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:43:29,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:29,168 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:43:29,169 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:43:29,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:29,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:43:29,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:43:29,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:43:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:43:29,173 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:43:29,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:29,173 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:43:29,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:43:29,173 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:43:29,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:43:29,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:29,174 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:43:29,174 INFO L418 AbstractCegarLoop]: === Iteration 15 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:29,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:29,174 INFO L82 PathProgramCache]: Analyzing trace with hash 42362464, now seen corresponding path program 14 times [2019-08-05 10:43:29,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:29,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:43:29,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:29,369 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 10:43:29,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:29,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:43:29,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:43:29,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:43:29,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:43:29,371 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:43:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:29,403 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:43:29,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:43:29,404 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:43:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:29,405 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:43:29,405 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:43:29,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:43:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:43:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:43:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:43:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:43:29,409 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:43:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:29,410 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:43:29,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:43:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:43:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:43:29,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:29,411 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:43:29,411 INFO L418 AbstractCegarLoop]: === Iteration 16 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:29,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:29,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234438, now seen corresponding path program 15 times [2019-08-05 10:43:29,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:29,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:43:29,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:29,706 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 10:43:29,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:29,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:43:29,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:43:29,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:43:29,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:43:29,708 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:43:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:29,992 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:43:29,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:43:29,993 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:43:29,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:29,994 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:43:29,994 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:43:29,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 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 10:43:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:43:29,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:43:29,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:43:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:43:29,997 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:43:29,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:29,997 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:43:29,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:43:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:43:29,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:43:29,998 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:29,998 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:43:29,999 INFO L418 AbstractCegarLoop]: === Iteration 17 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:29,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:29,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559968, now seen corresponding path program 16 times [2019-08-05 10:43:30,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:30,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:43:30,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:30,179 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 10:43:30,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:30,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:43:30,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:43:30,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:43:30,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:43:30,181 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:43:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:30,239 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:43:30,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:43:30,241 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:43:30,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:30,241 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:43:30,241 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:43:30,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:43:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:43:30,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:43:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:43:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:43:30,244 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:43:30,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:30,244 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:43:30,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:43:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:43:30,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:43:30,245 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:30,245 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:43:30,245 INFO L418 AbstractCegarLoop]: === Iteration 18 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:30,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:30,245 INFO L82 PathProgramCache]: Analyzing trace with hash -702152378, now seen corresponding path program 17 times [2019-08-05 10:43:30,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:30,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:43:30,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:30,778 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:30,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:30,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:43:30,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:43:30,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:43:30,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:43:30,780 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:43:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:30,828 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:43:30,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:43:30,835 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:43:30,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:30,836 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:43:30,836 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:43:30,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:43:30,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:43:30,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:43:30,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:43:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:43:30,842 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:43:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:30,842 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:43:30,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:43:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:43:30,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:43:30,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:30,843 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:43:30,843 INFO L418 AbstractCegarLoop]: === Iteration 19 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:30,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:30,844 INFO L82 PathProgramCache]: Analyzing trace with hash -291889184, now seen corresponding path program 18 times [2019-08-05 10:43:30,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:30,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:43:30,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:31,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:31,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:43:31,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:43:31,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:43:31,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:43:31,599 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:43:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:31,677 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:43:31,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:43:31,687 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:43:31,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:31,688 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:43:31,688 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:43:31,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:43:31,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:43:31,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:43:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:43:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:43:31,698 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:43:31,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:31,698 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:43:31,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:43:31,698 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:43:31,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:43:31,699 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:31,699 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:43:31,699 INFO L418 AbstractCegarLoop]: === Iteration 20 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:31,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:31,700 INFO L82 PathProgramCache]: Analyzing trace with hash -458632058, now seen corresponding path program 19 times [2019-08-05 10:43:31,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:31,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:43:31,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:32,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:32,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:43:32,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:43:32,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:43:32,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:43:32,061 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:43:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:32,095 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:43:32,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:43:32,096 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:43:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:32,096 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:43:32,097 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:43:32,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:43:32,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:43:32,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:43:32,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:43:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:43:32,101 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:43:32,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:32,101 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:43:32,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:43:32,102 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:43:32,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:43:32,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:32,102 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:43:32,102 INFO L418 AbstractCegarLoop]: === Iteration 21 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:32,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:32,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693856, now seen corresponding path program 20 times [2019-08-05 10:43:32,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:32,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:43:32,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:32,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:32,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:43:32,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:43:32,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:43:32,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:43:32,432 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:43:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:32,463 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:43:32,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:43:32,464 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:43:32,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:32,465 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:43:32,465 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:43:32,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:43:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:43:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:43:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:43:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:43:32,468 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:43:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:32,468 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:43:32,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:43:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:43:32,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:43:32,469 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:32,469 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:43:32,470 INFO L418 AbstractCegarLoop]: === Iteration 22 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:32,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:32,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161478, now seen corresponding path program 21 times [2019-08-05 10:43:32,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:32,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:43:32,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:32,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:32,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:43:32,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:43:32,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:43:32,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:43:32,788 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:43:32,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:32,849 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:43:32,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:43:32,852 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:43:32,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:32,852 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:43:32,852 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:43:32,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:43:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:43:32,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:43:32,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:43:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:43:32,855 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:43:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:32,856 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:43:32,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:43:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:43:32,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:43:32,857 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:32,857 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:43:32,857 INFO L418 AbstractCegarLoop]: === Iteration 23 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:32,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:32,857 INFO L82 PathProgramCache]: Analyzing trace with hash -818603680, now seen corresponding path program 22 times [2019-08-05 10:43:32,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:32,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:43:32,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:33,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:33,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:43:33,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:43:33,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:43:33,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:43:33,534 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:43:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:33,565 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:43:33,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:43:33,565 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:43:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:33,566 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:43:33,566 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:43:33,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:43:33,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:43:33,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:43:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:43:33,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:43:33,570 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:43:33,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:33,570 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:43:33,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:43:33,570 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:43:33,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:43:33,571 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:33,571 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:43:33,571 INFO L418 AbstractCegarLoop]: === Iteration 24 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:33,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:33,571 INFO L82 PathProgramCache]: Analyzing trace with hash 393087750, now seen corresponding path program 23 times [2019-08-05 10:43:33,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:33,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:43:33,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:33,866 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:33,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:33,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:43:33,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:43:33,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:43:33,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:43:33,868 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:43:33,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:33,934 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:43:33,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:43:33,935 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:43:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:33,936 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:43:33,936 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:43:33,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:43:33,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:43:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:43:33,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:43:33,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:43:33,941 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:43:33,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:33,941 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:43:33,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:43:33,941 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:43:33,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:43:33,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:33,942 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:43:33,942 INFO L418 AbstractCegarLoop]: === Iteration 25 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:33,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:33,943 INFO L82 PathProgramCache]: Analyzing trace with hash -699183584, now seen corresponding path program 24 times [2019-08-05 10:43:33,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:33,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:43:33,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:34,614 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:34,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:34,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:43:34,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:43:34,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:43:34,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:43:34,616 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:43:34,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:34,664 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:43:34,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:43:34,664 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:43:34,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:34,665 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:43:34,665 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:43:34,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:43:34,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:43:34,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:43:34,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:43:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:43:34,670 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:43:34,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:34,670 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:43:34,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:43:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:43:34,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:43:34,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:34,675 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:43:34,675 INFO L418 AbstractCegarLoop]: === Iteration 26 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:34,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:34,675 INFO L82 PathProgramCache]: Analyzing trace with hash -199856570, now seen corresponding path program 25 times [2019-08-05 10:43:34,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:34,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:43:34,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:35,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:35,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:43:35,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:43:35,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:43:35,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:43:35,287 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:43:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:35,321 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:43:35,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:43:35,322 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:43:35,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:35,323 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:43:35,323 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:43:35,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:43:35,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:43:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:43:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:43:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:43:35,326 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:43:35,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:35,326 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:43:35,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:43:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:43:35,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:43:35,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:35,327 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:43:35,327 INFO L418 AbstractCegarLoop]: === Iteration 27 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:35,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:35,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588320, now seen corresponding path program 26 times [2019-08-05 10:43:35,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:35,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:43:35,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:36,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:36,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:43:36,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:43:36,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:43:36,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:43:36,189 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:43:36,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:36,334 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:43:36,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:43:36,334 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:43:36,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:36,335 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:43:36,335 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:43:36,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:43:36,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:43:36,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:43:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:43:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:43:36,338 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:43:36,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:36,340 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:43:36,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:43:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:43:36,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:43:36,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:36,342 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:43:36,342 INFO L418 AbstractCegarLoop]: === Iteration 28 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:36,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:36,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302278, now seen corresponding path program 27 times [2019-08-05 10:43:36,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:36,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:43:36,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:36,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:36,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:43:36,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:43:36,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:43:36,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:43:36,812 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:43:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:36,875 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:43:36,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:43:36,876 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:43:36,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:36,876 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:43:36,876 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:43:36,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:43:36,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:43:36,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:43:36,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:43:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:43:36,880 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:43:36,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:36,881 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:43:36,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:43:36,881 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:43:36,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:43:36,881 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:36,883 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:43:36,883 INFO L418 AbstractCegarLoop]: === Iteration 29 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:36,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:36,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336992, now seen corresponding path program 28 times [2019-08-05 10:43:36,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:36,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:43:36,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:37,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:37,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:43:37,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:43:37,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:43:37,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:43:37,283 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:43:37,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:37,334 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:43:37,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:43:37,334 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:43:37,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:37,335 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:43:37,335 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:43:37,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:43:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:43:37,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:43:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:43:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:43:37,339 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:43:37,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:37,339 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:43:37,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:43:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:43:37,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:43:37,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:37,340 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:43:37,340 INFO L418 AbstractCegarLoop]: === Iteration 30 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:37,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:37,341 INFO L82 PathProgramCache]: Analyzing trace with hash 125289670, now seen corresponding path program 29 times [2019-08-05 10:43:37,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:37,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:43:37,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:37,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:37,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:43:37,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:43:37,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:43:37,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:43:37,791 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:43:37,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:37,881 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:43:37,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:43:37,882 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:43:37,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:37,882 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:43:37,882 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:43:37,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:43:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:43:37,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:43:37,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:43:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:43:37,886 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:43:37,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:37,886 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:43:37,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:43:37,886 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:43:37,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:43:37,887 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:37,887 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:43:37,887 INFO L418 AbstractCegarLoop]: === Iteration 31 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:37,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:37,887 INFO L82 PathProgramCache]: Analyzing trace with hash -410989472, now seen corresponding path program 30 times [2019-08-05 10:43:37,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:37,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:43:37,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:38,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:38,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:43:38,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:43:38,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:43:38,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:43:38,736 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:43:38,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:38,817 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:43:38,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:43:38,817 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:43:38,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:38,818 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:43:38,818 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:43:38,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:43:38,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:43:38,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:43:38,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:43:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:43:38,822 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:43:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:38,822 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:43:38,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:43:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:43:38,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:43:38,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:38,823 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:43:38,823 INFO L418 AbstractCegarLoop]: === Iteration 32 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:38,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:38,823 INFO L82 PathProgramCache]: Analyzing trace with hash 144226310, now seen corresponding path program 31 times [2019-08-05 10:43:38,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:38,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:43:38,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:39,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:39,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:43:39,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:43:39,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:43:39,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:43:39,370 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:43:39,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:39,422 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:43:39,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:43:39,422 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:43:39,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:39,423 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:43:39,423 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:43:39,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:43:39,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:43:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:43:39,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:43:39,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:43:39,427 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:43:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:39,427 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:43:39,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:43:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:43:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:43:39,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:39,428 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:43:39,428 INFO L418 AbstractCegarLoop]: === Iteration 33 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:39,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:39,429 INFO L82 PathProgramCache]: Analyzing trace with hash 176046368, now seen corresponding path program 32 times [2019-08-05 10:43:39,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:39,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:43:39,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:40,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:40,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:43:40,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:43:40,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:43:40,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:43:40,789 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:43:40,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:40,825 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:43:40,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:43:40,826 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:43:40,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:40,827 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:43:40,827 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:43:40,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:43:40,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:43:40,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:43:40,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:43:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:43:40,831 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:43:40,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:40,831 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:43:40,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:43:40,831 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:43:40,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:43:40,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:40,832 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:43:40,832 INFO L418 AbstractCegarLoop]: === Iteration 34 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:40,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:40,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468166, now seen corresponding path program 33 times [2019-08-05 10:43:40,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:40,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:43:40,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:41,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:41,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:43:41,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:43:41,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:43:41,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:43:41,438 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:43:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:41,486 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:43:41,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:43:41,487 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:43:41,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:41,488 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:43:41,488 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:43:41,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:43:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:43:41,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:43:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:43:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:43:41,491 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:43:41,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:41,491 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:43:41,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:43:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:43:41,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:43:41,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:41,492 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:43:41,492 INFO L418 AbstractCegarLoop]: === Iteration 35 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:41,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:41,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772832, now seen corresponding path program 34 times [2019-08-05 10:43:41,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:41,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:43:41,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:42,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:42,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:43:42,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:43:42,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:43:42,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:43:42,093 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:43:42,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:42,131 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:43:42,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:43:42,132 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:43:42,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:42,132 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:43:42,132 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:43:42,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:43:42,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:43:42,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:43:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:43:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:43:42,136 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:43:42,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:42,136 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:43:42,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:43:42,136 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:43:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:43:42,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:42,137 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:43:42,137 INFO L418 AbstractCegarLoop]: === Iteration 36 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:42,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:42,137 INFO L82 PathProgramCache]: Analyzing trace with hash 440348294, now seen corresponding path program 35 times [2019-08-05 10:43:42,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:42,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:43:42,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:44,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:44,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:43:44,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:43:44,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:43:44,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:43:44,027 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:43:44,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:44,091 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:43:44,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:43:44,091 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:43:44,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:44,092 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:43:44,092 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:43:44,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:43:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:43:44,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:43:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:43:44,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:43:44,095 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:43:44,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:44,096 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:43:44,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:43:44,096 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:43:44,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:43:44,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:44,097 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:43:44,097 INFO L418 AbstractCegarLoop]: === Iteration 37 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:44,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:44,097 INFO L82 PathProgramCache]: Analyzing trace with hash 765893280, now seen corresponding path program 36 times [2019-08-05 10:43:44,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:44,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:43:44,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:44,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:44,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:43:44,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:43:44,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:43:44,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:43:44,676 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:43:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:44,746 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:43:44,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:43:44,747 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:43:44,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:44,747 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:43:44,748 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:43:44,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:43:44,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:43:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:43:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:43:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:43:44,751 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:43:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:44,751 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:43:44,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:43:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:43:44,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:43:44,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:44,752 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:43:44,752 INFO L418 AbstractCegarLoop]: === Iteration 38 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:44,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:44,752 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114042, now seen corresponding path program 37 times [2019-08-05 10:43:44,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:44,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:43:44,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:45,433 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:45,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:45,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:43:45,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:43:45,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:43:45,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:43:45,435 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:43:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:45,529 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:43:45,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:43:45,529 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:43:45,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:45,530 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:43:45,530 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:43:45,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:43:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:43:45,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:43:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:43:45,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:43:45,534 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:43:45,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:45,535 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:43:45,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:43:45,535 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:43:45,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:43:45,535 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:45,535 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:43:45,536 INFO L418 AbstractCegarLoop]: === Iteration 39 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:45,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:45,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972192, now seen corresponding path program 38 times [2019-08-05 10:43:45,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:45,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:43:45,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:46,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:46,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:43:46,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:43:46,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:43:46,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:43:46,290 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:43:46,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:46,339 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:43:46,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:43:46,339 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:43:46,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:46,340 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:43:46,340 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:43:46,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:43:46,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:43:46,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:43:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:43:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:43:46,343 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:43:46,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:46,343 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:43:46,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:43:46,344 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:43:46,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:43:46,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:46,344 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:43:46,345 INFO L418 AbstractCegarLoop]: === Iteration 40 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:46,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:46,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495750, now seen corresponding path program 39 times [2019-08-05 10:43:46,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:46,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:43:46,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:47,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:47,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:43:47,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:43:47,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:43:47,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:43:47,036 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:43:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:47,090 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:43:47,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:43:47,090 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:43:47,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:47,091 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:43:47,091 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:43:47,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:43:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:43:47,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:43:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:43:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:43:47,095 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:43:47,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:47,095 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:43:47,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:43:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:43:47,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:43:47,095 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:47,096 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:43:47,096 INFO L418 AbstractCegarLoop]: === Iteration 41 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:47,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:47,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791456, now seen corresponding path program 40 times [2019-08-05 10:43:47,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:47,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:43:47,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:47,863 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:47,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:47,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:43:47,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:43:47,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:43:47,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:43:47,865 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:43:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:47,942 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:43:47,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:43:47,942 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:43:47,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:47,943 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:43:47,943 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:43:47,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:43:47,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:43:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:43:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:43:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:43:47,946 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:43:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:47,946 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:43:47,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:43:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:43:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:43:47,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:47,947 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:43:47,948 INFO L418 AbstractCegarLoop]: === Iteration 42 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:47,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:47,948 INFO L82 PathProgramCache]: Analyzing trace with hash -692041658, now seen corresponding path program 41 times [2019-08-05 10:43:47,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:47,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:43:47,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:48,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:48,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:43:48,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:43:48,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:43:48,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:43:48,971 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:43:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:49,042 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:43:49,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:43:49,043 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:43:49,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:49,043 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:43:49,044 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:43:49,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:43:49,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:43:49,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:43:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:43:49,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:43:49,047 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:43:49,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:49,047 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:43:49,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:43:49,047 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:43:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:43:49,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:49,048 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:43:49,048 INFO L418 AbstractCegarLoop]: === Iteration 43 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:49,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:49,048 INFO L82 PathProgramCache]: Analyzing trace with hash 21543136, now seen corresponding path program 42 times [2019-08-05 10:43:49,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:49,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:43:49,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:50,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:50,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:43:50,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:43:50,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:43:50,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:43:50,036 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:43:50,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:50,091 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:43:50,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:43:50,092 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:43:50,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:50,093 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:43:50,093 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:43:50,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:43:50,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:43:50,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:43:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:43:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:43:50,097 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:43:50,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:50,097 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:43:50,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:43:50,097 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:43:50,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:43:50,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:50,098 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:43:50,098 INFO L418 AbstractCegarLoop]: === Iteration 44 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:50,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:50,098 INFO L82 PathProgramCache]: Analyzing trace with hash 667835270, now seen corresponding path program 43 times [2019-08-05 10:43:50,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:50,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:43:50,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:50,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:50,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:43:50,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:43:50,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:43:50,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:43:50,849 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:43:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:50,924 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:43:50,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:43:50,925 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:43:50,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:50,926 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:43:50,926 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:43:50,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:43:50,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:43:50,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:43:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:43:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:43:50,928 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:43:50,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:50,929 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:43:50,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:43:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:43:50,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:43:50,929 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:50,930 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:43:50,930 INFO L418 AbstractCegarLoop]: === Iteration 45 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:50,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:50,930 INFO L82 PathProgramCache]: Analyzing trace with hash -771945056, now seen corresponding path program 44 times [2019-08-05 10:43:50,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:50,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:43:50,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:51,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:51,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:43:51,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:43:51,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:43:51,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:43:51,783 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:43:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:51,869 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:43:51,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:43:51,870 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:43:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:51,871 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:43:51,871 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:43:51,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:43:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:43:51,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:43:51,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:43:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:43:51,874 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:43:51,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:51,874 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:43:51,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:43:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:43:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:43:51,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:51,876 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:43:51,876 INFO L418 AbstractCegarLoop]: === Iteration 46 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:51,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:51,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505094, now seen corresponding path program 45 times [2019-08-05 10:43:51,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:51,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:43:51,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:52,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:52,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:43:52,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:43:52,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:43:52,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:43:52,845 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:43:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:53,140 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:43:53,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:43:53,141 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:43:53,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:53,141 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:43:53,142 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:43:53,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:43:53,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:43:53,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:43:53,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:43:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:43:53,144 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:43:53,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:53,145 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:43:53,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:43:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:43:53,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:43:53,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:53,145 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:43:53,146 INFO L418 AbstractCegarLoop]: === Iteration 47 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:53,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:53,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081120, now seen corresponding path program 46 times [2019-08-05 10:43:53,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:53,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:43:53,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:54,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:54,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:43:54,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:43:54,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:43:54,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:43:54,327 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:43:54,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:54,386 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:43:54,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:43:54,386 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:43:54,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:54,387 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:43:54,387 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:43:54,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:43:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:43:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:43:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:43:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:43:54,390 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:43:54,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:54,390 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:43:54,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:43:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:43:54,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:43:54,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:54,391 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:43:54,391 INFO L418 AbstractCegarLoop]: === Iteration 48 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:54,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:54,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192890, now seen corresponding path program 47 times [2019-08-05 10:43:54,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:54,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:43:54,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:55,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:55,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:43:55,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:43:55,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:43:55,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:43:55,418 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:43:55,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:55,475 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:43:55,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:43:55,475 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:43:55,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:55,476 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:43:55,476 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:43:55,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:43:55,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:43:55,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:43:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:43:55,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:43:55,479 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:43:55,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:55,480 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:43:55,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:43:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:43:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:43:55,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:55,481 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:43:55,481 INFO L418 AbstractCegarLoop]: === Iteration 49 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:55,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:55,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593312, now seen corresponding path program 48 times [2019-08-05 10:43:55,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:55,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:43:55,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:56,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:56,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:43:56,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:43:56,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:43:56,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:43:56,387 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:43:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:56,458 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:43:56,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:43:56,458 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:43:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:56,459 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:43:56,459 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:43:56,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:43:56,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:43:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:43:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:43:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:43:56,463 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:43:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:56,463 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:43:56,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:43:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:43:56,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:43:56,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:56,464 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:43:56,464 INFO L418 AbstractCegarLoop]: === Iteration 50 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:56,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:56,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314938, now seen corresponding path program 49 times [2019-08-05 10:43:56,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:56,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:43:56,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:57,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:57,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:43:57,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:43:57,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:43:57,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:43:57,585 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:43:57,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:57,641 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:43:57,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:43:57,642 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:43:57,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:57,642 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:43:57,643 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:43:57,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:43:57,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:43:57,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:43:57,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:43:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:43:57,645 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:43:57,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:57,646 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:43:57,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:43:57,646 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:43:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:43:57,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:57,646 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:43:57,647 INFO L418 AbstractCegarLoop]: === Iteration 51 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:57,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:57,647 INFO L82 PathProgramCache]: Analyzing trace with hash -105059360, now seen corresponding path program 50 times [2019-08-05 10:43:57,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:57,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:43:57,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:58,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:58,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:43:58,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:43:58,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:43:58,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:43:58,648 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:43:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:58,757 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:43:58,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:43:58,757 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:43:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:58,758 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:43:58,758 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:43:58,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:43:58,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:43:58,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:43:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:43:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:43:58,760 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:43:58,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:58,761 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:43:58,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:43:58,761 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:43:58,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:43:58,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:58,762 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:43:58,762 INFO L418 AbstractCegarLoop]: === Iteration 52 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:58,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:58,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125190, now seen corresponding path program 51 times [2019-08-05 10:43:58,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:58,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:43:58,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:00,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:00,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:44:00,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:44:00,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:44:00,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:44:00,264 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:44:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:00,361 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:44:00,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:44:00,361 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:44:00,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:00,362 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:44:00,362 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:44:00,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:44:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:44:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:44:00,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:44:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:44:00,365 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:44:00,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:00,365 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:44:00,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:44:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:44:00,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:44:00,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:00,366 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:44:00,366 INFO L418 AbstractCegarLoop]: === Iteration 53 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:00,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:00,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107872, now seen corresponding path program 52 times [2019-08-05 10:44:00,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:00,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:44:00,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:01,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:01,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:44:01,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:44:01,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:44:01,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:44:01,403 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:44:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:01,471 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:44:01,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:44:01,472 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:44:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:01,473 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:44:01,473 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:44:01,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:44:01,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:44:01,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:44:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:44:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:44:01,477 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:44:01,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:01,477 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:44:01,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:44:01,477 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:44:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:44:01,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:01,478 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:44:01,478 INFO L418 AbstractCegarLoop]: === Iteration 54 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:01,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:01,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832646, now seen corresponding path program 53 times [2019-08-05 10:44:01,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:01,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:44:01,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:02,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:02,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:44:02,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:44:02,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:44:02,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:44:02,662 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:44:02,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:02,737 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:44:02,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:44:02,737 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:44:02,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:02,738 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:44:02,738 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:44:02,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:44:02,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:44:02,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:44:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:44:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:44:02,742 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:44:02,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:02,742 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:44:02,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:44:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:44:02,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:44:02,742 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:02,743 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:44:02,743 INFO L418 AbstractCegarLoop]: === Iteration 55 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:02,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:02,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895584, now seen corresponding path program 54 times [2019-08-05 10:44:02,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:02,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:44:02,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:04,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:04,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:44:04,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:44:04,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:44:04,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:44:04,331 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:44:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:04,405 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:44:04,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:44:04,405 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:44:04,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:04,406 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:44:04,406 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:44:04,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:44:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:44:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:44:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:44:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:44:04,409 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:44:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:04,409 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:44:04,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:44:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:44:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:44:04,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:04,410 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:44:04,411 INFO L418 AbstractCegarLoop]: === Iteration 56 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:04,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:04,411 INFO L82 PathProgramCache]: Analyzing trace with hash -836059386, now seen corresponding path program 55 times [2019-08-05 10:44:04,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:04,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:44:04,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:05,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:05,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:44:05,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:44:05,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:44:05,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:44:05,538 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:44:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:05,616 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:44:05,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:44:05,617 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:44:05,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:05,618 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:44:05,618 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:44:05,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:44:05,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:44:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:44:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:44:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:44:05,621 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:44:05,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:05,622 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:44:05,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:44:05,622 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:44:05,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:44:05,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:05,622 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:44:05,623 INFO L418 AbstractCegarLoop]: === Iteration 57 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:05,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:05,623 INFO L82 PathProgramCache]: Analyzing trace with hash -148039136, now seen corresponding path program 56 times [2019-08-05 10:44:05,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:05,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:44:05,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:06,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:06,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:06,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:44:06,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:44:06,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:44:06,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:44:06,778 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:44:06,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:06,843 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:44:06,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:44:06,844 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:44:06,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:06,844 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:44:06,845 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:44:06,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:44:06,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:44:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:44:06,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:44:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:44:06,848 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:44:06,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:06,848 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:44:06,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:44:06,848 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:44:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:44:06,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:06,849 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:44:06,849 INFO L418 AbstractCegarLoop]: === Iteration 58 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:06,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:06,849 INFO L82 PathProgramCache]: Analyzing trace with hash -294247866, now seen corresponding path program 57 times [2019-08-05 10:44:06,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:06,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:44:06,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:08,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:08,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:44:08,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:44:08,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:44:08,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:44:08,050 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:44:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:08,119 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:44:08,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:44:08,120 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:44:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:08,121 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:44:08,121 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:44:08,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:44:08,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:44:08,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:44:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:44:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:44:08,123 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:44:08,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:08,124 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:44:08,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:44:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:44:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:44:08,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:08,125 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:44:08,125 INFO L418 AbstractCegarLoop]: === Iteration 59 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:08,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:08,125 INFO L82 PathProgramCache]: Analyzing trace with hash -531751200, now seen corresponding path program 58 times [2019-08-05 10:44:08,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:08,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:44:08,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:09,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:09,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:44:09,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:44:09,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:44:09,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:44:09,705 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:44:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:09,803 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:44:09,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:44:09,803 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:44:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:09,804 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:44:09,804 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:44:09,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:44:09,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:44:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:44:09,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:44:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:44:09,806 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:44:09,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:09,807 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:44:09,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:44:09,807 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:44:09,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:44:09,807 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:09,807 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:44:09,807 INFO L418 AbstractCegarLoop]: === Iteration 60 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:09,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:09,808 INFO L82 PathProgramCache]: Analyzing trace with hash 695580038, now seen corresponding path program 59 times [2019-08-05 10:44:09,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:09,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:44:09,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:11,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:11,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:11,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:44:11,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:44:11,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:44:11,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:44:11,196 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:44:11,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:11,277 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:44:11,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:44:11,277 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:44:11,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:11,278 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:44:11,278 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:44:11,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:44:11,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:44:11,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:44:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:44:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:44:11,281 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:44:11,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:11,281 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:44:11,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:44:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:44:11,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:44:11,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:11,282 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:44:11,282 INFO L418 AbstractCegarLoop]: === Iteration 61 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:11,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:11,282 INFO L82 PathProgramCache]: Analyzing trace with hash 88142752, now seen corresponding path program 60 times [2019-08-05 10:44:11,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:11,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:44:11,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:12,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:12,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:12,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:44:12,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:44:12,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:44:12,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:44:12,652 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:44:12,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:12,738 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:44:12,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:44:12,738 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:44:12,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:12,739 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:44:12,739 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:44:12,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:44:12,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:44:12,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:44:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:44:12,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:44:12,742 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:44:12,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:12,742 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:44:12,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:44:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:44:12,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:44:12,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:12,743 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:44:12,744 INFO L418 AbstractCegarLoop]: === Iteration 62 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:12,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:12,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543930, now seen corresponding path program 61 times [2019-08-05 10:44:12,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:12,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:44:12,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:14,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:14,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:44:14,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:44:14,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:44:14,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:44:14,327 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:44:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:14,464 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:44:14,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:44:14,465 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:44:14,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:14,465 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:44:14,466 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:44:14,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:44:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:44:14,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:44:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:44:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:44:14,469 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:44:14,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:14,469 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:44:14,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:44:14,469 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:44:14,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:44:14,470 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:14,470 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:44:14,470 INFO L418 AbstractCegarLoop]: === Iteration 63 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:14,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:14,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223520, now seen corresponding path program 62 times [2019-08-05 10:44:14,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:14,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:44:14,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:15,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:15,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:44:15,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:44:15,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:44:15,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:44:15,892 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:44:15,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:15,984 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:44:15,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:44:15,985 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:44:15,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:15,986 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:44:15,986 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:44:15,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:44:15,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:44:15,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:44:15,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:44:15,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:44:15,989 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:44:15,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:15,989 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:44:15,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:44:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:44:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:44:15,990 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:15,990 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:44:15,990 INFO L418 AbstractCegarLoop]: === Iteration 64 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:15,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:15,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774598, now seen corresponding path program 63 times [2019-08-05 10:44:15,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:16,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:44:16,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:17,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:17,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:44:17,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:44:17,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:44:17,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:44:17,607 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:44:17,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:17,701 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:44:17,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:44:17,703 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:44:17,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:17,704 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:44:17,704 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:44:17,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:44:17,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:44:17,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:44:17,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:44:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:44:17,706 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:44:17,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:17,707 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:44:17,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:44:17,707 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:44:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:44:17,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:17,707 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:44:17,708 INFO L418 AbstractCegarLoop]: === Iteration 65 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:17,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:17,708 INFO L82 PathProgramCache]: Analyzing trace with hash -892596960, now seen corresponding path program 64 times [2019-08-05 10:44:17,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:17,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:44:17,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:19,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:19,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:44:19,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:44:19,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:44:19,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:44:19,325 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:44:19,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:19,458 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:44:19,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:44:19,459 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:44:19,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:19,459 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:44:19,459 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:44:19,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:44:19,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:44:19,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:44:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:44:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:44:19,461 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:44:19,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:19,462 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:44:19,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:44:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:44:19,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:44:19,462 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:19,462 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:44:19,463 INFO L418 AbstractCegarLoop]: === Iteration 66 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:19,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:19,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703930, now seen corresponding path program 65 times [2019-08-05 10:44:19,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:19,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:44:19,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:21,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:21,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:21,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:44:21,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:44:21,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:44:21,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:44:21,089 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:44:21,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:21,189 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:44:21,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:44:21,190 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:44:21,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:21,190 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:44:21,191 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:44:21,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:44:21,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:44:21,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:44:21,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:44:21,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:44:21,193 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:44:21,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:21,194 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:44:21,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:44:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:44:21,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:44:21,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:21,195 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:44:21,195 INFO L418 AbstractCegarLoop]: === Iteration 67 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:21,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:21,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718368, now seen corresponding path program 66 times [2019-08-05 10:44:21,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:21,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:44:21,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:23,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:23,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:44:23,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:44:23,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:44:23,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:44:23,140 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:44:23,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:23,234 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:44:23,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:44:23,235 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:44:23,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:23,236 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:44:23,236 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:44:23,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:44:23,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:44:23,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:44:23,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:44:23,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:44:23,239 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:44:23,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:23,239 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:44:23,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:44:23,239 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:44:23,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:44:23,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:23,240 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:44:23,240 INFO L418 AbstractCegarLoop]: === Iteration 68 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:23,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:23,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438202, now seen corresponding path program 67 times [2019-08-05 10:44:23,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:23,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:44:23,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:25,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:25,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:44:25,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:44:25,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:44:25,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:44:25,100 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:44:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:25,197 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:44:25,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:44:25,197 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:44:25,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:25,198 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:44:25,198 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:44:25,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:44:25,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:44:25,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:44:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:44:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:44:25,201 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:44:25,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:25,202 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:44:25,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:44:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:44:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:44:25,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:25,203 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:44:25,203 INFO L418 AbstractCegarLoop]: === Iteration 69 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:25,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:25,203 INFO L82 PathProgramCache]: Analyzing trace with hash 976119456, now seen corresponding path program 68 times [2019-08-05 10:44:25,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:25,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:44:25,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:26,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:26,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:26,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:44:26,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:44:26,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:44:26,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:44:26,894 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:44:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:26,978 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:44:26,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:44:26,978 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:44:26,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:26,979 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:44:26,979 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:44:26,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:44:26,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:44:26,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:44:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:44:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:44:26,982 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:44:26,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:26,982 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:44:26,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:44:26,982 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:44:26,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:44:26,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:26,983 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:44:26,983 INFO L418 AbstractCegarLoop]: === Iteration 70 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:26,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:26,984 INFO L82 PathProgramCache]: Analyzing trace with hash 194930118, now seen corresponding path program 69 times [2019-08-05 10:44:26,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:26,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:44:26,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:29,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:29,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:44:29,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:44:29,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:44:29,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:44:29,001 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:44:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:29,095 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:44:29,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:44:29,096 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:44:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:29,097 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:44:29,097 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:44:29,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:44:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:44:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:44:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:44:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:44:29,100 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:44:29,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:29,100 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:44:29,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:44:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:44:29,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:44:29,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:29,101 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:44:29,102 INFO L418 AbstractCegarLoop]: === Iteration 71 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:29,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:29,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864416, now seen corresponding path program 70 times [2019-08-05 10:44:29,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:29,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:44:29,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:31,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:31,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:31,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:44:31,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:44:31,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:44:31,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:44:31,192 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:44:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:31,293 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:44:31,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:44:31,294 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:44:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:31,295 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:44:31,295 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:44:31,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:44:31,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:44:31,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:44:31,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:44:31,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:44:31,298 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:44:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:31,299 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:44:31,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:44:31,299 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:44:31,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:44:31,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:31,299 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:44:31,300 INFO L418 AbstractCegarLoop]: === Iteration 72 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:31,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:31,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779898, now seen corresponding path program 71 times [2019-08-05 10:44:31,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:31,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:44:31,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:33,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:33,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:33,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:44:33,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:44:33,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:44:33,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:44:33,259 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:44:33,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:33,351 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:44:33,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:44:33,352 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:44:33,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:33,353 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:44:33,353 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:44:33,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:44:33,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:44:33,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:44:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:44:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:44:33,356 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:44:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:33,356 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:44:33,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:44:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:44:33,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:44:33,357 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:33,357 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:44:33,358 INFO L418 AbstractCegarLoop]: === Iteration 73 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:33,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:33,358 INFO L82 PathProgramCache]: Analyzing trace with hash 365428768, now seen corresponding path program 72 times [2019-08-05 10:44:33,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:33,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:44:33,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:35,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:35,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:35,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:44:35,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:44:35,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:44:35,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:44:35,534 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:44:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:35,640 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:44:35,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:44:35,641 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:44:35,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:35,641 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:44:35,641 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:44:35,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:44:35,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:44:35,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:44:35,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:44:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:44:35,645 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:44:35,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:35,645 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:44:35,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:44:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:44:35,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:44:35,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:35,646 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:44:35,646 INFO L418 AbstractCegarLoop]: === Iteration 74 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:35,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:35,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612026, now seen corresponding path program 73 times [2019-08-05 10:44:35,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:35,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:44:35,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:37,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:37,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:44:37,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:44:37,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:44:37,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:44:37,563 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:44:37,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:37,654 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:44:37,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:44:37,655 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:44:37,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:37,656 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:44:37,656 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:44:37,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:44:37,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:44:37,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:44:37,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:44:37,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:44:37,659 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:44:37,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:37,659 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:44:37,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:44:37,659 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:44:37,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:44:37,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:37,660 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:44:37,660 INFO L418 AbstractCegarLoop]: === Iteration 75 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:37,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:37,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334496, now seen corresponding path program 74 times [2019-08-05 10:44:37,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:37,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:44:37,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:40,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:40,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:44:40,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:44:40,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:44:40,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:44:40,236 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:44:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:40,324 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:44:40,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:44:40,324 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:44:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:40,325 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:44:40,325 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:44:40,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:44:40,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:44:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:44:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:44:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:44:40,328 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:44:40,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:40,328 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:44:40,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:44:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:44:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:44:40,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:40,329 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:44:40,329 INFO L418 AbstractCegarLoop]: === Iteration 76 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:40,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:40,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600250, now seen corresponding path program 75 times [2019-08-05 10:44:40,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:40,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:44:40,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:42,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:42,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:44:42,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:44:42,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:44:42,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:44:42,693 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:44:42,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:42,795 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:44:42,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:44:42,796 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:44:42,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:42,796 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:44:42,797 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:44:42,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:44:42,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:44:42,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:44:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:44:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:44:42,799 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:44:42,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:42,799 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:44:42,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:44:42,799 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:44:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:44:42,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:42,800 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:44:42,800 INFO L418 AbstractCegarLoop]: === Iteration 77 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:42,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:42,800 INFO L82 PathProgramCache]: Analyzing trace with hash -268904032, now seen corresponding path program 76 times [2019-08-05 10:44:42,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:42,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:44:42,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:45,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:45,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:44:45,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:44:45,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:44:45,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:44:45,078 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:44:45,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:45,182 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:44:45,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:44:45,183 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:44:45,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:45,184 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:44:45,184 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:44:45,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:44:45,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:44:45,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:44:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:44:45,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:44:45,187 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:44:45,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:45,187 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:44:45,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:44:45,188 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:44:45,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:44:45,188 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:45,189 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:44:45,189 INFO L418 AbstractCegarLoop]: === Iteration 78 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:45,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:45,189 INFO L82 PathProgramCache]: Analyzing trace with hash 253907654, now seen corresponding path program 77 times [2019-08-05 10:44:45,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:45,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:44:45,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:47,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:47,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:44:47,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:44:47,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:44:47,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:44:47,366 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:44:47,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:47,825 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:44:47,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:44:47,826 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:44:47,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:47,826 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:44:47,827 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:44:47,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:44:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:44:47,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:44:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:44:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:44:47,831 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:44:47,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:47,831 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:44:47,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:44:47,831 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:44:47,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:44:47,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:47,832 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:44:47,832 INFO L418 AbstractCegarLoop]: === Iteration 79 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:47,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:47,832 INFO L82 PathProgramCache]: Analyzing trace with hash -718799264, now seen corresponding path program 78 times [2019-08-05 10:44:47,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:47,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:44:47,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:50,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:50,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:44:50,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:44:50,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:44:50,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:44:50,202 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:44:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:50,447 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:44:50,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:44:50,447 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:44:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:50,448 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:44:50,448 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:44:50,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:44:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:44:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:44:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:44:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:44:50,451 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:44:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:50,451 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:44:50,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:44:50,452 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:44:50,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:44:50,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:50,452 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:44:50,453 INFO L418 AbstractCegarLoop]: === Iteration 80 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:50,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:50,453 INFO L82 PathProgramCache]: Analyzing trace with hash -807942650, now seen corresponding path program 79 times [2019-08-05 10:44:50,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:50,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:44:50,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:52,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:52,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:44:52,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:44:52,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:44:52,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:44:52,712 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:44:52,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:52,821 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:44:52,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:44:52,821 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:44:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:52,822 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:44:52,822 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:44:52,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:44:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:44:52,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:44:52,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:44:52,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:44:52,824 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:44:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:52,824 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:44:52,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:44:52,825 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:44:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:44:52,825 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:52,825 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:44:52,825 INFO L418 AbstractCegarLoop]: === Iteration 81 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:52,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:52,825 INFO L82 PathProgramCache]: Analyzing trace with hash 723579680, now seen corresponding path program 80 times [2019-08-05 10:44:52,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:52,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:44:52,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:56,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:56,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:44:56,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:44:56,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:44:56,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:44:56,913 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:44:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:57,021 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:44:57,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:44:57,022 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:44:57,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:57,023 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:44:57,023 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:44:57,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:44:57,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:44:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:44:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:44:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:44:57,026 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:44:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:57,027 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:44:57,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:44:57,027 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:44:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:44:57,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:57,027 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:44:57,027 INFO L418 AbstractCegarLoop]: === Iteration 82 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:57,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:57,028 INFO L82 PathProgramCache]: Analyzing trace with hash 956131654, now seen corresponding path program 81 times [2019-08-05 10:44:57,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:57,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:44:57,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:59,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:59,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:44:59,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:44:59,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:44:59,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:44:59,554 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:44:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:59,812 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:44:59,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:44:59,813 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:44:59,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:59,814 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:44:59,814 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:44:59,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:44:59,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:44:59,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:44:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:44:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:44:59,820 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:44:59,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:59,820 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:44:59,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:44:59,820 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:44:59,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:44:59,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:59,820 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:44:59,821 INFO L418 AbstractCegarLoop]: === Iteration 83 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:59,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:59,821 INFO L82 PathProgramCache]: Analyzing trace with hash -424691744, now seen corresponding path program 82 times [2019-08-05 10:44:59,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:59,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:44:59,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:03,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:03,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:45:03,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:45:03,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:45:03,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:45:03,499 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 10:45:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:03,614 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:45:03,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:45:03,615 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:45:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:03,616 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:45:03,616 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:45:03,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:45:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:45:03,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:45:03,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:45:03,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:45:03,619 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:45:03,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:03,619 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:45:03,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:45:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:45:03,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:45:03,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:03,620 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:45:03,620 INFO L418 AbstractCegarLoop]: === Iteration 84 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:03,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:03,620 INFO L82 PathProgramCache]: Analyzing trace with hash -280544122, now seen corresponding path program 83 times [2019-08-05 10:45:03,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:03,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:45:03,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:06,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:06,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:45:06,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:45:06,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:45:06,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:45:06,287 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-05 10:45:06,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:06,507 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:45:06,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:45:06,508 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 10:45:06,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:06,509 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:45:06,509 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:45:06,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:45:06,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:45:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:45:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:45:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:45:06,512 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:45:06,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:06,513 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:45:06,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:45:06,513 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:45:06,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:45:06,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:06,513 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 10:45:06,514 INFO L418 AbstractCegarLoop]: === Iteration 85 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:06,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:06,514 INFO L82 PathProgramCache]: Analyzing trace with hash -106935136, now seen corresponding path program 84 times [2019-08-05 10:45:06,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:06,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:45:06,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:09,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:09,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:45:09,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:45:09,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:45:09,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:45:09,079 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-05 10:45:09,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:09,198 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:45:09,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:45:09,198 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 10:45:09,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:09,199 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:45:09,199 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:45:09,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:45:09,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:45:09,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:45:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:45:09,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:45:09,202 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:45:09,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:09,202 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:45:09,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:45:09,203 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:45:09,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:45:09,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:09,203 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 10:45:09,204 INFO L418 AbstractCegarLoop]: === Iteration 86 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:09,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:09,204 INFO L82 PathProgramCache]: Analyzing trace with hash 979976134, now seen corresponding path program 85 times [2019-08-05 10:45:09,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:09,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:45:09,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:11,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:11,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:45:11,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:45:11,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:45:11,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:45:11,965 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-05 10:45:12,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:12,150 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:45:12,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:45:12,151 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 10:45:12,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:12,152 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:45:12,152 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:45:12,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:45:12,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:45:12,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:45:12,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:45:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:45:12,155 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 10:45:12,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:12,155 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:45:12,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:45:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:45:12,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:45:12,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:12,156 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 10:45:12,156 INFO L418 AbstractCegarLoop]: === Iteration 87 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:12,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:12,157 INFO L82 PathProgramCache]: Analyzing trace with hash 314487136, now seen corresponding path program 86 times [2019-08-05 10:45:12,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:12,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:45:12,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:14,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:14,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:14,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:45:14,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:45:14,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:45:14,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:45:14,782 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-05 10:45:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:14,916 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:45:14,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:45:14,917 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 10:45:14,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:14,918 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:45:14,918 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:45:14,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:45:14,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:45:14,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:45:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:45:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:45:14,920 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 10:45:14,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:14,921 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:45:14,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:45:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:45:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:45:14,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:14,922 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 10:45:14,922 INFO L418 AbstractCegarLoop]: === Iteration 88 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:14,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:14,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164678, now seen corresponding path program 87 times [2019-08-05 10:45:14,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:14,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:45:14,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:17,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:17,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:17,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:45:17,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:45:17,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:45:17,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:45:17,908 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-05 10:45:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:18,022 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:45:18,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:45:18,022 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 10:45:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:18,023 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:45:18,023 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:45:18,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:45:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:45:18,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:45:18,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:45:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:45:18,025 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 10:45:18,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:18,025 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:45:18,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:45:18,025 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:45:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:45:18,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:18,026 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:45:18,026 INFO L418 AbstractCegarLoop]: === Iteration 89 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:18,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:18,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364704, now seen corresponding path program 88 times [2019-08-05 10:45:18,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:18,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:45:18,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:21,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:21,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:45:21,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:45:21,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:45:21,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:45:21,027 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:45:21,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:21,143 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:45:21,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:45:21,143 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:45:21,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:21,144 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:45:21,144 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:45:21,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:45:21,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:45:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:45:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:45:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:45:21,148 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 10:45:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:21,148 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:45:21,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:45:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:45:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:45:21,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:21,149 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 10:45:21,149 INFO L418 AbstractCegarLoop]: === Iteration 90 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:21,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:21,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663622, now seen corresponding path program 89 times [2019-08-05 10:45:21,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:21,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:45:21,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:23,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:23,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:45:23,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:45:23,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:45:23,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:45:23,948 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 10:45:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:25,143 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:45:25,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:45:25,143 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 10:45:25,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:25,144 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:45:25,144 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:45:25,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:45:25,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:45:25,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:45:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:45:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:45:25,147 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 10:45:25,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:25,148 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:45:25,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:45:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:45:25,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:45:25,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:25,149 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 10:45:25,149 INFO L418 AbstractCegarLoop]: === Iteration 91 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:25,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:25,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930080, now seen corresponding path program 90 times [2019-08-05 10:45:25,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:25,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:45:25,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:28,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:28,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:45:28,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:45:28,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:45:28,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:45:28,438 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-05 10:45:28,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:28,557 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:45:28,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:45:28,557 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 10:45:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:28,558 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:45:28,558 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:45:28,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:45:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:45:28,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:45:28,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:45:28,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:45:28,561 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 10:45:28,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:28,561 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:45:28,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:45:28,561 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:45:28,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:45:28,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:28,562 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 10:45:28,562 INFO L418 AbstractCegarLoop]: === Iteration 92 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:28,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:28,563 INFO L82 PathProgramCache]: Analyzing trace with hash 854092166, now seen corresponding path program 91 times [2019-08-05 10:45:28,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:28,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:45:28,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:31,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:31,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:45:31,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:45:31,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:45:31,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:45:31,720 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-05 10:45:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:31,845 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:45:31,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:45:31,846 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 10:45:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:31,847 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:45:31,847 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:45:31,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:45:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:45:31,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:45:31,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:45:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:45:31,850 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 10:45:31,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:31,850 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:45:31,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:45:31,850 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:45:31,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:45:31,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:31,851 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 10:45:31,851 INFO L418 AbstractCegarLoop]: === Iteration 93 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:31,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:31,851 INFO L82 PathProgramCache]: Analyzing trace with hash 707051424, now seen corresponding path program 92 times [2019-08-05 10:45:31,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:31,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:45:31,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:35,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:35,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:35,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:45:35,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:45:35,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:45:35,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:45:35,008 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-05 10:45:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:35,133 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:45:35,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:45:35,133 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 10:45:35,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:35,134 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:45:35,134 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:45:35,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:45:35,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:45:35,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:45:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:45:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:45:35,137 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 10:45:35,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:35,137 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:45:35,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:45:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:45:35,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:45:35,138 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:35,138 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 10:45:35,139 INFO L418 AbstractCegarLoop]: === Iteration 94 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:35,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:35,139 INFO L82 PathProgramCache]: Analyzing trace with hash 443755718, now seen corresponding path program 93 times [2019-08-05 10:45:35,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:35,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:45:35,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:38,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:38,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:45:38,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:45:38,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:45:38,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:45:38,525 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-05 10:45:38,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:38,654 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:45:38,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:45:38,654 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 10:45:38,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:38,655 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:45:38,655 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:45:38,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:45:38,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:45:38,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:45:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:45:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:45:38,659 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 10:45:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:38,659 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:45:38,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:45:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:45:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:45:38,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:38,660 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 10:45:38,660 INFO L418 AbstractCegarLoop]: === Iteration 95 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:38,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:38,661 INFO L82 PathProgramCache]: Analyzing trace with hash 871523424, now seen corresponding path program 94 times [2019-08-05 10:45:38,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:38,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:45:38,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:42,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:42,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:42,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:45:42,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:45:42,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:45:42,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:45:42,532 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-08-05 10:45:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:42,677 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:45:42,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:45:42,678 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-05 10:45:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:42,679 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:45:42,679 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:45:42,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:45:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:45:42,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:45:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:45:42,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:45:42,683 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 10:45:42,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:42,683 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:45:42,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:45:42,683 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:45:42,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:45:42,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:42,684 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-05 10:45:42,684 INFO L418 AbstractCegarLoop]: === Iteration 96 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:42,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:42,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420422, now seen corresponding path program 95 times [2019-08-05 10:45:42,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:42,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:45:42,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:45,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:45,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:45:45,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:45:45,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:45:45,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:45:45,913 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-08-05 10:45:46,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:46,053 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:45:46,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:45:46,054 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 10:45:46,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:46,055 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:45:46,055 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:45:46,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:45:46,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:45:46,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:45:46,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:45:46,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:45:46,058 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 10:45:46,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:46,058 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:45:46,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:45:46,058 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:45:46,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:45:46,058 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:46,059 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:45:46,059 INFO L418 AbstractCegarLoop]: === Iteration 97 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:46,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:46,059 INFO L82 PathProgramCache]: Analyzing trace with hash 15325472, now seen corresponding path program 96 times [2019-08-05 10:45:46,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:46,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:45:46,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:49,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:49,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:45:49,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:45:49,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:45:49,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:45:49,530 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:45:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:49,678 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:45:49,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:45:49,679 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:45:49,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:49,679 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:45:49,680 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:45:49,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:45:49,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:45:49,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:45:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:45:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:45:49,683 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 10:45:49,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:49,683 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:45:49,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:45:49,683 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:45:49,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:45:49,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:49,684 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 10:45:49,684 INFO L418 AbstractCegarLoop]: === Iteration 98 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:49,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:49,684 INFO L82 PathProgramCache]: Analyzing trace with hash 475087686, now seen corresponding path program 97 times [2019-08-05 10:45:49,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:49,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:45:49,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:53,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:53,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:45:53,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:45:53,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:45:53,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:45:53,327 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-05 10:45:53,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:53,628 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:45:53,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:45:53,629 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 10:45:53,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:53,630 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:45:53,630 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:45:53,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:45:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:45:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:45:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:45:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:45:53,633 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 10:45:53,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:53,633 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:45:53,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:45:53,633 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:45:53,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:45:53,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:53,634 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-05 10:45:53,634 INFO L418 AbstractCegarLoop]: === Iteration 99 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:53,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:53,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814432, now seen corresponding path program 98 times [2019-08-05 10:45:53,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:53,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:45:53,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:57,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:57,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:45:57,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:45:57,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:45:57,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:45:57,269 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-08-05 10:45:57,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:57,400 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:45:57,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:45:57,401 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-05 10:45:57,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:57,402 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:45:57,402 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:45:57,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:45:57,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:45:57,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:45:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:45:57,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:45:57,405 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 10:45:57,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:57,405 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:45:57,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:45:57,406 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:45:57,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:45:57,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:57,406 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-05 10:45:57,406 INFO L418 AbstractCegarLoop]: === Iteration 100 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:57,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:57,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670598, now seen corresponding path program 99 times [2019-08-05 10:45:57,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:57,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:45:57,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:00,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:00,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:46:00,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:46:00,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:46:00,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:46:00,837 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-08-05 10:46:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:01,027 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:46:01,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:46:01,027 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-05 10:46:01,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:01,028 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:46:01,029 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:46:01,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:46:01,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:46:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:46:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:46:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:46:01,032 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 10:46:01,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:01,032 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:46:01,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:46:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:46:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:46:01,033 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:01,033 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-05 10:46:01,033 INFO L418 AbstractCegarLoop]: === Iteration 101 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:01,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:01,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080928, now seen corresponding path program 100 times [2019-08-05 10:46:01,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:01,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:46:01,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:05,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:05,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:46:05,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:46:05,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:46:05,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:46:05,194 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-08-05 10:46:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:05,345 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 10:46:05,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:46:05,346 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-08-05 10:46:05,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:05,347 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:46:05,347 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:46:05,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:46:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:46:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:46:05,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:46:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:46:05,351 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-05 10:46:05,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:05,351 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:46:05,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:46:05,351 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:46:05,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:46:05,352 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:05,352 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-08-05 10:46:05,353 INFO L418 AbstractCegarLoop]: === Iteration 102 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:05,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:05,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833862, now seen corresponding path program 101 times [2019-08-05 10:46:05,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:05,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:46:05,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:09,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:09,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:09,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:46:09,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:46:09,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:46:09,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:46:09,220 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-08-05 10:46:09,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:09,408 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:46:09,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:46:09,408 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-08-05 10:46:09,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:09,411 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:46:09,412 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:46:09,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:46:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:46:09,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:46:09,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:46:09,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 10:46:09,415 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-05 10:46:09,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:09,415 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 10:46:09,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:46:09,416 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 10:46:09,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:46:09,416 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:09,416 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-08-05 10:46:09,417 INFO L418 AbstractCegarLoop]: === Iteration 103 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:09,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:09,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076704, now seen corresponding path program 102 times [2019-08-05 10:46:09,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:09,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:46:09,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:13,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:13,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:46:13,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:46:13,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:46:13,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:46:13,490 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-08-05 10:46:13,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:13,682 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 10:46:13,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:46:13,682 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-08-05 10:46:13,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:13,684 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:46:13,684 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:46:13,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:46:13,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:46:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:46:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:46:13,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:46:13,687 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-05 10:46:13,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:13,687 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:46:13,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:46:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:46:13,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:46:13,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:13,688 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-08-05 10:46:13,688 INFO L418 AbstractCegarLoop]: === Iteration 104 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:13,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:13,688 INFO L82 PathProgramCache]: Analyzing trace with hash 748670214, now seen corresponding path program 103 times [2019-08-05 10:46:13,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:13,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:46:13,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:17,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:17,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:17,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:46:17,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:46:17,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:46:17,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:46:17,886 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-08-05 10:46:18,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:18,047 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:46:18,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:46:18,048 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-08-05 10:46:18,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:18,048 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:46:18,049 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:46:18,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:46:18,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:46:18,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:46:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:46:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:46:18,051 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-05 10:46:18,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:18,052 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:46:18,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 10:46:18,052 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:46:18,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:46:18,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:18,052 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-05 10:46:18,052 INFO L418 AbstractCegarLoop]: === Iteration 105 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:18,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:18,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938208, now seen corresponding path program 104 times [2019-08-05 10:46:18,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:18,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:46:18,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:22,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:22,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:22,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:46:22,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:46:22,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:46:22,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:46:22,580 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-05 10:46:22,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:22,769 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:46:22,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:46:22,770 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-05 10:46:22,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:22,770 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:46:22,771 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:46:22,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:46:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:46:22,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:46:22,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:46:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:46:22,773 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-05 10:46:22,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:22,774 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:46:22,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:46:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:46:22,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:46:22,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:22,775 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-08-05 10:46:22,775 INFO L418 AbstractCegarLoop]: === Iteration 106 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:22,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:22,775 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492346, now seen corresponding path program 105 times [2019-08-05 10:46:22,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:22,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:46:22,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:26,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:26,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:46:26,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:46:26,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:46:26,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:46:26,689 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-08-05 10:46:26,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:26,848 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:46:26,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:46:26,849 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-08-05 10:46:26,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:26,850 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:46:26,850 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:46:26,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:46:26,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:46:26,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:46:26,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:46:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 10:46:26,853 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-05 10:46:26,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:26,854 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 10:46:26,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:46:26,854 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 10:46:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:46:26,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:26,855 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-08-05 10:46:26,855 INFO L418 AbstractCegarLoop]: === Iteration 107 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:26,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:26,855 INFO L82 PathProgramCache]: Analyzing trace with hash -132755232, now seen corresponding path program 106 times [2019-08-05 10:46:26,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:26,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:46:26,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:30,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:30,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 10:46:30,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 10:46:30,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 10:46:30,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:46:30,946 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-08-05 10:46:31,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:31,130 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 10:46:31,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 10:46:31,130 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-08-05 10:46:31,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:31,130 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:46:31,130 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:46:31,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:46:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:46:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:46:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:46:31,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:46:31,132 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-05 10:46:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:31,133 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:46:31,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 10:46:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:46:31,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:46:31,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:31,134 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-08-05 10:46:31,134 INFO L418 AbstractCegarLoop]: === Iteration 108 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:31,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:31,134 INFO L82 PathProgramCache]: Analyzing trace with hash 179553158, now seen corresponding path program 107 times [2019-08-05 10:46:31,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:31,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:46:31,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:35,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:35,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:35,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 10:46:35,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 10:46:35,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 10:46:35,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:46:35,464 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-08-05 10:46:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:35,650 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:46:35,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:46:35,651 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-08-05 10:46:35,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:35,651 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:46:35,652 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:46:35,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:46:35,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:46:35,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:46:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:46:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 10:46:35,653 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-05 10:46:35,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:35,653 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 10:46:35,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 10:46:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 10:46:35,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:46:35,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:35,654 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-08-05 10:46:35,654 INFO L418 AbstractCegarLoop]: === Iteration 109 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:35,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:35,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178656, now seen corresponding path program 108 times [2019-08-05 10:46:35,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:35,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:46:35,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:39,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:39,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 10:46:39,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 10:46:39,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 10:46:39,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:46:39,978 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-08-05 10:46:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:40,155 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 10:46:40,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 10:46:40,156 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-08-05 10:46:40,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:40,156 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:46:40,156 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:46:40,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:46:40,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:46:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:46:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:46:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:46:40,159 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-05 10:46:40,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:40,159 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:46:40,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 10:46:40,160 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:46:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:46:40,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:40,161 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-08-05 10:46:40,161 INFO L418 AbstractCegarLoop]: === Iteration 110 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:40,161 INFO L82 PathProgramCache]: Analyzing trace with hash 751830726, now seen corresponding path program 109 times [2019-08-05 10:46:40,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:40,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:46:40,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:44,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:44,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 10:46:44,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 10:46:44,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 10:46:44,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:46:44,529 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-08-05 10:46:44,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:44,735 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:46:44,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 10:46:44,736 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-08-05 10:46:44,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:44,736 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:46:44,737 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:46:44,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:46:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:46:44,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 10:46:44,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:46:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 10:46:44,739 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-05 10:46:44,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:44,739 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 10:46:44,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 10:46:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 10:46:44,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:46:44,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:44,741 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-08-05 10:46:44,741 INFO L418 AbstractCegarLoop]: === Iteration 111 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:44,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:44,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914080, now seen corresponding path program 110 times [2019-08-05 10:46:44,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:44,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:46:44,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:49,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:49,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 10:46:49,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 10:46:49,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 10:46:49,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:46:49,183 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-08-05 10:46:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:49,346 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 10:46:49,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 10:46:49,347 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-08-05 10:46:49,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:49,347 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:46:49,347 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:46:49,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:46:49,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:46:49,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:46:49,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:46:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 10:46:49,350 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-08-05 10:46:49,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:49,351 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 10:46:49,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 10:46:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 10:46:49,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:46:49,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:49,352 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-08-05 10:46:49,352 INFO L418 AbstractCegarLoop]: === Iteration 112 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:49,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:49,352 INFO L82 PathProgramCache]: Analyzing trace with hash 954759686, now seen corresponding path program 111 times [2019-08-05 10:46:49,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:49,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:46:49,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:53,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:53,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 10:46:53,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 10:46:53,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 10:46:53,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:46:53,816 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2019-08-05 10:46:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:54,002 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:46:54,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 10:46:54,003 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2019-08-05 10:46:54,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:54,004 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:46:54,004 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:46:54,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:46:54,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:46:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:46:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:46:54,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:46:54,007 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-08-05 10:46:54,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:54,008 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:46:54,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 10:46:54,008 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:46:54,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:46:54,008 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:54,008 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 10:46:54,009 INFO L418 AbstractCegarLoop]: === Iteration 113 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:54,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:54,009 INFO L82 PathProgramCache]: Analyzing trace with hash -467222752, now seen corresponding path program 112 times [2019-08-05 10:46:54,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:54,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:46:54,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:58,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:58,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:46:58,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:46:58,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:46:58,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:46:58,825 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-05 10:46:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:59,038 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 10:46:59,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:46:59,039 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 10:46:59,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:59,040 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:46:59,040 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:46:59,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:46:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:46:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:46:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:46:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:46:59,042 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-08-05 10:46:59,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:59,043 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:46:59,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:46:59,043 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:46:59,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:46:59,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:59,043 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2019-08-05 10:46:59,043 INFO L418 AbstractCegarLoop]: === Iteration 114 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:59,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:59,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005370, now seen corresponding path program 113 times [2019-08-05 10:46:59,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:59,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:46:59,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:03,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:03,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 10:47:03,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 10:47:03,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 10:47:03,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:47:03,942 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2019-08-05 10:47:04,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:04,130 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:47:04,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 10:47:04,130 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2019-08-05 10:47:04,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:04,131 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:47:04,131 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:47:04,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:47:04,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:47:04,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 10:47:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:47:04,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 10:47:04,133 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-08-05 10:47:04,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:04,134 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 10:47:04,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 10:47:04,134 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 10:47:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:47:04,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:04,135 INFO L399 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2019-08-05 10:47:04,135 INFO L418 AbstractCegarLoop]: === Iteration 115 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:04,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:04,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439136, now seen corresponding path program 114 times [2019-08-05 10:47:04,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:04,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:47:04,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:08,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:08,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:08,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 10:47:08,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 10:47:08,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 10:47:08,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:47:08,990 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2019-08-05 10:47:09,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:09,175 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 10:47:09,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 10:47:09,176 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2019-08-05 10:47:09,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:09,176 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:47:09,177 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:47:09,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:47:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:47:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 10:47:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:47:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 10:47:09,179 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-08-05 10:47:09,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:09,180 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 10:47:09,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 10:47:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 10:47:09,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:47:09,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:09,181 INFO L399 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2019-08-05 10:47:09,181 INFO L418 AbstractCegarLoop]: === Iteration 116 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:09,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:09,181 INFO L82 PathProgramCache]: Analyzing trace with hash 954069126, now seen corresponding path program 115 times [2019-08-05 10:47:09,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:09,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:47:09,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:13,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:13,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-05 10:47:13,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-05 10:47:13,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-05 10:47:13,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:47:13,925 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2019-08-05 10:47:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:14,161 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 10:47:14,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-05 10:47:14,161 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2019-08-05 10:47:14,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:14,162 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:47:14,162 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 10:47:14,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:47:14,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 10:47:14,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 10:47:14,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:47:14,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 10:47:14,165 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2019-08-05 10:47:14,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:14,165 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 10:47:14,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-05 10:47:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 10:47:14,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 10:47:14,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:14,166 INFO L399 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2019-08-05 10:47:14,166 INFO L418 AbstractCegarLoop]: === Iteration 117 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:14,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:14,167 INFO L82 PathProgramCache]: Analyzing trace with hash -488630112, now seen corresponding path program 116 times [2019-08-05 10:47:14,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:14,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:47:14,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:19,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:19,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:19,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-08-05 10:47:19,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-08-05 10:47:19,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-08-05 10:47:19,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:47:19,100 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2019-08-05 10:47:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:19,333 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 10:47:19,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-05 10:47:19,334 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2019-08-05 10:47:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:19,334 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:47:19,334 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:47:19,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:47:19,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:47:19,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 10:47:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:47:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 10:47:19,337 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2019-08-05 10:47:19,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:19,338 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 10:47:19,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-08-05 10:47:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 10:47:19,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:47:19,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:19,338 INFO L399 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2019-08-05 10:47:19,339 INFO L418 AbstractCegarLoop]: === Iteration 118 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:19,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:19,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2032333766, now seen corresponding path program 117 times [2019-08-05 10:47:19,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:19,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 10:47:19,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:24,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:24,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-08-05 10:47:24,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-08-05 10:47:24,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-08-05 10:47:24,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:47:24,297 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 120 states. [2019-08-05 10:47:24,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:24,493 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 10:47:24,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-08-05 10:47:24,494 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2019-08-05 10:47:24,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:24,495 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:47:24,495 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:47:24,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:47:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:47:24,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 10:47:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 10:47:24,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 10:47:24,498 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2019-08-05 10:47:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:24,498 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 10:47:24,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-08-05 10:47:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 10:47:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 10:47:24,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:24,498 INFO L399 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2019-08-05 10:47:24,499 INFO L418 AbstractCegarLoop]: === Iteration 119 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:24,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:24,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1422164640, now seen corresponding path program 118 times [2019-08-05 10:47:24,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:24,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:47:24,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:47:24,872 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:47:24,873 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:47:24,885 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:47:24,885 INFO L202 PluginConnector]: Adding new model 110517_Martin01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:47:24 BoogieIcfgContainer [2019-08-05 10:47:24,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:47:24,888 INFO L168 Benchmark]: Toolchain (without parser) took 239765.39 ms. Allocated memory was 135.3 MB in the beginning and 682.6 MB in the end (delta: 547.4 MB). Free memory was 110.7 MB in the beginning and 647.6 MB in the end (delta: -536.9 MB). Peak memory consumption was 577.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:24,888 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 135.3 MB. Free memory was 111.7 MB in the beginning and 111.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:47:24,889 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.95 ms. Allocated memory is still 135.3 MB. Free memory was 110.5 MB in the beginning and 108.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:24,894 INFO L168 Benchmark]: Boogie Preprocessor took 20.51 ms. Allocated memory is still 135.3 MB. Free memory was 108.7 MB in the beginning and 107.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:24,895 INFO L168 Benchmark]: RCFGBuilder took 309.07 ms. Allocated memory is still 135.3 MB. Free memory was 107.6 MB in the beginning and 98.8 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:24,896 INFO L168 Benchmark]: TraceAbstraction took 239396.64 ms. Allocated memory was 135.3 MB in the beginning and 682.6 MB in the end (delta: 547.4 MB). Free memory was 98.4 MB in the beginning and 647.6 MB in the end (delta: -549.2 MB). Peak memory consumption was 565.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:24,903 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.18 ms. Allocated memory is still 135.3 MB. Free memory was 111.7 MB in the beginning and 111.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.95 ms. Allocated memory is still 135.3 MB. Free memory was 110.5 MB in the beginning and 108.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.51 ms. Allocated memory is still 135.3 MB. Free memory was 108.7 MB in the beginning and 107.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 309.07 ms. Allocated memory is still 135.3 MB. Free memory was 107.6 MB in the beginning and 98.8 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239396.64 ms. Allocated memory was 135.3 MB in the beginning and 682.6 MB in the end (delta: 547.4 MB). Free memory was 98.4 MB in the beginning and 647.6 MB in the end (delta: -549.2 MB). Peak memory consumption was 565.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 9]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 9). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 118,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 239.3s OverallTime, 119 OverallIterations, 118 TraceHistogramMax, 14.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 354 SDtfs, 0 SDslu, 1956 SDs, 0 SdLazy, 9095 SolverSat, 223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7139 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7021 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 219.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 118 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 222.3s InterpolantComputationTime, 7257 NumberOfCodeBlocks, 7257 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 7139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1692179 SizeOfPredicates, 118 NumberOfNonLiveVariables, 21417 ConjunctsInSsa, 7139 ConjunctsInUnsatCore, 118 InterpolantComputations, 1 PerfectInterpolantSequences, 0/273819 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown