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/real-life/PricedTimedAutomata/u2b02_multiple_pca_SAFE.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:12:32,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:12:32,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:12:32,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:12:32,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:12:32,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:12:32,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:12:32,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:12:32,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:12:32,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:12:32,027 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:12:32,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:12:32,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:12:32,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:12:32,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:12:32,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:12:32,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:12:32,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:12:32,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:12:32,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:12:32,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:12:32,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:12:32,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:12:32,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:12:32,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:12:32,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:12:32,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:12:32,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:12:32,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:12:32,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:12:32,055 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:12:32,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:12:32,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:12:32,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:12:32,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:12:32,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:12:32,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:12:32,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:12:32,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:12:32,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:12:32,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:12:32,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:12:32,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:12:32,139 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:12:32,141 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:12:32,142 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:12:32,143 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b02_multiple_pca_SAFE.bpl [2019-08-05 10:12:32,143 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/PricedTimedAutomata/u2b02_multiple_pca_SAFE.bpl' [2019-08-05 10:12:32,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:12:32,215 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:12:32,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:12:32,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:12:32,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:12:32,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "u2b02_multiple_pca_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:32" (1/1) ... [2019-08-05 10:12:32,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "u2b02_multiple_pca_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:32" (1/1) ... [2019-08-05 10:12:32,252 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:12:32,252 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:12:32,252 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:12:32,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:12:32,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:12:32,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:12:32,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:12:32,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "u2b02_multiple_pca_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:32" (1/1) ... [2019-08-05 10:12:32,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "u2b02_multiple_pca_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:32" (1/1) ... [2019-08-05 10:12:32,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "u2b02_multiple_pca_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:32" (1/1) ... [2019-08-05 10:12:32,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "u2b02_multiple_pca_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:32" (1/1) ... [2019-08-05 10:12:32,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "u2b02_multiple_pca_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:32" (1/1) ... [2019-08-05 10:12:32,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "u2b02_multiple_pca_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:32" (1/1) ... [2019-08-05 10:12:32,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "u2b02_multiple_pca_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:32" (1/1) ... [2019-08-05 10:12:32,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:12:32,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:12:32,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:12:32,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:12:32,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "u2b02_multiple_pca_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:32" (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:12:32,357 INFO L130 BoogieDeclarations]: Found specification of procedure perform_resets [2019-08-05 10:12:32,357 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_x [2019-08-05 10:12:32,357 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:12:32,357 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:12:32,358 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:12:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_reset_steps [2019-08-05 10:12:32,470 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:12:33,101 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:12:33,101 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-08-05 10:12:33,103 INFO L202 PluginConnector]: Adding new model u2b02_multiple_pca_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:12:33 BoogieIcfgContainer [2019-08-05 10:12:33,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:12:33,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:12:33,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:12:33,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:12:33,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b02_multiple_pca_SAFE.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:12:32" (1/2) ... [2019-08-05 10:12:33,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5a26c and model type u2b02_multiple_pca_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:12:33, skipping insertion in model container [2019-08-05 10:12:33,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "u2b02_multiple_pca_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:12:33" (2/2) ... [2019-08-05 10:12:33,112 INFO L109 eAbstractionObserver]: Analyzing ICFG u2b02_multiple_pca_SAFE.bpl [2019-08-05 10:12:33,122 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:12:33,130 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:12:33,146 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:12:33,172 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:12:33,173 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:12:33,173 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:12:33,174 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:12:33,174 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:12:33,174 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:12:33,174 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:12:33,175 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:12:33,175 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:12:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-08-05 10:12:33,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:12:33,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:33,198 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:12:33,201 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:33,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:33,211 INFO L82 PathProgramCache]: Analyzing trace with hash 4095, now seen corresponding path program 1 times [2019-08-05 10:12:33,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:33,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:33,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:33,358 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:12:33,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:33,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:12:33,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:33,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:33,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:33,381 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-08-05 10:12:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:33,431 INFO L93 Difference]: Finished difference Result 19 states and 30 transitions. [2019-08-05 10:12:33,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:33,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:12:33,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:33,445 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:12:33,445 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:12:33,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:12:33,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:12:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:12:33,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:12:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-08-05 10:12:33,485 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 2 [2019-08-05 10:12:33,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:33,486 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-08-05 10:12:33,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2019-08-05 10:12:33,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:12:33,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:33,487 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:12:33,488 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:33,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:33,488 INFO L82 PathProgramCache]: Analyzing trace with hash 125110644, now seen corresponding path program 1 times [2019-08-05 10:12:33,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:33,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:33,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:33,587 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:12:33,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:33,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:33,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:33,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:33,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:33,591 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 3 states. [2019-08-05 10:12:33,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:33,814 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-08-05 10:12:33,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:33,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 10:12:33,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:33,818 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:12:33,819 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:12:33,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:12:33,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:12:33,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-08-05 10:12:33,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:12:33,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-08-05 10:12:33,830 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 5 [2019-08-05 10:12:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:33,831 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-08-05 10:12:33,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-08-05 10:12:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:12:33,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:33,832 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:12:33,833 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:33,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:33,834 INFO L82 PathProgramCache]: Analyzing trace with hash -416483757, now seen corresponding path program 1 times [2019-08-05 10:12:33,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:33,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:33,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:33,939 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:12:33,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:33,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:33,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:33,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:33,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:33,943 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 3 states. [2019-08-05 10:12:34,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:34,027 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2019-08-05 10:12:34,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:34,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-08-05 10:12:34,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:34,029 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:12:34,029 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:12:34,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 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:12:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:12:34,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2019-08-05 10:12:34,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:12:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2019-08-05 10:12:34,037 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 6 [2019-08-05 10:12:34,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:34,038 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2019-08-05 10:12:34,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2019-08-05 10:12:34,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:12:34,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:34,039 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:34,039 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:34,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:34,040 INFO L82 PathProgramCache]: Analyzing trace with hash -26092743, now seen corresponding path program 1 times [2019-08-05 10:12:34,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:34,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:12:34,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:34,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:34,345 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:12:34,408 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:12:34,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:34,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:34,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:12:34,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:12:34,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:12:34,410 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 5 states. [2019-08-05 10:12:34,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:34,626 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2019-08-05 10:12:34,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:12:34,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 10:12:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:34,631 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:12:34,631 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:12:34,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:12:34,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:12:34,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:12:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:12:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2019-08-05 10:12:34,648 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 7 [2019-08-05 10:12:34,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:34,648 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2019-08-05 10:12:34,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:12:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2019-08-05 10:12:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:12:34,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:34,650 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:34,651 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:34,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:34,652 INFO L82 PathProgramCache]: Analyzing trace with hash 49886986, now seen corresponding path program 1 times [2019-08-05 10:12:34,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:34,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:12:34,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:34,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:35,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:35,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:12:35,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:12:35,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:12:35,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:12:35,032 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand 7 states. [2019-08-05 10:12:35,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:35,290 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2019-08-05 10:12:35,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:12:35,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-05 10:12:35,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:35,293 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:12:35,293 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:12:35,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:12:35,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:12:35,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-08-05 10:12:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:12:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2019-08-05 10:12:35,302 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 14 [2019-08-05 10:12:35,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:35,302 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2019-08-05 10:12:35,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:12:35,302 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2019-08-05 10:12:35,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:12:35,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:35,303 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:35,303 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:35,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:35,304 INFO L82 PathProgramCache]: Analyzing trace with hash 533211751, now seen corresponding path program 1 times [2019-08-05 10:12:35,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:35,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:35,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:35,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:35,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:12:35,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:35,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:35,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:35,358 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand 3 states. [2019-08-05 10:12:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:35,385 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2019-08-05 10:12:35,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:35,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-08-05 10:12:35,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:35,386 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:12:35,386 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:12:35,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:12:35,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:12:35,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:12:35,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:12:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2019-08-05 10:12:35,393 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 16 [2019-08-05 10:12:35,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:35,393 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2019-08-05 10:12:35,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:35,394 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2019-08-05 10:12:35,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:12:35,395 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:35,395 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:35,395 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:35,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:35,396 INFO L82 PathProgramCache]: Analyzing trace with hash 850522377, now seen corresponding path program 1 times [2019-08-05 10:12:35,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:35,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:12:35,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:35,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:35,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:35,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:35,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:12:35,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:12:35,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:12:35,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:12:35,894 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand 11 states. [2019-08-05 10:12:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:36,449 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2019-08-05 10:12:36,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:12:36,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-08-05 10:12:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:36,452 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:12:36,453 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:12:36,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:12:36,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:12:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2019-08-05 10:12:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:12:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2019-08-05 10:12:36,461 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 25 [2019-08-05 10:12:36,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:36,461 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2019-08-05 10:12:36,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:12:36,461 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2019-08-05 10:12:36,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:12:36,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:36,463 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:36,463 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:36,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:36,464 INFO L82 PathProgramCache]: Analyzing trace with hash -914434510, now seen corresponding path program 2 times [2019-08-05 10:12:36,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:36,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:12:36,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:36,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:36,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:36,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:36,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:12:36,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:12:36,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:12:36,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:12:36,847 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand 13 states. [2019-08-05 10:12:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:37,453 INFO L93 Difference]: Finished difference Result 123 states and 150 transitions. [2019-08-05 10:12:37,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:12:37,454 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-08-05 10:12:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:37,455 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:12:37,455 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:12:37,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:12:37,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:12:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 102. [2019-08-05 10:12:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:12:37,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2019-08-05 10:12:37,477 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 131 transitions. Word has length 31 [2019-08-05 10:12:37,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:37,477 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 131 transitions. [2019-08-05 10:12:37,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:12:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 131 transitions. [2019-08-05 10:12:37,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:12:37,479 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:37,479 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:37,479 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:37,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:37,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1717303098, now seen corresponding path program 3 times [2019-08-05 10:12:37,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:37,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:12:37,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:12:37,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:12:37,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:12:37,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:12:37,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:12:37,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:12:37,595 INFO L87 Difference]: Start difference. First operand 102 states and 131 transitions. Second operand 3 states. [2019-08-05 10:12:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:37,702 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2019-08-05 10:12:37,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:12:37,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-08-05 10:12:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:37,704 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:12:37,704 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:12:37,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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:12:37,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:12:37,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-08-05 10:12:37,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:12:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2019-08-05 10:12:37,712 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 140 transitions. Word has length 32 [2019-08-05 10:12:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:37,712 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 140 transitions. [2019-08-05 10:12:37,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:12:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 140 transitions. [2019-08-05 10:12:37,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:12:37,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:37,714 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:37,714 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:37,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:37,714 INFO L82 PathProgramCache]: Analyzing trace with hash 47131281, now seen corresponding path program 1 times [2019-08-05 10:12:37,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:37,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:12:37,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:38,047 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:12:38,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:38,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:38,229 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:38,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:38,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:12:38,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:12:38,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:12:38,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:12:38,270 INFO L87 Difference]: Start difference. First operand 110 states and 140 transitions. Second operand 12 states. [2019-08-05 10:12:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:38,716 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2019-08-05 10:12:38,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:12:38,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-08-05 10:12:38,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:38,719 INFO L225 Difference]: With dead ends: 134 [2019-08-05 10:12:38,719 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 10:12:38,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:12:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 10:12:38,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 122. [2019-08-05 10:12:38,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 10:12:38,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 154 transitions. [2019-08-05 10:12:38,727 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 154 transitions. Word has length 33 [2019-08-05 10:12:38,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:38,728 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 154 transitions. [2019-08-05 10:12:38,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:12:38,728 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 154 transitions. [2019-08-05 10:12:38,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:12:38,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:38,730 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:38,730 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:38,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:38,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1386427974, now seen corresponding path program 2 times [2019-08-05 10:12:38,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:38,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:12:38,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:38,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:38,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:38,904 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:38,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:39,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:39,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:12:39,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:12:39,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:12:39,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:12:39,158 INFO L87 Difference]: Start difference. First operand 122 states and 154 transitions. Second operand 14 states. [2019-08-05 10:12:39,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:39,571 INFO L93 Difference]: Finished difference Result 174 states and 215 transitions. [2019-08-05 10:12:39,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:12:39,572 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2019-08-05 10:12:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:39,574 INFO L225 Difference]: With dead ends: 174 [2019-08-05 10:12:39,574 INFO L226 Difference]: Without dead ends: 174 [2019-08-05 10:12:39,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:12:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-05 10:12:39,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 103. [2019-08-05 10:12:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:12:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 132 transitions. [2019-08-05 10:12:39,584 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 132 transitions. Word has length 39 [2019-08-05 10:12:39,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:39,585 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 132 transitions. [2019-08-05 10:12:39,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:12:39,585 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 132 transitions. [2019-08-05 10:12:39,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:12:39,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:39,587 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:39,587 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:39,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:39,587 INFO L82 PathProgramCache]: Analyzing trace with hash 64752799, now seen corresponding path program 3 times [2019-08-05 10:12:39,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:39,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:12:39,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:39,660 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,206 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:40,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:40,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:12:40,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:12:40,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:12:40,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:12:40,209 INFO L87 Difference]: Start difference. First operand 103 states and 132 transitions. Second operand 14 states. [2019-08-05 10:12:40,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:40,633 INFO L93 Difference]: Finished difference Result 149 states and 181 transitions. [2019-08-05 10:12:40,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:12:40,634 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2019-08-05 10:12:40,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:40,636 INFO L225 Difference]: With dead ends: 149 [2019-08-05 10:12:40,636 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 10:12:40,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:12:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 10:12:40,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2019-08-05 10:12:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 10:12:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 176 transitions. [2019-08-05 10:12:40,641 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 176 transitions. Word has length 39 [2019-08-05 10:12:40,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:40,642 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 176 transitions. [2019-08-05 10:12:40,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:12:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 176 transitions. [2019-08-05 10:12:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:12:40,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:40,644 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:12:40,644 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:40,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:40,645 INFO L82 PathProgramCache]: Analyzing trace with hash 733629768, now seen corresponding path program 4 times [2019-08-05 10:12:40,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:40,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:12:40,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:40,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:40,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:41,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:41,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:12:41,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:12:41,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:12:41,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:12:41,108 INFO L87 Difference]: Start difference. First operand 144 states and 176 transitions. Second operand 14 states. [2019-08-05 10:12:41,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:41,533 INFO L93 Difference]: Finished difference Result 166 states and 198 transitions. [2019-08-05 10:12:41,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:12:41,533 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2019-08-05 10:12:41,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:41,536 INFO L225 Difference]: With dead ends: 166 [2019-08-05 10:12:41,536 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 10:12:41,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:12:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 10:12:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 143. [2019-08-05 10:12:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:12:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 173 transitions. [2019-08-05 10:12:41,541 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 173 transitions. Word has length 41 [2019-08-05 10:12:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:41,541 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 173 transitions. [2019-08-05 10:12:41,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:12:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 173 transitions. [2019-08-05 10:12:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:12:41,543 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:41,544 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:12:41,544 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:41,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:41,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2039299156, now seen corresponding path program 5 times [2019-08-05 10:12:41,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:41,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:12:41,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:41,699 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:41,914 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:12:42,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,226 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,228 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:42,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:42,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:12:42,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:12:42,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:12:42,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:12:42,452 INFO L87 Difference]: Start difference. First operand 143 states and 173 transitions. Second operand 18 states. [2019-08-05 10:12:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:42,997 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2019-08-05 10:12:42,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:12:42,998 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-08-05 10:12:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:43,000 INFO L225 Difference]: With dead ends: 168 [2019-08-05 10:12:43,000 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 10:12:43,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:12:43,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 10:12:43,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 158. [2019-08-05 10:12:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 10:12:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 189 transitions. [2019-08-05 10:12:43,006 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 189 transitions. Word has length 50 [2019-08-05 10:12:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:43,006 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 189 transitions. [2019-08-05 10:12:43,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:12:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 189 transitions. [2019-08-05 10:12:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:12:43,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:43,007 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:12:43,008 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:43,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:43,008 INFO L82 PathProgramCache]: Analyzing trace with hash -661837813, now seen corresponding path program 6 times [2019-08-05 10:12:43,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:43,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:12:43,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:43,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:43,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:43,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:43,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:43,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:43,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:12:43,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:12:43,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:12:43,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:12:43,307 INFO L87 Difference]: Start difference. First operand 158 states and 189 transitions. Second operand 18 states. [2019-08-05 10:12:43,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:43,744 INFO L93 Difference]: Finished difference Result 195 states and 229 transitions. [2019-08-05 10:12:43,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:12:43,744 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-08-05 10:12:43,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:43,746 INFO L225 Difference]: With dead ends: 195 [2019-08-05 10:12:43,746 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 10:12:43,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:12:43,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 10:12:43,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 153. [2019-08-05 10:12:43,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 10:12:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 184 transitions. [2019-08-05 10:12:43,753 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 184 transitions. Word has length 52 [2019-08-05 10:12:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:43,753 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 184 transitions. [2019-08-05 10:12:43,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:12:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 184 transitions. [2019-08-05 10:12:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:12:43,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:43,754 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:12:43,755 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:43,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:43,755 INFO L82 PathProgramCache]: Analyzing trace with hash 854146365, now seen corresponding path program 7 times [2019-08-05 10:12:43,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:43,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:12:43,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:43,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:43,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:43,935 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:43,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:44,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:44,114 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:44,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:44,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:12:44,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:12:44,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:12:44,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:12:44,116 INFO L87 Difference]: Start difference. First operand 153 states and 184 transitions. Second operand 20 states. [2019-08-05 10:12:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:44,963 INFO L93 Difference]: Finished difference Result 221 states and 262 transitions. [2019-08-05 10:12:44,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:12:44,964 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-08-05 10:12:44,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:44,965 INFO L225 Difference]: With dead ends: 221 [2019-08-05 10:12:44,965 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 10:12:44,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=286, Invalid=974, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:12:44,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 10:12:44,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 200. [2019-08-05 10:12:44,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 10:12:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 243 transitions. [2019-08-05 10:12:44,971 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 243 transitions. Word has length 56 [2019-08-05 10:12:44,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:44,971 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 243 transitions. [2019-08-05 10:12:44,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:12:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 243 transitions. [2019-08-05 10:12:44,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:12:44,972 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:44,972 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:12:44,973 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:44,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:44,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1067533236, now seen corresponding path program 8 times [2019-08-05 10:12:44,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:45,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:12:45,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:45,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:45,366 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:12:45,960 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:12:46,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:46,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:46,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:46,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:46,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:46,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:12:46,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:12:46,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:12:46,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:12:46,205 INFO L87 Difference]: Start difference. First operand 200 states and 243 transitions. Second operand 20 states. [2019-08-05 10:12:46,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:46,994 INFO L93 Difference]: Finished difference Result 272 states and 326 transitions. [2019-08-05 10:12:46,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:12:46,994 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2019-08-05 10:12:46,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:46,997 INFO L225 Difference]: With dead ends: 272 [2019-08-05 10:12:46,997 INFO L226 Difference]: Without dead ends: 272 [2019-08-05 10:12:46,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:12:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-08-05 10:12:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 188. [2019-08-05 10:12:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-08-05 10:12:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 230 transitions. [2019-08-05 10:12:47,004 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 230 transitions. Word has length 58 [2019-08-05 10:12:47,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:47,004 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 230 transitions. [2019-08-05 10:12:47,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:12:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 230 transitions. [2019-08-05 10:12:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:12:47,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:47,005 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-08-05 10:12:47,006 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:47,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:47,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1153697060, now seen corresponding path program 9 times [2019-08-05 10:12:47,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:47,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:12:47,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:47,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,195 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,196 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:47,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:47,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:12:47,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:12:47,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:12:47,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:12:47,419 INFO L87 Difference]: Start difference. First operand 188 states and 230 transitions. Second operand 19 states. [2019-08-05 10:12:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:48,102 INFO L93 Difference]: Finished difference Result 224 states and 265 transitions. [2019-08-05 10:12:48,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:12:48,103 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2019-08-05 10:12:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:48,105 INFO L225 Difference]: With dead ends: 224 [2019-08-05 10:12:48,105 INFO L226 Difference]: Without dead ends: 224 [2019-08-05 10:12:48,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=241, Invalid=881, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:12:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-08-05 10:12:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 162. [2019-08-05 10:12:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-08-05 10:12:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 196 transitions. [2019-08-05 10:12:48,111 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 196 transitions. Word has length 58 [2019-08-05 10:12:48,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:48,111 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 196 transitions. [2019-08-05 10:12:48,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:12:48,111 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 196 transitions. [2019-08-05 10:12:48,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:12:48,112 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:48,112 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-08-05 10:12:48,113 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:48,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:48,113 INFO L82 PathProgramCache]: Analyzing trace with hash -194972219, now seen corresponding path program 10 times [2019-08-05 10:12:48,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:48,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:12:48,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:48,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:48,461 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:12:48,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:48,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:48,576 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:48,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:48,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:48,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:48,757 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:48,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:48,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:12:48,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:12:48,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:12:48,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:12:48,759 INFO L87 Difference]: Start difference. First operand 162 states and 196 transitions. Second operand 21 states. [2019-08-05 10:12:49,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:49,539 INFO L93 Difference]: Finished difference Result 225 states and 270 transitions. [2019-08-05 10:12:49,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:12:49,539 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2019-08-05 10:12:49,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:49,541 INFO L225 Difference]: With dead ends: 225 [2019-08-05 10:12:49,542 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 10:12:49,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=287, Invalid=1119, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:12:49,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 10:12:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 143. [2019-08-05 10:12:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:12:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 174 transitions. [2019-08-05 10:12:49,547 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 174 transitions. Word has length 64 [2019-08-05 10:12:49,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:49,548 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 174 transitions. [2019-08-05 10:12:49,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:12:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 174 transitions. [2019-08-05 10:12:49,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:12:49,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:49,549 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-08-05 10:12:49,549 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:49,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:49,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1256208554, now seen corresponding path program 11 times [2019-08-05 10:12:49,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:49,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:12:49,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:49,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,695 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:49,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:50,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:50,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:50,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:50,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:50,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:12:50,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:12:50,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:12:50,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:12:50,320 INFO L87 Difference]: Start difference. First operand 143 states and 174 transitions. Second operand 21 states. [2019-08-05 10:12:50,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:50,941 INFO L93 Difference]: Finished difference Result 239 states and 280 transitions. [2019-08-05 10:12:50,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:12:50,941 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2019-08-05 10:12:50,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:50,943 INFO L225 Difference]: With dead ends: 239 [2019-08-05 10:12:50,943 INFO L226 Difference]: Without dead ends: 239 [2019-08-05 10:12:50,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=312, Invalid=1094, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:12:50,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-08-05 10:12:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 224. [2019-08-05 10:12:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-08-05 10:12:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 265 transitions. [2019-08-05 10:12:50,949 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 265 transitions. Word has length 64 [2019-08-05 10:12:50,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:50,949 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 265 transitions. [2019-08-05 10:12:50,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:12:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 265 transitions. [2019-08-05 10:12:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:12:50,950 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:50,951 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-08-05 10:12:50,951 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:50,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:50,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1509828575, now seen corresponding path program 12 times [2019-08-05 10:12:50,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:50,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:12:50,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:51,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,149 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:51,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:51,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:12:51,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:12:51,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:12:51,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:12:51,357 INFO L87 Difference]: Start difference. First operand 224 states and 265 transitions. Second operand 21 states. [2019-08-05 10:12:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:51,988 INFO L93 Difference]: Finished difference Result 299 states and 347 transitions. [2019-08-05 10:12:51,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:12:51,988 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-08-05 10:12:51,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:51,991 INFO L225 Difference]: With dead ends: 299 [2019-08-05 10:12:51,991 INFO L226 Difference]: Without dead ends: 299 [2019-08-05 10:12:51,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=316, Invalid=1166, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:12:51,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-08-05 10:12:51,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 184. [2019-08-05 10:12:51,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 10:12:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 220 transitions. [2019-08-05 10:12:51,997 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 220 transitions. Word has length 66 [2019-08-05 10:12:51,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:51,998 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 220 transitions. [2019-08-05 10:12:51,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:12:51,998 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2019-08-05 10:12:51,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:12:51,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:51,999 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2019-08-05 10:12:51,999 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:51,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:51,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1033657709, now seen corresponding path program 13 times [2019-08-05 10:12:52,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:52,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:12:52,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:52,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,407 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2019-08-05 10:12:52,577 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,578 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:52,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:52,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:12:52,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:12:52,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:12:52,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:12:52,756 INFO L87 Difference]: Start difference. First operand 184 states and 220 transitions. Second operand 21 states. [2019-08-05 10:12:53,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:53,491 INFO L93 Difference]: Finished difference Result 224 states and 262 transitions. [2019-08-05 10:12:53,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:12:53,494 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-08-05 10:12:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:53,496 INFO L225 Difference]: With dead ends: 224 [2019-08-05 10:12:53,496 INFO L226 Difference]: Without dead ends: 224 [2019-08-05 10:12:53,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=287, Invalid=1119, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:12:53,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-08-05 10:12:53,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 183. [2019-08-05 10:12:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-08-05 10:12:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 217 transitions. [2019-08-05 10:12:53,501 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 217 transitions. Word has length 66 [2019-08-05 10:12:53,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:53,501 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 217 transitions. [2019-08-05 10:12:53,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:12:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 217 transitions. [2019-08-05 10:12:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:12:53,502 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:53,502 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1] [2019-08-05 10:12:53,503 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:53,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:53,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1159179113, now seen corresponding path program 14 times [2019-08-05 10:12:53,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:53,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:12:53,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:53,656 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:12:53,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,869 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:12:53,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:53,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,202 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:54,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:54,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:12:54,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:12:54,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:12:54,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:12:54,269 INFO L87 Difference]: Start difference. First operand 183 states and 217 transitions. Second operand 25 states. [2019-08-05 10:12:55,132 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-08-05 10:12:56,419 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-08-05 10:12:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:56,773 INFO L93 Difference]: Finished difference Result 294 states and 339 transitions. [2019-08-05 10:12:56,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:12:56,773 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 75 [2019-08-05 10:12:56,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:56,775 INFO L225 Difference]: With dead ends: 294 [2019-08-05 10:12:56,776 INFO L226 Difference]: Without dead ends: 294 [2019-08-05 10:12:56,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=435, Invalid=1545, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:12:56,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-08-05 10:12:56,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 274. [2019-08-05 10:12:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-08-05 10:12:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 319 transitions. [2019-08-05 10:12:56,783 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 319 transitions. Word has length 75 [2019-08-05 10:12:56,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:56,784 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 319 transitions. [2019-08-05 10:12:56,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:12:56,784 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 319 transitions. [2019-08-05 10:12:56,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:12:56,785 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:56,785 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1] [2019-08-05 10:12:56,785 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:56,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:56,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1151372178, now seen corresponding path program 15 times [2019-08-05 10:12:56,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:56,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:12:56,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:56,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:56,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:57,219 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:57,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:57,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:12:57,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:12:57,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:12:57,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:12:57,220 INFO L87 Difference]: Start difference. First operand 274 states and 319 transitions. Second operand 25 states. [2019-08-05 10:12:59,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:12:59,068 INFO L93 Difference]: Finished difference Result 333 states and 381 transitions. [2019-08-05 10:12:59,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:12:59,069 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2019-08-05 10:12:59,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:12:59,071 INFO L225 Difference]: With dead ends: 333 [2019-08-05 10:12:59,071 INFO L226 Difference]: Without dead ends: 333 [2019-08-05 10:12:59,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=440, Invalid=1630, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:12:59,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-08-05 10:12:59,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 198. [2019-08-05 10:12:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-08-05 10:12:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 233 transitions. [2019-08-05 10:12:59,077 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 233 transitions. Word has length 77 [2019-08-05 10:12:59,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:12:59,077 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 233 transitions. [2019-08-05 10:12:59,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:12:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 233 transitions. [2019-08-05 10:12:59,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:12:59,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:12:59,078 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1] [2019-08-05 10:12:59,078 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:12:59,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:12:59,079 INFO L82 PathProgramCache]: Analyzing trace with hash -348641824, now seen corresponding path program 16 times [2019-08-05 10:12:59,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:12:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:12:59,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:12:59,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:12:59,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:12:59,610 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:12:59,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:12:59,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:12:59,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:12:59,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:12:59,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:12:59,611 INFO L87 Difference]: Start difference. First operand 198 states and 233 transitions. Second operand 25 states. [2019-08-05 10:13:00,777 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-08-05 10:13:00,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:00,944 INFO L93 Difference]: Finished difference Result 253 states and 293 transitions. [2019-08-05 10:13:00,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:13:00,945 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2019-08-05 10:13:00,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:00,947 INFO L225 Difference]: With dead ends: 253 [2019-08-05 10:13:00,947 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 10:13:00,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=408, Invalid=1572, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:13:00,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 10:13:00,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 193. [2019-08-05 10:13:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-08-05 10:13:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 228 transitions. [2019-08-05 10:13:00,951 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 228 transitions. Word has length 77 [2019-08-05 10:13:00,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:00,952 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 228 transitions. [2019-08-05 10:13:00,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:13:00,952 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 228 transitions. [2019-08-05 10:13:00,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:13:00,952 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:00,952 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1] [2019-08-05 10:13:00,953 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:00,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:00,953 INFO L82 PathProgramCache]: Analyzing trace with hash -645445486, now seen corresponding path program 17 times [2019-08-05 10:13:00,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:00,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:13:00,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:01,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,378 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,598 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 269 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:01,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:01,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:13:01,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:13:01,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:13:01,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:13:01,760 INFO L87 Difference]: Start difference. First operand 193 states and 228 transitions. Second operand 27 states. [2019-08-05 10:13:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:02,707 INFO L93 Difference]: Finished difference Result 347 states and 402 transitions. [2019-08-05 10:13:02,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:13:02,708 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 81 [2019-08-05 10:13:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:02,713 INFO L225 Difference]: With dead ends: 347 [2019-08-05 10:13:02,713 INFO L226 Difference]: Without dead ends: 347 [2019-08-05 10:13:02,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=544, Invalid=2006, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:13:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-08-05 10:13:02,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 316. [2019-08-05 10:13:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-08-05 10:13:02,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 373 transitions. [2019-08-05 10:13:02,719 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 373 transitions. Word has length 81 [2019-08-05 10:13:02,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:02,719 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 373 transitions. [2019-08-05 10:13:02,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:13:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 373 transitions. [2019-08-05 10:13:02,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:13:02,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:02,720 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1] [2019-08-05 10:13:02,721 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:02,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:02,721 INFO L82 PathProgramCache]: Analyzing trace with hash -3693061, now seen corresponding path program 18 times [2019-08-05 10:13:02,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:02,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:13:02,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:02,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:03,125 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:13:03,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:03,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:03,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:03,690 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:13:03,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:03,815 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:03,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:03,895 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:04,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:04,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:13:04,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:13:04,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:13:04,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:13:04,003 INFO L87 Difference]: Start difference. First operand 316 states and 373 transitions. Second operand 27 states. [2019-08-05 10:13:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:05,096 INFO L93 Difference]: Finished difference Result 420 states and 489 transitions. [2019-08-05 10:13:05,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:13:05,097 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2019-08-05 10:13:05,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:05,099 INFO L225 Difference]: With dead ends: 420 [2019-08-05 10:13:05,099 INFO L226 Difference]: Without dead ends: 420 [2019-08-05 10:13:05,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=545, Invalid=2107, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:13:05,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-08-05 10:13:05,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 240. [2019-08-05 10:13:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-08-05 10:13:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 287 transitions. [2019-08-05 10:13:05,105 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 287 transitions. Word has length 83 [2019-08-05 10:13:05,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:05,105 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 287 transitions. [2019-08-05 10:13:05,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:13:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 287 transitions. [2019-08-05 10:13:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:13:05,106 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:05,107 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 7, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1] [2019-08-05 10:13:05,107 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:05,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:05,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1226191415, now seen corresponding path program 19 times [2019-08-05 10:13:05,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:05,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:13:05,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:05,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,565 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,741 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:05,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:05,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:13:05,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:13:05,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:13:05,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:13:05,825 INFO L87 Difference]: Start difference. First operand 240 states and 287 transitions. Second operand 27 states. [2019-08-05 10:13:06,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:06,721 INFO L93 Difference]: Finished difference Result 330 states and 390 transitions. [2019-08-05 10:13:06,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:13:06,722 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 83 [2019-08-05 10:13:06,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:06,724 INFO L225 Difference]: With dead ends: 330 [2019-08-05 10:13:06,724 INFO L226 Difference]: Without dead ends: 330 [2019-08-05 10:13:06,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=496, Invalid=1954, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:13:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-08-05 10:13:06,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 228. [2019-08-05 10:13:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-08-05 10:13:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 274 transitions. [2019-08-05 10:13:06,730 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 274 transitions. Word has length 83 [2019-08-05 10:13:06,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:06,731 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 274 transitions. [2019-08-05 10:13:06,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:13:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 274 transitions. [2019-08-05 10:13:06,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:13:06,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:06,732 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2019-08-05 10:13:06,732 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:06,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:06,732 INFO L82 PathProgramCache]: Analyzing trace with hash 847545585, now seen corresponding path program 20 times [2019-08-05 10:13:06,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:06,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:13:06,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:06,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,943 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:06,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 274 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:07,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:07,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:13:07,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:13:07,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:13:07,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:13:07,152 INFO L87 Difference]: Start difference. First operand 228 states and 274 transitions. Second operand 26 states. [2019-08-05 10:13:08,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:08,112 INFO L93 Difference]: Finished difference Result 282 states and 329 transitions. [2019-08-05 10:13:08,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:13:08,113 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 83 [2019-08-05 10:13:08,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:08,115 INFO L225 Difference]: With dead ends: 282 [2019-08-05 10:13:08,115 INFO L226 Difference]: Without dead ends: 282 [2019-08-05 10:13:08,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=459, Invalid=1893, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:13:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-08-05 10:13:08,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 202. [2019-08-05 10:13:08,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 10:13:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 240 transitions. [2019-08-05 10:13:08,120 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 240 transitions. Word has length 83 [2019-08-05 10:13:08,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:08,121 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 240 transitions. [2019-08-05 10:13:08,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:13:08,121 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 240 transitions. [2019-08-05 10:13:08,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:13:08,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:08,122 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2019-08-05 10:13:08,122 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:08,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:08,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1216142362, now seen corresponding path program 21 times [2019-08-05 10:13:08,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:08,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:13:08,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:08,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,667 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,667 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:08,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:08,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:13:08,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:13:08,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:13:08,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:13:08,781 INFO L87 Difference]: Start difference. First operand 202 states and 240 transitions. Second operand 28 states. [2019-08-05 10:13:09,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:09,931 INFO L93 Difference]: Finished difference Result 283 states and 334 transitions. [2019-08-05 10:13:09,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:13:09,932 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 89 [2019-08-05 10:13:09,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:09,934 INFO L225 Difference]: With dead ends: 283 [2019-08-05 10:13:09,934 INFO L226 Difference]: Without dead ends: 283 [2019-08-05 10:13:09,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=524, Invalid=2232, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:13:09,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-08-05 10:13:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 183. [2019-08-05 10:13:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-08-05 10:13:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 218 transitions. [2019-08-05 10:13:09,940 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 218 transitions. Word has length 89 [2019-08-05 10:13:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:09,940 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 218 transitions. [2019-08-05 10:13:09,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:13:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 218 transitions. [2019-08-05 10:13:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:13:09,941 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:09,941 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2019-08-05 10:13:09,941 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:09,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:09,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1627644161, now seen corresponding path program 22 times [2019-08-05 10:13:09,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:09,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:13:09,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:10,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,294 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:13:10,458 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:13:10,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,679 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:10,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:11,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:11,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:13:11,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:13:11,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:13:11,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:13:11,161 INFO L87 Difference]: Start difference. First operand 183 states and 218 transitions. Second operand 28 states. [2019-08-05 10:13:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:12,112 INFO L93 Difference]: Finished difference Result 331 states and 381 transitions. [2019-08-05 10:13:12,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:13:12,113 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 89 [2019-08-05 10:13:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:12,115 INFO L225 Difference]: With dead ends: 331 [2019-08-05 10:13:12,115 INFO L226 Difference]: Without dead ends: 331 [2019-08-05 10:13:12,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=578, Invalid=2178, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:13:12,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-08-05 10:13:12,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 306. [2019-08-05 10:13:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-08-05 10:13:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 356 transitions. [2019-08-05 10:13:12,121 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 356 transitions. Word has length 89 [2019-08-05 10:13:12,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:12,122 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 356 transitions. [2019-08-05 10:13:12,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:13:12,122 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 356 transitions. [2019-08-05 10:13:12,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:13:12,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:12,123 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2019-08-05 10:13:12,123 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:12,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:12,124 INFO L82 PathProgramCache]: Analyzing trace with hash 832635752, now seen corresponding path program 23 times [2019-08-05 10:13:12,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:12,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:13:12,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:12,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,485 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:13:12,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,696 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,913 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,950 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:12,950 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:13,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:13,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:13:13,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:13:13,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:13:13,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:13:13,044 INFO L87 Difference]: Start difference. First operand 306 states and 356 transitions. Second operand 28 states. [2019-08-05 10:13:14,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:14,073 INFO L93 Difference]: Finished difference Result 438 states and 500 transitions. [2019-08-05 10:13:14,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:13:14,074 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 91 [2019-08-05 10:13:14,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:14,076 INFO L225 Difference]: With dead ends: 438 [2019-08-05 10:13:14,077 INFO L226 Difference]: Without dead ends: 438 [2019-08-05 10:13:14,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=579, Invalid=2283, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:13:14,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-08-05 10:13:14,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 264. [2019-08-05 10:13:14,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-08-05 10:13:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 309 transitions. [2019-08-05 10:13:14,083 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 309 transitions. Word has length 91 [2019-08-05 10:13:14,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:14,084 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 309 transitions. [2019-08-05 10:13:14,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:13:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 309 transitions. [2019-08-05 10:13:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:13:14,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:14,085 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2019-08-05 10:13:14,085 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:14,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:14,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1656585526, now seen corresponding path program 24 times [2019-08-05 10:13:14,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:14,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:13:14,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:14,226 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,565 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:14,801 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:14,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:14,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:13:14,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:13:14,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:13:14,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:13:14,803 INFO L87 Difference]: Start difference. First operand 264 states and 309 transitions. Second operand 28 states. [2019-08-05 10:13:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:16,068 INFO L93 Difference]: Finished difference Result 357 states and 411 transitions. [2019-08-05 10:13:16,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:13:16,068 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 91 [2019-08-05 10:13:16,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:16,070 INFO L225 Difference]: With dead ends: 357 [2019-08-05 10:13:16,070 INFO L226 Difference]: Without dead ends: 357 [2019-08-05 10:13:16,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=565, Invalid=2297, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:13:16,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-08-05 10:13:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 224. [2019-08-05 10:13:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-08-05 10:13:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 264 transitions. [2019-08-05 10:13:16,075 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 264 transitions. Word has length 91 [2019-08-05 10:13:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:16,076 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 264 transitions. [2019-08-05 10:13:16,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:13:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 264 transitions. [2019-08-05 10:13:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:13:16,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:16,077 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 7, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1] [2019-08-05 10:13:16,077 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:16,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:16,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2132756392, now seen corresponding path program 25 times [2019-08-05 10:13:16,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:16,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:13:16,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:16,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:16,425 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:13:17,018 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:13:17,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,444 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,444 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,509 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:17,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:17,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:13:17,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:13:17,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:13:17,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:13:17,726 INFO L87 Difference]: Start difference. First operand 224 states and 264 transitions. Second operand 28 states. [2019-08-05 10:13:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:18,734 INFO L93 Difference]: Finished difference Result 282 states and 326 transitions. [2019-08-05 10:13:18,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:13:18,734 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 91 [2019-08-05 10:13:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:18,736 INFO L225 Difference]: With dead ends: 282 [2019-08-05 10:13:18,737 INFO L226 Difference]: Without dead ends: 282 [2019-08-05 10:13:18,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=524, Invalid=2232, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:13:18,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-08-05 10:13:18,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 223. [2019-08-05 10:13:18,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-08-05 10:13:18,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 261 transitions. [2019-08-05 10:13:18,742 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 261 transitions. Word has length 91 [2019-08-05 10:13:18,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:18,742 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 261 transitions. [2019-08-05 10:13:18,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:13:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 261 transitions. [2019-08-05 10:13:18,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:13:18,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:18,743 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 7, 7, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1] [2019-08-05 10:13:18,743 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:18,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:18,743 INFO L82 PathProgramCache]: Analyzing trace with hash 179039732, now seen corresponding path program 26 times [2019-08-05 10:13:18,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:18,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:13:18,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:18,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,361 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:19,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:19,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:13:19,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:13:19,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:13:19,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:13:19,427 INFO L87 Difference]: Start difference. First operand 223 states and 261 transitions. Second operand 32 states. [2019-08-05 10:13:20,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:20,440 INFO L93 Difference]: Finished difference Result 398 states and 453 transitions. [2019-08-05 10:13:20,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:13:20,440 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 100 [2019-08-05 10:13:20,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:20,442 INFO L225 Difference]: With dead ends: 398 [2019-08-05 10:13:20,442 INFO L226 Difference]: Without dead ends: 398 [2019-08-05 10:13:20,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=742, Invalid=2798, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:13:20,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-08-05 10:13:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 356. [2019-08-05 10:13:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-08-05 10:13:20,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 410 transitions. [2019-08-05 10:13:20,448 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 410 transitions. Word has length 100 [2019-08-05 10:13:20,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:20,449 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 410 transitions. [2019-08-05 10:13:20,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:13:20,449 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 410 transitions. [2019-08-05 10:13:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:13:20,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:20,450 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1] [2019-08-05 10:13:20,450 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:20,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:20,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2001904149, now seen corresponding path program 27 times [2019-08-05 10:13:20,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:20,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:13:20,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:20,538 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:20,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:20,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:20,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:20,891 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:20,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:20,975 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,125 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 419 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:21,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:21,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:13:21,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:13:21,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:13:21,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=791, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:13:21,334 INFO L87 Difference]: Start difference. First operand 356 states and 410 transitions. Second operand 32 states. [2019-08-05 10:13:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:22,455 INFO L93 Difference]: Finished difference Result 508 states and 575 transitions. [2019-08-05 10:13:22,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:13:22,455 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 102 [2019-08-05 10:13:22,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:22,459 INFO L225 Difference]: With dead ends: 508 [2019-08-05 10:13:22,459 INFO L226 Difference]: Without dead ends: 508 [2019-08-05 10:13:22,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=744, Invalid=2916, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:13:22,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-08-05 10:13:22,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 314. [2019-08-05 10:13:22,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-08-05 10:13:22,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 363 transitions. [2019-08-05 10:13:22,465 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 363 transitions. Word has length 102 [2019-08-05 10:13:22,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:22,465 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 363 transitions. [2019-08-05 10:13:22,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:13:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 363 transitions. [2019-08-05 10:13:22,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:13:22,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:22,467 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1] [2019-08-05 10:13:22,467 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:22,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:22,467 INFO L82 PathProgramCache]: Analyzing trace with hash -164735139, now seen corresponding path program 28 times [2019-08-05 10:13:22,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:22,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:13:22,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:22,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:22,821 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:13:23,397 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:13:23,640 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:23,963 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2019-08-05 10:13:24,197 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:13:24,199 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,199 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,448 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2019-08-05 10:13:24,492 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,641 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,641 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 419 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:24,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:24,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:13:24,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:13:24,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:13:24,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=791, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:13:24,792 INFO L87 Difference]: Start difference. First operand 314 states and 363 transitions. Second operand 32 states. [2019-08-05 10:13:26,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:26,169 INFO L93 Difference]: Finished difference Result 391 states and 445 transitions. [2019-08-05 10:13:26,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:13:26,170 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 102 [2019-08-05 10:13:26,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:26,173 INFO L225 Difference]: With dead ends: 391 [2019-08-05 10:13:26,173 INFO L226 Difference]: Without dead ends: 391 [2019-08-05 10:13:26,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=730, Invalid=2930, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:13:26,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-08-05 10:13:26,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 238. [2019-08-05 10:13:26,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-08-05 10:13:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 277 transitions. [2019-08-05 10:13:26,178 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 277 transitions. Word has length 102 [2019-08-05 10:13:26,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:26,178 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 277 transitions. [2019-08-05 10:13:26,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:13:26,178 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 277 transitions. [2019-08-05 10:13:26,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:13:26,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:26,180 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1] [2019-08-05 10:13:26,180 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:26,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:26,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1664749141, now seen corresponding path program 29 times [2019-08-05 10:13:26,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:26,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:13:26,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:26,325 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,597 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 419 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:26,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:26,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:13:26,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:13:26,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:13:26,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=791, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:13:26,755 INFO L87 Difference]: Start difference. First operand 238 states and 277 transitions. Second operand 32 states. [2019-08-05 10:13:27,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:27,836 INFO L93 Difference]: Finished difference Result 311 states and 357 transitions. [2019-08-05 10:13:27,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:13:27,837 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 102 [2019-08-05 10:13:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:27,839 INFO L225 Difference]: With dead ends: 311 [2019-08-05 10:13:27,839 INFO L226 Difference]: Without dead ends: 311 [2019-08-05 10:13:27,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=686, Invalid=2854, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:13:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-08-05 10:13:27,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 233. [2019-08-05 10:13:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-08-05 10:13:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 272 transitions. [2019-08-05 10:13:27,843 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 272 transitions. Word has length 102 [2019-08-05 10:13:27,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:27,843 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 272 transitions. [2019-08-05 10:13:27,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:13:27,844 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 272 transitions. [2019-08-05 10:13:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:13:27,844 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:27,845 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 8, 8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1] [2019-08-05 10:13:27,845 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:27,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:27,845 INFO L82 PathProgramCache]: Analyzing trace with hash 878982877, now seen corresponding path program 30 times [2019-08-05 10:13:27,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:27,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:13:27,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:27,933 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:27,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,071 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,210 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:28,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:28,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:13:28,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:13:28,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:13:28,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=896, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:13:28,439 INFO L87 Difference]: Start difference. First operand 233 states and 272 transitions. Second operand 34 states. [2019-08-05 10:13:29,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:29,712 INFO L93 Difference]: Finished difference Result 487 states and 556 transitions. [2019-08-05 10:13:29,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:13:29,714 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 106 [2019-08-05 10:13:29,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:29,716 INFO L225 Difference]: With dead ends: 487 [2019-08-05 10:13:29,716 INFO L226 Difference]: Without dead ends: 487 [2019-08-05 10:13:29,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=887, Invalid=3403, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:13:29,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-08-05 10:13:29,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 398. [2019-08-05 10:13:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-08-05 10:13:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 464 transitions. [2019-08-05 10:13:29,723 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 464 transitions. Word has length 106 [2019-08-05 10:13:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:29,723 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 464 transitions. [2019-08-05 10:13:29,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:13:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 464 transitions. [2019-08-05 10:13:29,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:13:29,724 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:29,724 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1] [2019-08-05 10:13:29,725 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:29,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:29,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1266258324, now seen corresponding path program 31 times [2019-08-05 10:13:29,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:29,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:13:29,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:29,810 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:29,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:30,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:30,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:13:30,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:13:30,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:13:30,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:13:30,543 INFO L87 Difference]: Start difference. First operand 398 states and 464 transitions. Second operand 34 states. [2019-08-05 10:13:32,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:32,026 INFO L93 Difference]: Finished difference Result 595 states and 683 transitions. [2019-08-05 10:13:32,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:13:32,027 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 108 [2019-08-05 10:13:32,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:32,030 INFO L225 Difference]: With dead ends: 595 [2019-08-05 10:13:32,030 INFO L226 Difference]: Without dead ends: 595 [2019-08-05 10:13:32,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=889, Invalid=3533, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:13:32,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-08-05 10:13:32,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 356. [2019-08-05 10:13:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-08-05 10:13:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 417 transitions. [2019-08-05 10:13:32,035 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 417 transitions. Word has length 108 [2019-08-05 10:13:32,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:32,036 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 417 transitions. [2019-08-05 10:13:32,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:13:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 417 transitions. [2019-08-05 10:13:32,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:13:32,037 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:32,037 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1] [2019-08-05 10:13:32,037 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:32,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:32,037 INFO L82 PathProgramCache]: Analyzing trace with hash 388115846, now seen corresponding path program 32 times [2019-08-05 10:13:32,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:32,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:13:32,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:32,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,203 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,229 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,229 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,405 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,443 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,444 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:32,633 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:32,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:32,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:13:32,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:13:32,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:13:32,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:13:32,634 INFO L87 Difference]: Start difference. First operand 356 states and 417 transitions. Second operand 34 states. [2019-08-05 10:13:33,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:33,925 INFO L93 Difference]: Finished difference Result 478 states and 553 transitions. [2019-08-05 10:13:33,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:13:33,925 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 108 [2019-08-05 10:13:33,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:33,928 INFO L225 Difference]: With dead ends: 478 [2019-08-05 10:13:33,928 INFO L226 Difference]: Without dead ends: 478 [2019-08-05 10:13:33,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=867, Invalid=3555, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:13:33,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-08-05 10:13:33,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 280. [2019-08-05 10:13:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-08-05 10:13:33,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 331 transitions. [2019-08-05 10:13:33,934 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 331 transitions. Word has length 108 [2019-08-05 10:13:33,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:33,934 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 331 transitions. [2019-08-05 10:13:33,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:13:33,934 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 331 transitions. [2019-08-05 10:13:33,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:13:33,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:33,936 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 9, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1] [2019-08-05 10:13:33,936 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:33,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:33,936 INFO L82 PathProgramCache]: Analyzing trace with hash -834382508, now seen corresponding path program 33 times [2019-08-05 10:13:33,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:33,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:13:33,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:34,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,090 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,116 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,178 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,206 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,206 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:34,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:34,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:13:34,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:13:34,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:13:34,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:13:34,530 INFO L87 Difference]: Start difference. First operand 280 states and 331 transitions. Second operand 34 states. [2019-08-05 10:13:35,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:35,827 INFO L93 Difference]: Finished difference Result 388 states and 454 transitions. [2019-08-05 10:13:35,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:13:35,828 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 108 [2019-08-05 10:13:35,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:35,831 INFO L225 Difference]: With dead ends: 388 [2019-08-05 10:13:35,831 INFO L226 Difference]: Without dead ends: 388 [2019-08-05 10:13:35,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=800, Invalid=3360, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:13:35,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-08-05 10:13:35,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 268. [2019-08-05 10:13:35,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-08-05 10:13:35,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 318 transitions. [2019-08-05 10:13:35,836 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 318 transitions. Word has length 108 [2019-08-05 10:13:35,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:35,836 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 318 transitions. [2019-08-05 10:13:35,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:13:35,836 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 318 transitions. [2019-08-05 10:13:35,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:13:35,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:35,837 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 8, 8, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2019-08-05 10:13:35,837 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:35,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:35,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1239354492, now seen corresponding path program 34 times [2019-08-05 10:13:35,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:35,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:13:35,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:35,953 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:36,658 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:36,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:36,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:13:36,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:13:36,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:13:36,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:13:36,659 INFO L87 Difference]: Start difference. First operand 268 states and 318 transitions. Second operand 33 states. [2019-08-05 10:13:37,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:37,929 INFO L93 Difference]: Finished difference Result 340 states and 393 transitions. [2019-08-05 10:13:37,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:13:37,929 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 108 [2019-08-05 10:13:37,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:37,932 INFO L225 Difference]: With dead ends: 340 [2019-08-05 10:13:37,932 INFO L226 Difference]: Without dead ends: 340 [2019-08-05 10:13:37,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=748, Invalid=3284, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:13:37,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-08-05 10:13:37,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 242. [2019-08-05 10:13:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-08-05 10:13:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 284 transitions. [2019-08-05 10:13:37,937 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 284 transitions. Word has length 108 [2019-08-05 10:13:37,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:37,937 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 284 transitions. [2019-08-05 10:13:37,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:13:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 284 transitions. [2019-08-05 10:13:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:13:37,938 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:37,938 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 9, 9, 8, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2019-08-05 10:13:37,939 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:37,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:37,939 INFO L82 PathProgramCache]: Analyzing trace with hash 379080549, now seen corresponding path program 35 times [2019-08-05 10:13:37,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:37,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:13:37,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:38,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,123 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,434 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:38,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:38,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:13:38,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:13:38,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:13:38,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:13:38,574 INFO L87 Difference]: Start difference. First operand 242 states and 284 transitions. Second operand 35 states. [2019-08-05 10:13:39,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:39,903 INFO L93 Difference]: Finished difference Result 341 states and 398 transitions. [2019-08-05 10:13:39,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:13:39,903 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 114 [2019-08-05 10:13:39,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:39,906 INFO L225 Difference]: With dead ends: 341 [2019-08-05 10:13:39,906 INFO L226 Difference]: Without dead ends: 341 [2019-08-05 10:13:39,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=832, Invalid=3724, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:13:39,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-08-05 10:13:39,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 223. [2019-08-05 10:13:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-08-05 10:13:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 262 transitions. [2019-08-05 10:13:39,911 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 262 transitions. Word has length 114 [2019-08-05 10:13:39,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:39,911 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 262 transitions. [2019-08-05 10:13:39,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:13:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 262 transitions. [2019-08-05 10:13:39,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:13:39,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:39,913 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 9, 9, 8, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2019-08-05 10:13:39,913 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:39,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:39,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1830261322, now seen corresponding path program 36 times [2019-08-05 10:13:39,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:39,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:13:39,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:39,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:40,125 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:40,150 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:40,150 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:40,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:40,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:40,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:40,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:40,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:40,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:40,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:40,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:40,950 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:41,038 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:41,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:41,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:13:41,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:13:41,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:13:41,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=953, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:13:41,039 INFO L87 Difference]: Start difference. First operand 223 states and 262 transitions. Second operand 35 states. [2019-08-05 10:13:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:42,428 INFO L93 Difference]: Finished difference Result 472 states and 536 transitions. [2019-08-05 10:13:42,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:13:42,429 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 114 [2019-08-05 10:13:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:42,431 INFO L225 Difference]: With dead ends: 472 [2019-08-05 10:13:42,431 INFO L226 Difference]: Without dead ends: 472 [2019-08-05 10:13:42,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=929, Invalid=3627, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:13:42,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-08-05 10:13:42,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 388. [2019-08-05 10:13:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-08-05 10:13:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 447 transitions. [2019-08-05 10:13:42,438 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 447 transitions. Word has length 114 [2019-08-05 10:13:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:42,438 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 447 transitions. [2019-08-05 10:13:42,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:13:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 447 transitions. [2019-08-05 10:13:42,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:13:42,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:42,440 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 9, 8, 7, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2019-08-05 10:13:42,440 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:42,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:42,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1424079359, now seen corresponding path program 37 times [2019-08-05 10:13:42,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:42,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:13:42,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:42,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,952 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:42,997 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 0 proven. 566 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:43,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:43,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:13:43,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:13:43,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:13:43,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:13:43,085 INFO L87 Difference]: Start difference. First operand 388 states and 447 transitions. Second operand 35 states. [2019-08-05 10:13:44,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:44,414 INFO L93 Difference]: Finished difference Result 579 states and 655 transitions. [2019-08-05 10:13:44,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:13:44,414 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 116 [2019-08-05 10:13:44,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:44,417 INFO L225 Difference]: With dead ends: 579 [2019-08-05 10:13:44,417 INFO L226 Difference]: Without dead ends: 579 [2019-08-05 10:13:44,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=931, Invalid=3761, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:13:44,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-08-05 10:13:44,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 346. [2019-08-05 10:13:44,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-08-05 10:13:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 400 transitions. [2019-08-05 10:13:44,423 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 400 transitions. Word has length 116 [2019-08-05 10:13:44,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:44,423 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 400 transitions. [2019-08-05 10:13:44,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:13:44,423 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 400 transitions. [2019-08-05 10:13:44,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:13:44,424 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:44,424 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 9, 8, 7, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2019-08-05 10:13:44,424 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:44,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:44,424 INFO L82 PathProgramCache]: Analyzing trace with hash -424882189, now seen corresponding path program 38 times [2019-08-05 10:13:44,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:44,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:13:44,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:44,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:44,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:44,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:44,595 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:44,656 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:44,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:44,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:44,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:44,815 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:44,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:44,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:44,945 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:44,946 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 0 proven. 566 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:45,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:45,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:13:45,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:13:45,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:13:45,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:13:45,034 INFO L87 Difference]: Start difference. First operand 346 states and 400 transitions. Second operand 35 states. [2019-08-05 10:13:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:46,522 INFO L93 Difference]: Finished difference Result 496 states and 564 transitions. [2019-08-05 10:13:46,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:13:46,522 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 116 [2019-08-05 10:13:46,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:46,525 INFO L225 Difference]: With dead ends: 496 [2019-08-05 10:13:46,525 INFO L226 Difference]: Without dead ends: 496 [2019-08-05 10:13:46,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=909, Invalid=3783, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:13:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-08-05 10:13:46,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 304. [2019-08-05 10:13:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-08-05 10:13:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 353 transitions. [2019-08-05 10:13:46,531 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 353 transitions. Word has length 116 [2019-08-05 10:13:46,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:46,531 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 353 transitions. [2019-08-05 10:13:46,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:13:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 353 transitions. [2019-08-05 10:13:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:13:46,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:46,532 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 9, 8, 7, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2019-08-05 10:13:46,532 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:46,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:46,533 INFO L82 PathProgramCache]: Analyzing trace with hash 399067585, now seen corresponding path program 39 times [2019-08-05 10:13:46,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:46,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:13:46,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:46,630 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:46,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:46,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:46,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:46,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:46,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:46,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:46,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:46,911 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:46,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 0 proven. 566 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:47,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:47,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:13:47,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:13:47,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:13:47,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:13:47,335 INFO L87 Difference]: Start difference. First operand 304 states and 353 transitions. Second operand 35 states. [2019-08-05 10:13:48,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:48,655 INFO L93 Difference]: Finished difference Result 415 states and 475 transitions. [2019-08-05 10:13:48,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:13:48,656 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 116 [2019-08-05 10:13:48,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:48,658 INFO L225 Difference]: With dead ends: 415 [2019-08-05 10:13:48,658 INFO L226 Difference]: Without dead ends: 415 [2019-08-05 10:13:48,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=885, Invalid=3807, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:13:48,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-08-05 10:13:48,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 264. [2019-08-05 10:13:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-08-05 10:13:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 308 transitions. [2019-08-05 10:13:48,664 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 308 transitions. Word has length 116 [2019-08-05 10:13:48,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:48,664 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 308 transitions. [2019-08-05 10:13:48,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:13:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 308 transitions. [2019-08-05 10:13:48,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:13:48,665 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:48,665 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 9, 8, 7, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2019-08-05 10:13:48,665 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:48,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:48,665 INFO L82 PathProgramCache]: Analyzing trace with hash 875238451, now seen corresponding path program 40 times [2019-08-05 10:13:48,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:48,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:13:48,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:48,773 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:48,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:48,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:48,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:48,908 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:48,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:48,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:49,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:49,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:49,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:49,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:49,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:49,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 0 proven. 566 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:49,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:49,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:13:49,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:13:49,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:13:49,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:13:49,268 INFO L87 Difference]: Start difference. First operand 264 states and 308 transitions. Second operand 35 states. [2019-08-05 10:13:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:50,673 INFO L93 Difference]: Finished difference Result 340 states and 390 transitions. [2019-08-05 10:13:50,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:13:50,673 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 116 [2019-08-05 10:13:50,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:50,676 INFO L225 Difference]: With dead ends: 340 [2019-08-05 10:13:50,676 INFO L226 Difference]: Without dead ends: 340 [2019-08-05 10:13:50,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=832, Invalid=3724, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:13:50,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-08-05 10:13:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 263. [2019-08-05 10:13:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-08-05 10:13:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 305 transitions. [2019-08-05 10:13:50,680 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 305 transitions. Word has length 116 [2019-08-05 10:13:50,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:50,681 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 305 transitions. [2019-08-05 10:13:50,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:13:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 305 transitions. [2019-08-05 10:13:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 10:13:50,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:50,682 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 10, 9, 9, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:13:50,682 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:50,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:50,683 INFO L82 PathProgramCache]: Analyzing trace with hash -66712119, now seen corresponding path program 41 times [2019-08-05 10:13:50,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:50,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:13:50,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:50,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:50,989 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:51,490 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:13:51,800 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:13:51,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:52,204 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2019-08-05 10:13:52,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:52,502 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:52,986 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2019-08-05 10:13:53,630 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,759 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:53,989 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:53,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:53,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:13:53,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:13:53,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:13:53,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1194, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:13:53,990 INFO L87 Difference]: Start difference. First operand 263 states and 305 transitions. Second operand 39 states. [2019-08-05 10:13:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:55,382 INFO L93 Difference]: Finished difference Result 542 states and 611 transitions. [2019-08-05 10:13:55,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:13:55,383 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 125 [2019-08-05 10:13:55,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:55,386 INFO L225 Difference]: With dead ends: 542 [2019-08-05 10:13:55,386 INFO L226 Difference]: Without dead ends: 542 [2019-08-05 10:13:55,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1134, Invalid=4416, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:13:55,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-08-05 10:13:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 438. [2019-08-05 10:13:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-08-05 10:13:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 501 transitions. [2019-08-05 10:13:55,391 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 501 transitions. Word has length 125 [2019-08-05 10:13:55,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:55,391 INFO L475 AbstractCegarLoop]: Abstraction has 438 states and 501 transitions. [2019-08-05 10:13:55,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:13:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 501 transitions. [2019-08-05 10:13:55,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 10:13:55,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:55,392 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 10, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:13:55,392 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:55,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:55,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1797344846, now seen corresponding path program 42 times [2019-08-05 10:13:55,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:55,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:13:55,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:55,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,769 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:13:55,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:55,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:56,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:56,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:56,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:56,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:56,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:56,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:56,271 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:56,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:56,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:56,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:56,529 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 0 proven. 670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:56,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:56,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:13:56,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:13:56,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:13:56,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1196, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:13:56,531 INFO L87 Difference]: Start difference. First operand 438 states and 501 transitions. Second operand 39 states. [2019-08-05 10:13:58,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:58,142 INFO L93 Difference]: Finished difference Result 661 states and 743 transitions. [2019-08-05 10:13:58,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:13:58,143 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 127 [2019-08-05 10:13:58,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:58,146 INFO L225 Difference]: With dead ends: 661 [2019-08-05 10:13:58,146 INFO L226 Difference]: Without dead ends: 661 [2019-08-05 10:13:58,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1678 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1137, Invalid=4563, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:13:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-08-05 10:13:58,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 396. [2019-08-05 10:13:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-08-05 10:13:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 454 transitions. [2019-08-05 10:13:58,152 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 454 transitions. Word has length 127 [2019-08-05 10:13:58,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:58,152 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 454 transitions. [2019-08-05 10:13:58,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:13:58,152 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 454 transitions. [2019-08-05 10:13:58,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 10:13:58,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:58,154 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 10, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:13:58,154 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:58,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:58,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1946231680, now seen corresponding path program 43 times [2019-08-05 10:13:58,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:58,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:13:58,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:58,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:58,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:58,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:58,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:58,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:58,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:58,434 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:58,515 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:58,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:58,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:58,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:58,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:58,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:58,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:13:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 0 proven. 670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:13:58,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:13:58,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:13:58,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:13:58,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:13:58,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1196, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:13:58,863 INFO L87 Difference]: Start difference. First operand 396 states and 454 transitions. Second operand 39 states. [2019-08-05 10:14:00,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:00,390 INFO L93 Difference]: Finished difference Result 566 states and 639 transitions. [2019-08-05 10:14:00,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:14:00,390 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 127 [2019-08-05 10:14:00,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:00,393 INFO L225 Difference]: With dead ends: 566 [2019-08-05 10:14:00,393 INFO L226 Difference]: Without dead ends: 566 [2019-08-05 10:14:00,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1698 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1115, Invalid=4585, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:14:00,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-08-05 10:14:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 354. [2019-08-05 10:14:00,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-08-05 10:14:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 407 transitions. [2019-08-05 10:14:00,399 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 407 transitions. Word has length 127 [2019-08-05 10:14:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:00,399 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 407 transitions. [2019-08-05 10:14:00,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:14:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 407 transitions. [2019-08-05 10:14:00,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 10:14:00,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:00,400 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 10, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:14:00,400 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:00,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:00,400 INFO L82 PathProgramCache]: Analyzing trace with hash -109062670, now seen corresponding path program 44 times [2019-08-05 10:14:00,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:00,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:14:00,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:00,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:00,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:00,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:00,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:00,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:00,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:00,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:00,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:00,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:00,776 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:00,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:00,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:00,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:01,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 0 proven. 670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:01,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:01,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:14:01,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:14:01,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:14:01,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1196, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:14:01,103 INFO L87 Difference]: Start difference. First operand 354 states and 407 transitions. Second operand 39 states. [2019-08-05 10:14:02,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:02,834 INFO L93 Difference]: Finished difference Result 449 states and 509 transitions. [2019-08-05 10:14:02,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:14:02,835 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 127 [2019-08-05 10:14:02,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:02,837 INFO L225 Difference]: With dead ends: 449 [2019-08-05 10:14:02,838 INFO L226 Difference]: Without dead ends: 449 [2019-08-05 10:14:02,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1091, Invalid=4609, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:14:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-08-05 10:14:02,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 278. [2019-08-05 10:14:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-08-05 10:14:02,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 321 transitions. [2019-08-05 10:14:02,842 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 321 transitions. Word has length 127 [2019-08-05 10:14:02,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:02,842 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 321 transitions. [2019-08-05 10:14:02,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:14:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 321 transitions. [2019-08-05 10:14:02,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 10:14:02,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:02,843 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 10, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:14:02,843 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:02,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:02,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1609076672, now seen corresponding path program 45 times [2019-08-05 10:14:02,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:02,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:14:02,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:03,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:03,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:03,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:03,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:03,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:03,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:03,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:03,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:03,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:03,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:03,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:03,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:03,585 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 0 proven. 670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:03,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:03,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:14:03,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:14:03,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:14:03,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1196, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:14:03,653 INFO L87 Difference]: Start difference. First operand 278 states and 321 transitions. Second operand 39 states. [2019-08-05 10:14:05,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:05,209 INFO L93 Difference]: Finished difference Result 369 states and 421 transitions. [2019-08-05 10:14:05,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:14:05,210 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 127 [2019-08-05 10:14:05,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:05,212 INFO L225 Difference]: With dead ends: 369 [2019-08-05 10:14:05,212 INFO L226 Difference]: Without dead ends: 369 [2019-08-05 10:14:05,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1035, Invalid=4515, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:14:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-08-05 10:14:05,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 273. [2019-08-05 10:14:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-08-05 10:14:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 316 transitions. [2019-08-05 10:14:05,216 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 316 transitions. Word has length 127 [2019-08-05 10:14:05,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:05,217 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 316 transitions. [2019-08-05 10:14:05,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:14:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 316 transitions. [2019-08-05 10:14:05,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 10:14:05,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:05,218 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 11, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:14:05,218 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:05,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:05,218 INFO L82 PathProgramCache]: Analyzing trace with hash 519725810, now seen corresponding path program 46 times [2019-08-05 10:14:05,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:05,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:14:05,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:05,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,689 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,782 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:05,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:06,044 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:06,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:06,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:14:06,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:14:06,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:14:06,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:14:06,045 INFO L87 Difference]: Start difference. First operand 273 states and 316 transitions. Second operand 41 states. [2019-08-05 10:14:07,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:07,829 INFO L93 Difference]: Finished difference Result 631 states and 714 transitions. [2019-08-05 10:14:07,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:14:07,830 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 131 [2019-08-05 10:14:07,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:07,833 INFO L225 Difference]: With dead ends: 631 [2019-08-05 10:14:07,833 INFO L226 Difference]: Without dead ends: 631 [2019-08-05 10:14:07,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1975 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1315, Invalid=5165, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:14:07,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-08-05 10:14:07,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 480. [2019-08-05 10:14:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-08-05 10:14:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 555 transitions. [2019-08-05 10:14:07,838 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 555 transitions. Word has length 131 [2019-08-05 10:14:07,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:07,838 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 555 transitions. [2019-08-05 10:14:07,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:14:07,838 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 555 transitions. [2019-08-05 10:14:07,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:14:07,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:07,839 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 11, 9, 9, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:14:07,839 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:07,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:07,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1930998811, now seen corresponding path program 47 times [2019-08-05 10:14:07,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:07,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:14:07,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:07,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,629 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 0 proven. 754 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:08,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:08,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:14:08,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:14:08,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:14:08,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:14:08,922 INFO L87 Difference]: Start difference. First operand 480 states and 555 transitions. Second operand 41 states. [2019-08-05 10:14:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:10,636 INFO L93 Difference]: Finished difference Result 784 states and 891 transitions. [2019-08-05 10:14:10,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:14:10,636 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 133 [2019-08-05 10:14:10,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:10,640 INFO L225 Difference]: With dead ends: 784 [2019-08-05 10:14:10,641 INFO L226 Difference]: Without dead ends: 784 [2019-08-05 10:14:10,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1985 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1318, Invalid=5324, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:14:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-08-05 10:14:10,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 438. [2019-08-05 10:14:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-08-05 10:14:10,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 508 transitions. [2019-08-05 10:14:10,646 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 508 transitions. Word has length 133 [2019-08-05 10:14:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:10,647 INFO L475 AbstractCegarLoop]: Abstraction has 438 states and 508 transitions. [2019-08-05 10:14:10,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:14:10,647 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 508 transitions. [2019-08-05 10:14:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:14:10,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:10,648 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 11, 9, 9, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:14:10,648 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:10,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:10,648 INFO L82 PathProgramCache]: Analyzing trace with hash -382399383, now seen corresponding path program 48 times [2019-08-05 10:14:10,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:10,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:14:10,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:10,854 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:14:10,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,069 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:14:11,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,446 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,513 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:11,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:12,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:12,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:12,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:12,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 0 proven. 754 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:12,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:12,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:14:12,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:14:12,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:14:12,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:14:12,391 INFO L87 Difference]: Start difference. First operand 438 states and 508 transitions. Second operand 41 states. [2019-08-05 10:14:14,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:14,144 INFO L93 Difference]: Finished difference Result 653 states and 747 transitions. [2019-08-05 10:14:14,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:14:14,144 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 133 [2019-08-05 10:14:14,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:14,147 INFO L225 Difference]: With dead ends: 653 [2019-08-05 10:14:14,147 INFO L226 Difference]: Without dead ends: 653 [2019-08-05 10:14:14,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1296, Invalid=5346, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:14:14,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-08-05 10:14:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 396. [2019-08-05 10:14:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-08-05 10:14:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 461 transitions. [2019-08-05 10:14:14,152 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 461 transitions. Word has length 133 [2019-08-05 10:14:14,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:14,152 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 461 transitions. [2019-08-05 10:14:14,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:14:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 461 transitions. [2019-08-05 10:14:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:14:14,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:14,153 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 11, 9, 9, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:14:14,153 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:14,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:14,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1260541861, now seen corresponding path program 49 times [2019-08-05 10:14:14,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:14,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:14:14,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:14,303 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,781 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:14,989 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 0 proven. 754 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:15,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:15,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:14:15,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:14:15,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:14:15,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:14:15,106 INFO L87 Difference]: Start difference. First operand 396 states and 461 transitions. Second operand 41 states. [2019-08-05 10:14:16,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:16,817 INFO L93 Difference]: Finished difference Result 536 states and 617 transitions. [2019-08-05 10:14:16,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:14:16,818 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 133 [2019-08-05 10:14:16,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:16,820 INFO L225 Difference]: With dead ends: 536 [2019-08-05 10:14:16,821 INFO L226 Difference]: Without dead ends: 536 [2019-08-05 10:14:16,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1991 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1260, Invalid=5382, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:14:16,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-08-05 10:14:16,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 320. [2019-08-05 10:14:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-08-05 10:14:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 375 transitions. [2019-08-05 10:14:16,825 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 375 transitions. Word has length 133 [2019-08-05 10:14:16,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:16,825 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 375 transitions. [2019-08-05 10:14:16,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:14:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 375 transitions. [2019-08-05 10:14:16,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:14:16,826 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:16,826 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 11, 9, 9, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1] [2019-08-05 10:14:16,826 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:16,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:16,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1811927081, now seen corresponding path program 50 times [2019-08-05 10:14:16,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:16,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:14:16,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:16,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:17,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:17,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:17,149 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:17,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:17,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:17,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:17,387 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:17,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:17,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:17,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:17,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:17,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:17,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 0 proven. 754 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:17,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:17,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:14:17,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:14:17,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:14:17,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:14:17,783 INFO L87 Difference]: Start difference. First operand 320 states and 375 transitions. Second operand 41 states. [2019-08-05 10:14:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:19,546 INFO L93 Difference]: Finished difference Result 446 states and 518 transitions. [2019-08-05 10:14:19,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:14:19,546 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 133 [2019-08-05 10:14:19,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:19,549 INFO L225 Difference]: With dead ends: 446 [2019-08-05 10:14:19,549 INFO L226 Difference]: Without dead ends: 446 [2019-08-05 10:14:19,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1867 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1175, Invalid=5145, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:14:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-08-05 10:14:19,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 308. [2019-08-05 10:14:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-08-05 10:14:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 362 transitions. [2019-08-05 10:14:19,553 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 362 transitions. Word has length 133 [2019-08-05 10:14:19,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:19,553 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 362 transitions. [2019-08-05 10:14:19,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:14:19,553 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 362 transitions. [2019-08-05 10:14:19,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:14:19,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:19,554 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 10, 10, 9, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1] [2019-08-05 10:14:19,554 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:19,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:19,554 INFO L82 PathProgramCache]: Analyzing trace with hash -409303215, now seen corresponding path program 51 times [2019-08-05 10:14:19,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:19,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:14:19,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:19,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,773 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:19,922 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:20,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:20,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:20,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:20,200 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:20,200 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:20,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 0 proven. 751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:20,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:20,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:14:20,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:14:20,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:14:20,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1263, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:14:20,303 INFO L87 Difference]: Start difference. First operand 308 states and 362 transitions. Second operand 40 states. [2019-08-05 10:14:21,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:21,999 INFO L93 Difference]: Finished difference Result 398 states and 457 transitions. [2019-08-05 10:14:21,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:14:22,000 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 133 [2019-08-05 10:14:22,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:22,002 INFO L225 Difference]: With dead ends: 398 [2019-08-05 10:14:22,002 INFO L226 Difference]: Without dead ends: 398 [2019-08-05 10:14:22,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1823 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1108, Invalid=5054, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:14:22,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-08-05 10:14:22,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 282. [2019-08-05 10:14:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-08-05 10:14:22,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 328 transitions. [2019-08-05 10:14:22,006 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 328 transitions. Word has length 133 [2019-08-05 10:14:22,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:22,006 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 328 transitions. [2019-08-05 10:14:22,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:14:22,006 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 328 transitions. [2019-08-05 10:14:22,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:14:22,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:22,007 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 11, 11, 10, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1] [2019-08-05 10:14:22,007 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:22,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:22,008 INFO L82 PathProgramCache]: Analyzing trace with hash -136341894, now seen corresponding path program 52 times [2019-08-05 10:14:22,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:22,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:14:22,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:22,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,386 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:14:22,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,640 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,641 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,738 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,944 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:22,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:23,090 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:23,090 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:23,123 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:23,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:23,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:14:23,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:14:23,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:14:23,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:14:23,264 INFO L87 Difference]: Start difference. First operand 282 states and 328 transitions. Second operand 42 states. [2019-08-05 10:14:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:25,080 INFO L93 Difference]: Finished difference Result 399 states and 462 transitions. [2019-08-05 10:14:25,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:14:25,080 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 139 [2019-08-05 10:14:25,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:25,082 INFO L225 Difference]: With dead ends: 399 [2019-08-05 10:14:25,082 INFO L226 Difference]: Without dead ends: 399 [2019-08-05 10:14:25,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1211, Invalid=5595, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:14:25,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-08-05 10:14:25,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 263. [2019-08-05 10:14:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-08-05 10:14:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 306 transitions. [2019-08-05 10:14:25,087 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 306 transitions. Word has length 139 [2019-08-05 10:14:25,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:25,087 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 306 transitions. [2019-08-05 10:14:25,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:14:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 306 transitions. [2019-08-05 10:14:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:14:25,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:25,088 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 11, 11, 10, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1] [2019-08-05 10:14:25,088 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:25,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:25,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1314838879, now seen corresponding path program 53 times [2019-08-05 10:14:25,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:25,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:14:25,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:25,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,443 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,444 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:25,868 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:25,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:25,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:14:25,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:14:25,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:14:25,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=1392, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:14:25,869 INFO L87 Difference]: Start difference. First operand 263 states and 306 transitions. Second operand 42 states. [2019-08-05 10:14:27,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:27,771 INFO L93 Difference]: Finished difference Result 616 states and 694 transitions. [2019-08-05 10:14:27,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:14:27,771 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 139 [2019-08-05 10:14:27,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:27,774 INFO L225 Difference]: With dead ends: 616 [2019-08-05 10:14:27,774 INFO L226 Difference]: Without dead ends: 616 [2019-08-05 10:14:27,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1365, Invalid=5441, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:14:27,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-08-05 10:14:27,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 470. [2019-08-05 10:14:27,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-08-05 10:14:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 538 transitions. [2019-08-05 10:14:27,780 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 538 transitions. Word has length 139 [2019-08-05 10:14:27,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:27,780 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 538 transitions. [2019-08-05 10:14:27,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:14:27,780 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 538 transitions. [2019-08-05 10:14:27,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:14:27,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:27,781 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 11, 10, 9, 8, 8, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1] [2019-08-05 10:14:27,781 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:27,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:27,781 INFO L82 PathProgramCache]: Analyzing trace with hash 177336712, now seen corresponding path program 54 times [2019-08-05 10:14:27,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:27,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:14:27,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:27,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:27,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:27,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,502 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,503 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,653 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 0 proven. 853 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:28,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:28,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:14:28,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:14:28,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:14:28,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:14:28,921 INFO L87 Difference]: Start difference. First operand 470 states and 538 transitions. Second operand 42 states. [2019-08-05 10:14:30,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:30,664 INFO L93 Difference]: Finished difference Result 769 states and 864 transitions. [2019-08-05 10:14:30,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:14:30,665 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 141 [2019-08-05 10:14:30,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:30,668 INFO L225 Difference]: With dead ends: 769 [2019-08-05 10:14:30,668 INFO L226 Difference]: Without dead ends: 769 [2019-08-05 10:14:30,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2088 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1368, Invalid=5604, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:14:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-08-05 10:14:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 428. [2019-08-05 10:14:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-08-05 10:14:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 491 transitions. [2019-08-05 10:14:30,674 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 491 transitions. Word has length 141 [2019-08-05 10:14:30,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:30,675 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 491 transitions. [2019-08-05 10:14:30,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:14:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 491 transitions. [2019-08-05 10:14:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:14:30,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:30,676 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 11, 10, 9, 8, 8, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1] [2019-08-05 10:14:30,676 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:30,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:30,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1471159254, now seen corresponding path program 55 times [2019-08-05 10:14:30,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:30,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:14:30,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:30,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:30,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:30,871 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:30,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:30,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:30,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:30,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,076 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,076 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,168 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,358 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,359 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 0 proven. 853 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:31,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:31,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:14:31,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:14:31,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:14:31,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:14:31,479 INFO L87 Difference]: Start difference. First operand 428 states and 491 transitions. Second operand 42 states. [2019-08-05 10:14:33,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:33,446 INFO L93 Difference]: Finished difference Result 637 states and 719 transitions. [2019-08-05 10:14:33,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:14:33,446 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 141 [2019-08-05 10:14:33,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:33,450 INFO L225 Difference]: With dead ends: 637 [2019-08-05 10:14:33,450 INFO L226 Difference]: Without dead ends: 637 [2019-08-05 10:14:33,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2084 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1346, Invalid=5626, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:14:33,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-08-05 10:14:33,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 386. [2019-08-05 10:14:33,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-08-05 10:14:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 444 transitions. [2019-08-05 10:14:33,456 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 444 transitions. Word has length 141 [2019-08-05 10:14:33,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:33,457 INFO L475 AbstractCegarLoop]: Abstraction has 386 states and 444 transitions. [2019-08-05 10:14:33,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:14:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 444 transitions. [2019-08-05 10:14:33,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:14:33,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:33,458 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 11, 10, 9, 8, 8, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1] [2019-08-05 10:14:33,458 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:33,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:33,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1824610872, now seen corresponding path program 56 times [2019-08-05 10:14:33,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:33,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:14:33,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:33,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:33,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:33,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:33,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:33,843 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:33,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:33,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:33,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:33,956 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:33,984 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,128 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,234 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 0 proven. 853 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:34,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:34,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:14:34,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:14:34,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:14:34,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:14:34,394 INFO L87 Difference]: Start difference. First operand 386 states and 444 transitions. Second operand 42 states. [2019-08-05 10:14:36,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:36,242 INFO L93 Difference]: Finished difference Result 554 states and 628 transitions. [2019-08-05 10:14:36,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:14:36,242 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 141 [2019-08-05 10:14:36,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:36,245 INFO L225 Difference]: With dead ends: 554 [2019-08-05 10:14:36,245 INFO L226 Difference]: Without dead ends: 554 [2019-08-05 10:14:36,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2094 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1310, Invalid=5662, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:14:36,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-08-05 10:14:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 344. [2019-08-05 10:14:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-08-05 10:14:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 397 transitions. [2019-08-05 10:14:36,250 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 397 transitions. Word has length 141 [2019-08-05 10:14:36,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:36,250 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 397 transitions. [2019-08-05 10:14:36,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:14:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 397 transitions. [2019-08-05 10:14:36,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:14:36,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:36,251 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 11, 10, 9, 8, 8, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1] [2019-08-05 10:14:36,252 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:36,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:36,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1000661098, now seen corresponding path program 57 times [2019-08-05 10:14:36,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:36,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:14:36,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:36,393 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,660 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,699 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,699 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:36,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,092 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:37,200 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 0 proven. 853 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:37,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:37,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:14:37,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:14:37,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:14:37,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:14:37,202 INFO L87 Difference]: Start difference. First operand 344 states and 397 transitions. Second operand 42 states. [2019-08-05 10:14:39,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:39,195 INFO L93 Difference]: Finished difference Result 473 states and 539 transitions. [2019-08-05 10:14:39,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:14:39,196 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 141 [2019-08-05 10:14:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:39,198 INFO L225 Difference]: With dead ends: 473 [2019-08-05 10:14:39,198 INFO L226 Difference]: Without dead ends: 473 [2019-08-05 10:14:39,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2089 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1276, Invalid=5696, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:14:39,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-08-05 10:14:39,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 304. [2019-08-05 10:14:39,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-08-05 10:14:39,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 352 transitions. [2019-08-05 10:14:39,202 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 352 transitions. Word has length 141 [2019-08-05 10:14:39,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:39,202 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 352 transitions. [2019-08-05 10:14:39,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:14:39,202 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 352 transitions. [2019-08-05 10:14:39,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:14:39,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:39,203 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 11, 10, 9, 8, 8, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1] [2019-08-05 10:14:39,203 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:39,203 INFO L82 PathProgramCache]: Analyzing trace with hash -524490232, now seen corresponding path program 58 times [2019-08-05 10:14:39,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:39,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:14:39,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:39,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,631 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:14:39,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,888 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,952 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:39,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,230 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,230 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:40,498 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 0 proven. 853 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:40,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:40,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:14:40,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:14:40,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:14:40,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:14:40,499 INFO L87 Difference]: Start difference. First operand 304 states and 352 transitions. Second operand 42 states. [2019-08-05 10:14:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:42,272 INFO L93 Difference]: Finished difference Result 398 states and 454 transitions. [2019-08-05 10:14:42,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:14:42,273 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 141 [2019-08-05 10:14:42,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:42,275 INFO L225 Difference]: With dead ends: 398 [2019-08-05 10:14:42,275 INFO L226 Difference]: Without dead ends: 398 [2019-08-05 10:14:42,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1211, Invalid=5595, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:14:42,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-08-05 10:14:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 303. [2019-08-05 10:14:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-08-05 10:14:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 349 transitions. [2019-08-05 10:14:42,279 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 349 transitions. Word has length 141 [2019-08-05 10:14:42,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:42,280 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 349 transitions. [2019-08-05 10:14:42,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:14:42,280 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 349 transitions. [2019-08-05 10:14:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-08-05 10:14:42,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:42,281 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 12, 11, 11, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:14:42,281 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:42,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:42,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1053751188, now seen corresponding path program 59 times [2019-08-05 10:14:42,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:42,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:14:42,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:42,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,629 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,715 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:42,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:43,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:43,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:43,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:43,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 0 proven. 966 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:43,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:43,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:14:43,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:14:43,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:14:43,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=1681, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:14:43,344 INFO L87 Difference]: Start difference. First operand 303 states and 349 transitions. Second operand 46 states. [2019-08-05 10:14:45,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:45,205 INFO L93 Difference]: Finished difference Result 686 states and 769 transitions. [2019-08-05 10:14:45,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:14:45,205 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 150 [2019-08-05 10:14:45,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:45,209 INFO L225 Difference]: With dead ends: 686 [2019-08-05 10:14:45,209 INFO L226 Difference]: Without dead ends: 686 [2019-08-05 10:14:45,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2509 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1611, Invalid=6399, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:14:45,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-08-05 10:14:45,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 520. [2019-08-05 10:14:45,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-08-05 10:14:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 592 transitions. [2019-08-05 10:14:45,215 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 592 transitions. Word has length 150 [2019-08-05 10:14:45,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:45,216 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 592 transitions. [2019-08-05 10:14:45,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:14:45,216 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 592 transitions. [2019-08-05 10:14:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:14:45,217 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:45,217 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 12, 10, 10, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:14:45,217 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:45,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:45,217 INFO L82 PathProgramCache]: Analyzing trace with hash -676308021, now seen corresponding path program 60 times [2019-08-05 10:14:45,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:45,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:14:45,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:45,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,563 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:45,902 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,042 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:46,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:46,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:14:46,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:14:46,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:14:46,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1684, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:14:46,131 INFO L87 Difference]: Start difference. First operand 520 states and 592 transitions. Second operand 46 states. [2019-08-05 10:14:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:48,217 INFO L93 Difference]: Finished difference Result 854 states and 955 transitions. [2019-08-05 10:14:48,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:14:48,218 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 152 [2019-08-05 10:14:48,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:48,222 INFO L225 Difference]: With dead ends: 854 [2019-08-05 10:14:48,222 INFO L226 Difference]: Without dead ends: 854 [2019-08-05 10:14:48,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2512 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1615, Invalid=6575, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:14:48,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-08-05 10:14:48,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 478. [2019-08-05 10:14:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-08-05 10:14:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 545 transitions. [2019-08-05 10:14:48,228 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 545 transitions. Word has length 152 [2019-08-05 10:14:48,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:48,228 INFO L475 AbstractCegarLoop]: Abstraction has 478 states and 545 transitions. [2019-08-05 10:14:48,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:14:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 545 transitions. [2019-08-05 10:14:48,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:14:48,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:48,229 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 12, 10, 10, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:14:48,229 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:48,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:48,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1226069181, now seen corresponding path program 61 times [2019-08-05 10:14:48,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:48,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:14:48,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:48,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,358 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,358 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,667 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:48,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,000 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:49,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:49,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:14:49,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:14:49,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:14:49,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1684, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:14:49,099 INFO L87 Difference]: Start difference. First operand 478 states and 545 transitions. Second operand 46 states. [2019-08-05 10:14:51,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:51,124 INFO L93 Difference]: Finished difference Result 719 states and 807 transitions. [2019-08-05 10:14:51,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:14:51,125 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 152 [2019-08-05 10:14:51,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:51,128 INFO L225 Difference]: With dead ends: 719 [2019-08-05 10:14:51,128 INFO L226 Difference]: Without dead ends: 719 [2019-08-05 10:14:51,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2491 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1593, Invalid=6597, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:14:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-08-05 10:14:51,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 436. [2019-08-05 10:14:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-08-05 10:14:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 498 transitions. [2019-08-05 10:14:51,133 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 498 transitions. Word has length 152 [2019-08-05 10:14:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:51,134 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 498 transitions. [2019-08-05 10:14:51,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:14:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 498 transitions. [2019-08-05 10:14:51,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:14:51,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:51,135 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 12, 10, 10, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:14:51,135 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:51,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:51,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1077182347, now seen corresponding path program 62 times [2019-08-05 10:14:51,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:51,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:14:51,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:51,178 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,240 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,562 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,563 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,728 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,729 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:51,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:52,003 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:52,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:52,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:14:52,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:14:52,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:14:52,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1684, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:14:52,094 INFO L87 Difference]: Start difference. First operand 436 states and 498 transitions. Second operand 46 states. [2019-08-05 10:14:54,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:54,248 INFO L93 Difference]: Finished difference Result 624 states and 703 transitions. [2019-08-05 10:14:54,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:14:54,248 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 152 [2019-08-05 10:14:54,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:54,251 INFO L225 Difference]: With dead ends: 624 [2019-08-05 10:14:54,251 INFO L226 Difference]: Without dead ends: 624 [2019-08-05 10:14:54,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2506 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1557, Invalid=6633, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:14:54,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-08-05 10:14:54,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 394. [2019-08-05 10:14:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-08-05 10:14:54,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 451 transitions. [2019-08-05 10:14:54,257 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 451 transitions. Word has length 152 [2019-08-05 10:14:54,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:54,257 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 451 transitions. [2019-08-05 10:14:54,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:14:54,258 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 451 transitions. [2019-08-05 10:14:54,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:14:54,258 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:54,258 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 12, 10, 10, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:14:54,259 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:54,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:54,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1380615939, now seen corresponding path program 63 times [2019-08-05 10:14:54,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:54,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:14:54,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:54,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,473 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,638 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,727 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:54,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:55,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:55,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:55,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:14:55,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:14:55,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:14:55,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1684, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:14:55,147 INFO L87 Difference]: Start difference. First operand 394 states and 451 transitions. Second operand 46 states. [2019-08-05 10:14:57,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:57,230 INFO L93 Difference]: Finished difference Result 507 states and 573 transitions. [2019-08-05 10:14:57,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:14:57,230 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 152 [2019-08-05 10:14:57,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:57,233 INFO L225 Difference]: With dead ends: 507 [2019-08-05 10:14:57,233 INFO L226 Difference]: Without dead ends: 507 [2019-08-05 10:14:57,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2500 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1523, Invalid=6667, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:14:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-08-05 10:14:57,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 318. [2019-08-05 10:14:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-08-05 10:14:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 365 transitions. [2019-08-05 10:14:57,238 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 365 transitions. Word has length 152 [2019-08-05 10:14:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:57,238 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 365 transitions. [2019-08-05 10:14:57,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:14:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 365 transitions. [2019-08-05 10:14:57,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:14:57,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:57,239 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 12, 10, 10, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:14:57,239 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:57,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:57,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1414337355, now seen corresponding path program 64 times [2019-08-05 10:14:57,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:57,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:14:57,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:57,377 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,399 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,497 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,576 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:57,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:14:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:58,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:58,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:14:58,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:14:58,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:14:58,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1684, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:14:58,332 INFO L87 Difference]: Start difference. First operand 318 states and 365 transitions. Second operand 46 states. [2019-08-05 10:15:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:00,341 INFO L93 Difference]: Finished difference Result 427 states and 485 transitions. [2019-08-05 10:15:00,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:15:00,341 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 152 [2019-08-05 10:15:00,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:00,344 INFO L225 Difference]: With dead ends: 427 [2019-08-05 10:15:00,344 INFO L226 Difference]: Without dead ends: 427 [2019-08-05 10:15:00,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2418 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1455, Invalid=6555, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:15:00,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-08-05 10:15:00,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 313. [2019-08-05 10:15:00,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-08-05 10:15:00,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 360 transitions. [2019-08-05 10:15:00,348 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 360 transitions. Word has length 152 [2019-08-05 10:15:00,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:00,348 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 360 transitions. [2019-08-05 10:15:00,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:15:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 360 transitions. [2019-08-05 10:15:00,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-05 10:15:00,349 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:00,349 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 13, 12, 12, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:15:00,349 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:00,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:00,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1438545795, now seen corresponding path program 65 times [2019-08-05 10:15:00,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:00,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:15:00,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:00,387 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,526 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,559 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:00,989 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:01,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:01,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 0 proven. 1067 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:01,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:01,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:15:01,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:15:01,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:15:01,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=1833, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:15:01,252 INFO L87 Difference]: Start difference. First operand 313 states and 360 transitions. Second operand 48 states. [2019-08-05 10:15:03,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:03,559 INFO L93 Difference]: Finished difference Result 775 states and 872 transitions. [2019-08-05 10:15:03,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:15:03,559 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 156 [2019-08-05 10:15:03,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:03,564 INFO L225 Difference]: With dead ends: 775 [2019-08-05 10:15:03,564 INFO L226 Difference]: Without dead ends: 775 [2019-08-05 10:15:03,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2867 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1828, Invalid=7292, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:15:03,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-08-05 10:15:03,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 562. [2019-08-05 10:15:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-08-05 10:15:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 646 transitions. [2019-08-05 10:15:03,572 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 646 transitions. Word has length 156 [2019-08-05 10:15:03,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:03,573 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 646 transitions. [2019-08-05 10:15:03,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:15:03,573 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 646 transitions. [2019-08-05 10:15:03,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:15:03,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:03,574 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 13, 11, 11, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:15:03,574 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:03,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:03,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1560369292, now seen corresponding path program 66 times [2019-08-05 10:15:03,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:03,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:15:03,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:03,732 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:03,930 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 5 [2019-08-05 10:15:03,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:03,975 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:03,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:04,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:04,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:04,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:04,199 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:04,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:04,235 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:04,330 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:04,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:04,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:04,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:04,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:04,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:04,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:04,805 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:15:04,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:04,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:15:04,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:15:04,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:15:04,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:15:04,806 INFO L87 Difference]: Start difference. First operand 562 states and 646 transitions. Second operand 48 states. [2019-08-05 10:15:07,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:07,064 INFO L93 Difference]: Finished difference Result 977 states and 1103 transitions. [2019-08-05 10:15:07,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:15:07,064 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 158 [2019-08-05 10:15:07,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:07,069 INFO L225 Difference]: With dead ends: 977 [2019-08-05 10:15:07,069 INFO L226 Difference]: Without dead ends: 977 [2019-08-05 10:15:07,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2893 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1832, Invalid=7480, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:15:07,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-08-05 10:15:07,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 520. [2019-08-05 10:15:07,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-08-05 10:15:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 599 transitions. [2019-08-05 10:15:07,077 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 599 transitions. Word has length 158 [2019-08-05 10:15:07,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:07,078 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 599 transitions. [2019-08-05 10:15:07,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:15:07,078 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 599 transitions. [2019-08-05 10:15:07,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:15:07,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:07,079 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 13, 11, 11, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:15:07,079 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:07,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:07,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1227662054, now seen corresponding path program 67 times [2019-08-05 10:15:07,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:07,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:15:07,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:07,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:07,199 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:07,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:07,225 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:07,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:07,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:07,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:07,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:07,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:07,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:07,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:07,638 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:07,638 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:07,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:07,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:07,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:07,944 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:08,087 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:15:08,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:08,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:15:08,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:15:08,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:15:08,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:15:08,089 INFO L87 Difference]: Start difference. First operand 520 states and 599 transitions. Second operand 48 states. [2019-08-05 10:15:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:10,512 INFO L93 Difference]: Finished difference Result 842 states and 955 transitions. [2019-08-05 10:15:10,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:15:10,513 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 158 [2019-08-05 10:15:10,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:10,516 INFO L225 Difference]: With dead ends: 842 [2019-08-05 10:15:10,516 INFO L226 Difference]: Without dead ends: 842 [2019-08-05 10:15:10,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1810, Invalid=7502, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:15:10,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-08-05 10:15:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 478. [2019-08-05 10:15:10,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-08-05 10:15:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 552 transitions. [2019-08-05 10:15:10,524 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 552 transitions. Word has length 158 [2019-08-05 10:15:10,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:10,525 INFO L475 AbstractCegarLoop]: Abstraction has 478 states and 552 transitions. [2019-08-05 10:15:10,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:15:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 552 transitions. [2019-08-05 10:15:10,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:15:10,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:10,526 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 13, 11, 11, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:15:10,526 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:10,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:10,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1085736140, now seen corresponding path program 68 times [2019-08-05 10:15:10,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:10,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:15:10,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:10,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:10,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:10,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:10,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:10,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:10,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:10,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:10,884 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:10,884 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:10,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:11,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:11,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:11,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:11,151 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:11,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:11,199 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:11,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:11,446 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:15:11,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:11,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:15:11,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:15:11,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:15:11,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:15:11,448 INFO L87 Difference]: Start difference. First operand 478 states and 552 transitions. Second operand 48 states. [2019-08-05 10:15:13,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:13,828 INFO L93 Difference]: Finished difference Result 711 states and 811 transitions. [2019-08-05 10:15:13,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:15:13,828 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 158 [2019-08-05 10:15:13,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:13,830 INFO L225 Difference]: With dead ends: 711 [2019-08-05 10:15:13,830 INFO L226 Difference]: Without dead ends: 711 [2019-08-05 10:15:13,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2860 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1774, Invalid=7538, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:15:13,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-08-05 10:15:13,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 436. [2019-08-05 10:15:13,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-08-05 10:15:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 505 transitions. [2019-08-05 10:15:13,838 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 505 transitions. Word has length 158 [2019-08-05 10:15:13,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:13,838 INFO L475 AbstractCegarLoop]: Abstraction has 436 states and 505 transitions. [2019-08-05 10:15:13,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:15:13,838 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 505 transitions. [2019-08-05 10:15:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:15:13,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:13,840 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 13, 11, 11, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:15:13,840 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:13,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:13,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1963878618, now seen corresponding path program 69 times [2019-08-05 10:15:13,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:13,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:15:13,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:13,922 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:13,973 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:13,997 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:13,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:14,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:14,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:14,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:14,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:14,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:14,210 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:14,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:14,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:14,328 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:14,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:14,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:14,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:14,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:14,765 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:15:14,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:14,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:15:14,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:15:14,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:15:14,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:15:14,766 INFO L87 Difference]: Start difference. First operand 436 states and 505 transitions. Second operand 48 states. [2019-08-05 10:15:17,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:17,150 INFO L93 Difference]: Finished difference Result 594 states and 681 transitions. [2019-08-05 10:15:17,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:15:17,150 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 158 [2019-08-05 10:15:17,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:17,152 INFO L225 Difference]: With dead ends: 594 [2019-08-05 10:15:17,152 INFO L226 Difference]: Without dead ends: 594 [2019-08-05 10:15:17,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2857 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1724, Invalid=7588, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:15:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-08-05 10:15:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 360. [2019-08-05 10:15:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-08-05 10:15:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 419 transitions. [2019-08-05 10:15:17,158 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 419 transitions. Word has length 158 [2019-08-05 10:15:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:17,158 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 419 transitions. [2019-08-05 10:15:17,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:15:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 419 transitions. [2019-08-05 10:15:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:15:17,159 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:17,159 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 13, 11, 11, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1] [2019-08-05 10:15:17,159 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:17,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:17,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1108590324, now seen corresponding path program 70 times [2019-08-05 10:15:17,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:17,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:15:17,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:17,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:17,332 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:17,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:17,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:17,425 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:17,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:17,458 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:17,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:17,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:17,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:17,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:17,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:17,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:17,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:17,964 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:17,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:18,123 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:18,261 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:15:18,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:18,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:15:18,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:15:18,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:15:18,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:15:18,263 INFO L87 Difference]: Start difference. First operand 360 states and 419 transitions. Second operand 48 states. [2019-08-05 10:15:20,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:20,779 INFO L93 Difference]: Finished difference Result 504 states and 582 transitions. [2019-08-05 10:15:20,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:15:20,779 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 158 [2019-08-05 10:15:20,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:20,780 INFO L225 Difference]: With dead ends: 504 [2019-08-05 10:15:20,781 INFO L226 Difference]: Without dead ends: 504 [2019-08-05 10:15:20,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2703 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1621, Invalid=7309, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:15:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-08-05 10:15:20,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 348. [2019-08-05 10:15:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-08-05 10:15:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 406 transitions. [2019-08-05 10:15:20,786 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 406 transitions. Word has length 158 [2019-08-05 10:15:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:20,786 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 406 transitions. [2019-08-05 10:15:20,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:15:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 406 transitions. [2019-08-05 10:15:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-08-05 10:15:20,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:20,787 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 12, 12, 11, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1] [2019-08-05 10:15:20,787 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:20,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:20,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1112639972, now seen corresponding path program 71 times [2019-08-05 10:15:20,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:20,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:15:20,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:20,952 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:20,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:20,981 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:21,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:21,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:21,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:21,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:21,196 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:21,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:21,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:21,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:21,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:21,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:21,518 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:21,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:21,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:21,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:21,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:21,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 0 proven. 1078 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:21,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:21,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:15:21,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:15:21,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:15:21,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1763, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:15:21,770 INFO L87 Difference]: Start difference. First operand 348 states and 406 transitions. Second operand 47 states. [2019-08-05 10:15:24,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:24,152 INFO L93 Difference]: Finished difference Result 456 states and 521 transitions. [2019-08-05 10:15:24,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:15:24,152 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 158 [2019-08-05 10:15:24,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:24,153 INFO L225 Difference]: With dead ends: 456 [2019-08-05 10:15:24,154 INFO L226 Difference]: Without dead ends: 456 [2019-08-05 10:15:24,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2651 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1539, Invalid=7203, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:15:24,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-08-05 10:15:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 322. [2019-08-05 10:15:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-08-05 10:15:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 372 transitions. [2019-08-05 10:15:24,159 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 372 transitions. Word has length 158 [2019-08-05 10:15:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:24,159 INFO L475 AbstractCegarLoop]: Abstraction has 322 states and 372 transitions. [2019-08-05 10:15:24,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:15:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 372 transitions. [2019-08-05 10:15:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-05 10:15:24,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:24,160 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 13, 13, 12, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1] [2019-08-05 10:15:24,160 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:24,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:24,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1319501563, now seen corresponding path program 72 times [2019-08-05 10:15:24,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:24,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:15:24,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:24,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,492 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,765 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,765 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,884 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:24,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 0 proven. 1184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:25,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:25,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:15:25,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:15:25,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:15:25,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1919, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:15:25,090 INFO L87 Difference]: Start difference. First operand 322 states and 372 transitions. Second operand 49 states. [2019-08-05 10:15:27,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:27,491 INFO L93 Difference]: Finished difference Result 457 states and 526 transitions. [2019-08-05 10:15:27,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:15:27,492 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 164 [2019-08-05 10:15:27,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:27,493 INFO L225 Difference]: With dead ends: 457 [2019-08-05 10:15:27,493 INFO L226 Difference]: Without dead ends: 457 [2019-08-05 10:15:27,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2874 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1661, Invalid=7845, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:15:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-08-05 10:15:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 303. [2019-08-05 10:15:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-08-05 10:15:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 350 transitions. [2019-08-05 10:15:27,497 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 350 transitions. Word has length 164 [2019-08-05 10:15:27,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:27,497 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 350 transitions. [2019-08-05 10:15:27,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:15:27,498 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 350 transitions. [2019-08-05 10:15:27,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-05 10:15:27,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:27,498 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 13, 13, 12, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1] [2019-08-05 10:15:27,499 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:27,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:27,499 INFO L82 PathProgramCache]: Analyzing trace with hash 131679210, now seen corresponding path program 73 times [2019-08-05 10:15:27,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:27,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:15:27,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:27,555 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:27,576 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:27,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:27,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:27,627 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:27,644 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:27,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:27,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:27,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:27,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:27,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:27,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:15:27,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 734 proven. 428 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-08-05 10:15:27,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:27,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:15:27,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:15:27,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:15:27,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:15:27,799 INFO L87 Difference]: Start difference. First operand 303 states and 350 transitions. Second operand 21 states. [2019-08-05 10:15:30,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:30,073 INFO L93 Difference]: Finished difference Result 1830 states and 2053 transitions. [2019-08-05 10:15:30,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:15:30,073 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 164 [2019-08-05 10:15:30,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:30,073 INFO L225 Difference]: With dead ends: 1830 [2019-08-05 10:15:30,074 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:15:30,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1082, Invalid=2224, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:15:30,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:15:30,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:15:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:15:30,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:15:30,075 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 164 [2019-08-05 10:15:30,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:30,076 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:15:30,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:15:30,076 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:15:30,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:15:30,081 INFO L202 PluginConnector]: Adding new model u2b02_multiple_pca_SAFE.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:15:30 BoogieIcfgContainer [2019-08-05 10:15:30,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:15:30,083 INFO L168 Benchmark]: Toolchain (without parser) took 177868.85 ms. Allocated memory was 140.0 MB in the beginning and 424.7 MB in the end (delta: 284.7 MB). Free memory was 107.8 MB in the beginning and 207.1 MB in the end (delta: -99.3 MB). Peak memory consumption was 185.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:30,084 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 140.0 MB. Free memory was 109.5 MB in the beginning and 109.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:15:30,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.67 ms. Allocated memory is still 140.0 MB. Free memory was 107.8 MB in the beginning and 105.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:30,085 INFO L168 Benchmark]: Boogie Preprocessor took 30.96 ms. Allocated memory is still 140.0 MB. Free memory was 105.8 MB in the beginning and 104.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:30,086 INFO L168 Benchmark]: RCFGBuilder took 816.38 ms. Allocated memory is still 140.0 MB. Free memory was 104.5 MB in the beginning and 83.3 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:30,086 INFO L168 Benchmark]: TraceAbstraction took 176977.19 ms. Allocated memory was 140.0 MB in the beginning and 424.7 MB in the end (delta: 284.7 MB). Free memory was 83.1 MB in the beginning and 207.1 MB in the end (delta: -124.0 MB). Peak memory consumption was 160.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:30,089 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.20 ms. Allocated memory is still 140.0 MB. Free memory was 109.5 MB in the beginning and 109.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.67 ms. Allocated memory is still 140.0 MB. Free memory was 107.8 MB in the beginning and 105.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.96 ms. Allocated memory is still 140.0 MB. Free memory was 105.8 MB in the beginning and 104.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 816.38 ms. Allocated memory is still 140.0 MB. Free memory was 104.5 MB in the beginning and 83.3 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 176977.19 ms. Allocated memory was 140.0 MB in the beginning and 424.7 MB in the end (delta: 284.7 MB). Free memory was 83.1 MB in the beginning and 207.1 MB in the end (delta: -124.0 MB). Peak memory consumption was 160.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 144]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 103]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 2 error locations. SAFE Result, 176.9s OverallTime, 82 OverallIterations, 20 TraceHistogramMax, 109.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1682 SDtfs, 34336 SDslu, 23981 SDs, 0 SdLazy, 31102 SolverSat, 10218 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10496 GetRequests, 5775 SyntacticMatches, 3 SemanticMatches, 4718 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102116 ImplicationChecksByTransitivity, 127.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=562occurred in iteration=74, 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.4s AutomataMinimizationTime, 82 MinimizatonAttempts, 10567 StatesRemovedByMinimization, 78 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 64.4s InterpolantComputationTime, 8224 NumberOfCodeBlocks, 8224 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 8142 ConstructedInterpolants, 0 QuantifiedInterpolants, 8614867 SizeOfPredicates, 2656 NumberOfNonLiveVariables, 24295 ConjunctsInSsa, 4533 ConjunctsInUnsatCore, 82 InterpolantComputations, 6 PerfectInterpolantSequences, 795/41983 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...