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/random/RanFile070.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:03:19,279 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:03:19,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:03:19,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:03:19,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:03:19,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:03:19,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:03:19,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:03:19,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:03:19,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:03:19,300 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:03:19,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:03:19,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:03:19,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:03:19,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:03:19,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:03:19,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:03:19,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:03:19,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:03:19,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:03:19,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:03:19,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:03:19,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:03:19,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:03:19,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:03:19,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:03:19,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:03:19,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:03:19,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:03:19,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:03:19,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:03:19,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:03:19,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:03:19,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:03:19,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:03:19,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:03:19,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:03:19,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:03:19,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:03:19,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:03:19,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:03:19,353 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:03:19,367 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:03:19,371 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:03:19,373 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:03:19,373 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:03:19,374 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile070.bpl [2019-08-05 10:03:19,375 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile070.bpl' [2019-08-05 10:03:19,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:03:19,462 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:03:19,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:03:19,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:03:19,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:03:19,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RanFile070.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:19" (1/1) ... [2019-08-05 10:03:19,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RanFile070.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:19" (1/1) ... [2019-08-05 10:03:19,501 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:03:19,501 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:03:19,501 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:03:19,505 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:03:19,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:03:19,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:03:19,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:03:19,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RanFile070.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:19" (1/1) ... [2019-08-05 10:03:19,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RanFile070.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:19" (1/1) ... [2019-08-05 10:03:19,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RanFile070.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:19" (1/1) ... [2019-08-05 10:03:19,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RanFile070.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:19" (1/1) ... [2019-08-05 10:03:19,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RanFile070.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:19" (1/1) ... [2019-08-05 10:03:19,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RanFile070.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:19" (1/1) ... [2019-08-05 10:03:19,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RanFile070.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:19" (1/1) ... [2019-08-05 10:03:19,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:03:19,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:03:19,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:03:19,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:03:19,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RanFile070.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:19" (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:03:19,647 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:03:19,647 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:03:19,647 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:03:21,741 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:03:21,742 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:03:21,743 INFO L202 PluginConnector]: Adding new model RanFile070.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:03:21 BoogieIcfgContainer [2019-08-05 10:03:21,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:03:21,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:03:21,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:03:21,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:03:21,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile070.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:19" (1/2) ... [2019-08-05 10:03:21,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6084b481 and model type RanFile070.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:03:21, skipping insertion in model container [2019-08-05 10:03:21,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile070.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:03:21" (2/2) ... [2019-08-05 10:03:21,751 INFO L109 eAbstractionObserver]: Analyzing ICFG RanFile070.bpl [2019-08-05 10:03:21,760 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:03:21,768 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 10:03:21,784 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 10:03:21,805 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:03:21,806 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:03:21,806 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:03:21,806 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:03:21,806 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:03:21,807 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:03:21,807 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:03:21,807 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:03:21,807 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:03:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-08-05 10:03:21,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:03:21,830 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:21,831 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:21,833 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:21,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:21,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1520007142, now seen corresponding path program 1 times [2019-08-05 10:03:21,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:22,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:03:22,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:22,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:22,310 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-08-05 10:03:22,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:22,683 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 33 [2019-08-05 10:03:23,027 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-08-05 10:03:23,205 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:03:23,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:23,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:03:23,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:03:23,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:03:23,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:03:23,234 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 8 states. [2019-08-05 10:03:24,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:24,938 INFO L93 Difference]: Finished difference Result 57 states and 101 transitions. [2019-08-05 10:03:24,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:03:24,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-08-05 10:03:24,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:24,952 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:03:24,952 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:03:24,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:03:24,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:03:24,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-08-05 10:03:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:03:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 91 transitions. [2019-08-05 10:03:24,990 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 91 transitions. Word has length 25 [2019-08-05 10:03:24,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:24,991 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 91 transitions. [2019-08-05 10:03:24,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:03:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 91 transitions. [2019-08-05 10:03:24,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:03:24,993 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:24,993 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:24,993 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:24,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:24,994 INFO L82 PathProgramCache]: Analyzing trace with hash 122176744, now seen corresponding path program 1 times [2019-08-05 10:03:24,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:25,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:03:25,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:25,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:25,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:03:25,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:03:25,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:03:25,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:03:25,099 INFO L87 Difference]: Start difference. First operand 51 states and 91 transitions. Second operand 3 states. [2019-08-05 10:03:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:25,387 INFO L93 Difference]: Finished difference Result 57 states and 102 transitions. [2019-08-05 10:03:25,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:03:25,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-08-05 10:03:25,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:25,389 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:03:25,389 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:03:25,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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:03:25,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:03:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-08-05 10:03:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:03:25,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 89 transitions. [2019-08-05 10:03:25,398 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 89 transitions. Word has length 26 [2019-08-05 10:03:25,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:25,398 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 89 transitions. [2019-08-05 10:03:25,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:03:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 89 transitions. [2019-08-05 10:03:25,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:03:25,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:25,400 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:25,400 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:25,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:25,401 INFO L82 PathProgramCache]: Analyzing trace with hash 125811246, now seen corresponding path program 1 times [2019-08-05 10:03:25,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:25,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:03:25,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:25,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:03:25,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:03:25,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:03:25,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:03:25,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:03:25,652 INFO L87 Difference]: Start difference. First operand 51 states and 89 transitions. Second operand 7 states. [2019-08-05 10:03:26,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:26,413 INFO L93 Difference]: Finished difference Result 56 states and 97 transitions. [2019-08-05 10:03:26,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:03:26,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-08-05 10:03:26,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:26,416 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:03:26,416 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:03:26,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:03:26,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:03:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-08-05 10:03:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:03:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 90 transitions. [2019-08-05 10:03:26,425 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 90 transitions. Word has length 26 [2019-08-05 10:03:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:26,426 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 90 transitions. [2019-08-05 10:03:26,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:03:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 90 transitions. [2019-08-05 10:03:26,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:03:26,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:26,428 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:26,428 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:26,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:26,428 INFO L82 PathProgramCache]: Analyzing trace with hash -289951950, now seen corresponding path program 1 times [2019-08-05 10:03:26,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:26,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:03:26,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:26,552 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:03:26,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:26,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:03:26,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:03:26,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:03:26,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:03:26,554 INFO L87 Difference]: Start difference. First operand 52 states and 90 transitions. Second operand 6 states. [2019-08-05 10:03:27,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:27,018 INFO L93 Difference]: Finished difference Result 59 states and 102 transitions. [2019-08-05 10:03:27,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:03:27,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-08-05 10:03:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:27,019 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:03:27,019 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:03:27,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:03:27,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:03:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2019-08-05 10:03:27,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:03:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 90 transitions. [2019-08-05 10:03:27,025 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 90 transitions. Word has length 26 [2019-08-05 10:03:27,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:27,025 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 90 transitions. [2019-08-05 10:03:27,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:03:27,026 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 90 transitions. [2019-08-05 10:03:27,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:03:27,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:27,027 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:27,027 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:27,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:27,028 INFO L82 PathProgramCache]: Analyzing trace with hash -182933429, now seen corresponding path program 1 times [2019-08-05 10:03:27,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:27,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:03:27,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:27,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:27,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:27,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:03:27,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:03:27,680 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-08-05 10:03:27,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:03:28,390 WARN L188 SmtUtils]: Spent 502.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-08-05 10:03:28,393 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:03:28,665 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-08-05 10:03:28,865 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-08-05 10:03:29,106 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-08-05 10:03:31,046 WARN L188 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-08-05 10:03:31,053 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:03:31,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:31,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-08-05 10:03:31,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:03:31,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:03:31,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:03:31,055 INFO L87 Difference]: Start difference. First operand 52 states and 90 transitions. Second operand 11 states. [2019-08-05 10:03:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:39,481 INFO L93 Difference]: Finished difference Result 80 states and 141 transitions. [2019-08-05 10:03:39,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:03:39,481 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-08-05 10:03:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:39,483 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:03:39,484 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:03:39,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:03:39,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:03:39,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2019-08-05 10:03:39,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:03:39,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 125 transitions. [2019-08-05 10:03:39,493 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 125 transitions. Word has length 26 [2019-08-05 10:03:39,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:39,493 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 125 transitions. [2019-08-05 10:03:39,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:03:39,494 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 125 transitions. [2019-08-05 10:03:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:03:39,495 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:39,495 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:39,495 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:39,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:39,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1274436017, now seen corresponding path program 1 times [2019-08-05 10:03:39,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:39,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:03:39,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:39,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:39,779 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:03:39,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:39,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:03:39,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:03:39,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:03:39,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:03:39,781 INFO L87 Difference]: Start difference. First operand 71 states and 125 transitions. Second operand 8 states. [2019-08-05 10:03:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:40,360 INFO L93 Difference]: Finished difference Result 93 states and 164 transitions. [2019-08-05 10:03:40,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:03:40,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-08-05 10:03:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:40,363 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:03:40,363 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:03:40,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:03:40,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:03:40,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2019-08-05 10:03:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:03:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 138 transitions. [2019-08-05 10:03:40,372 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 138 transitions. Word has length 26 [2019-08-05 10:03:40,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:40,372 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 138 transitions. [2019-08-05 10:03:40,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:03:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 138 transitions. [2019-08-05 10:03:40,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:03:40,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:40,374 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:40,375 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:40,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:40,375 INFO L82 PathProgramCache]: Analyzing trace with hash -125855025, now seen corresponding path program 1 times [2019-08-05 10:03:40,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:40,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:03:40,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:40,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:40,490 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:40,492 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:40,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:40,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:40,700 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-08-05 10:03:40,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:40,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 10:03:40,961 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-08-05 10:03:41,256 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-08-05 10:03:41,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:41,773 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:03:41,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:41,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-08-05 10:03:41,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:03:41,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:03:41,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:03:41,774 INFO L87 Difference]: Start difference. First operand 79 states and 138 transitions. Second operand 12 states. [2019-08-05 10:03:42,918 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-08-05 10:03:45,331 WARN L188 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-08-05 10:03:46,617 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-08-05 10:03:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:47,976 INFO L93 Difference]: Finished difference Result 108 states and 190 transitions. [2019-08-05 10:03:47,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:03:47,976 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-08-05 10:03:47,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:47,978 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:03:47,978 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:03:47,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:03:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:03:47,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2019-08-05 10:03:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:03:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 167 transitions. [2019-08-05 10:03:47,988 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 167 transitions. Word has length 26 [2019-08-05 10:03:47,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:47,988 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 167 transitions. [2019-08-05 10:03:47,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:03:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 167 transitions. [2019-08-05 10:03:47,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:03:47,990 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:47,990 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:47,991 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:47,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:47,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1645369529, now seen corresponding path program 1 times [2019-08-05 10:03:47,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:48,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:03:48,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:48,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:48,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:03:48,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:03:48,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:03:48,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:03:48,146 INFO L87 Difference]: Start difference. First operand 95 states and 167 transitions. Second operand 8 states. [2019-08-05 10:03:48,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:48,604 INFO L93 Difference]: Finished difference Result 129 states and 219 transitions. [2019-08-05 10:03:48,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:03:48,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-08-05 10:03:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:48,606 INFO L225 Difference]: With dead ends: 129 [2019-08-05 10:03:48,607 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 10:03:48,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:03:48,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 10:03:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 106. [2019-08-05 10:03:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:03:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 186 transitions. [2019-08-05 10:03:48,618 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 186 transitions. Word has length 27 [2019-08-05 10:03:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:48,618 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 186 transitions. [2019-08-05 10:03:48,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:03:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 186 transitions. [2019-08-05 10:03:48,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:03:48,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:48,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:48,620 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:48,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:48,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1367505153, now seen corresponding path program 1 times [2019-08-05 10:03:48,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:48,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:03:48,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:48,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:03:48,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:03:48,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:03:48,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:03:48,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:03:48,965 INFO L87 Difference]: Start difference. First operand 106 states and 186 transitions. Second operand 10 states. [2019-08-05 10:03:49,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:49,830 INFO L93 Difference]: Finished difference Result 143 states and 249 transitions. [2019-08-05 10:03:49,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:03:49,831 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-08-05 10:03:49,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:49,833 INFO L225 Difference]: With dead ends: 143 [2019-08-05 10:03:49,833 INFO L226 Difference]: Without dead ends: 138 [2019-08-05 10:03:49,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:03:49,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-08-05 10:03:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 121. [2019-08-05 10:03:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:03:49,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 214 transitions. [2019-08-05 10:03:49,841 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 214 transitions. Word has length 27 [2019-08-05 10:03:49,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:49,841 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 214 transitions. [2019-08-05 10:03:49,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:03:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 214 transitions. [2019-08-05 10:03:49,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:03:49,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:49,843 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:49,843 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:49,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:49,844 INFO L82 PathProgramCache]: Analyzing trace with hash -393426278, now seen corresponding path program 2 times [2019-08-05 10:03:49,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:49,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:03:49,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:49,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:49,933 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:50,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:50,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:03:50,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:03:50,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:03:50,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:03:50,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:03:50,086 INFO L87 Difference]: Start difference. First operand 121 states and 214 transitions. Second operand 8 states. [2019-08-05 10:03:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:50,824 INFO L93 Difference]: Finished difference Result 124 states and 217 transitions. [2019-08-05 10:03:50,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:03:50,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-08-05 10:03:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:50,826 INFO L225 Difference]: With dead ends: 124 [2019-08-05 10:03:50,826 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:03:50,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:03:50,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:03:50,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-08-05 10:03:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 10:03:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 215 transitions. [2019-08-05 10:03:50,832 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 215 transitions. Word has length 27 [2019-08-05 10:03:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:50,832 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 215 transitions. [2019-08-05 10:03:50,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:03:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 215 transitions. [2019-08-05 10:03:50,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:03:50,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:50,834 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:50,835 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:50,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:50,835 INFO L82 PathProgramCache]: Analyzing trace with hash -397183466, now seen corresponding path program 1 times [2019-08-05 10:03:50,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:50,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:03:50,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:50,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:03:50,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:03:50,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:03:50,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:03:50,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:03:50,956 INFO L87 Difference]: Start difference. First operand 122 states and 215 transitions. Second operand 6 states. [2019-08-05 10:03:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:51,298 INFO L93 Difference]: Finished difference Result 128 states and 223 transitions. [2019-08-05 10:03:51,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:03:51,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-08-05 10:03:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:51,301 INFO L225 Difference]: With dead ends: 128 [2019-08-05 10:03:51,301 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:03:51,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:03:51,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:03:51,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2019-08-05 10:03:51,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:03:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 219 transitions. [2019-08-05 10:03:51,306 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 219 transitions. Word has length 27 [2019-08-05 10:03:51,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:51,306 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 219 transitions. [2019-08-05 10:03:51,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:03:51,307 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 219 transitions. [2019-08-05 10:03:51,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:03:51,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:51,308 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:51,308 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:51,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:51,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1604446197, now seen corresponding path program 1 times [2019-08-05 10:03:51,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:51,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:03:51,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:51,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:03:51,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:03:51,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:03:51,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:03:51,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:03:51,511 INFO L87 Difference]: Start difference. First operand 124 states and 219 transitions. Second operand 11 states. [2019-08-05 10:03:53,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:53,880 INFO L93 Difference]: Finished difference Result 194 states and 340 transitions. [2019-08-05 10:03:53,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:03:53,881 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-08-05 10:03:53,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:53,883 INFO L225 Difference]: With dead ends: 194 [2019-08-05 10:03:53,883 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 10:03:53,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:03:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 10:03:53,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 139. [2019-08-05 10:03:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 10:03:53,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 246 transitions. [2019-08-05 10:03:53,889 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 246 transitions. Word has length 27 [2019-08-05 10:03:53,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:53,890 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 246 transitions. [2019-08-05 10:03:53,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:03:53,890 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 246 transitions. [2019-08-05 10:03:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:03:53,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:53,891 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:53,891 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:53,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:53,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1374576611, now seen corresponding path program 1 times [2019-08-05 10:03:53,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:53,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:03:53,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:53,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:54,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:54,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:54,088 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:54,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:03:54,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:03:54,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:03:54,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:03:54,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:03:54,124 INFO L87 Difference]: Start difference. First operand 139 states and 246 transitions. Second operand 10 states. [2019-08-05 10:03:54,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:54,805 INFO L93 Difference]: Finished difference Result 187 states and 326 transitions. [2019-08-05 10:03:54,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:03:54,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-08-05 10:03:54,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:54,807 INFO L225 Difference]: With dead ends: 187 [2019-08-05 10:03:54,807 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 10:03:54,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:03:54,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 10:03:54,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 155. [2019-08-05 10:03:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-08-05 10:03:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 273 transitions. [2019-08-05 10:03:54,813 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 273 transitions. Word has length 27 [2019-08-05 10:03:54,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:54,814 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 273 transitions. [2019-08-05 10:03:54,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:03:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 273 transitions. [2019-08-05 10:03:54,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:03:54,815 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:54,815 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:54,815 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:54,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:54,816 INFO L82 PathProgramCache]: Analyzing trace with hash -461741233, now seen corresponding path program 1 times [2019-08-05 10:03:54,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:54,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:03:54,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:54,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:03:54,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:54,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:03:54,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:03:54,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:03:54,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:03:54,971 INFO L87 Difference]: Start difference. First operand 155 states and 273 transitions. Second operand 9 states. [2019-08-05 10:03:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:55,653 INFO L93 Difference]: Finished difference Result 168 states and 296 transitions. [2019-08-05 10:03:55,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:03:55,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-08-05 10:03:55,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:55,655 INFO L225 Difference]: With dead ends: 168 [2019-08-05 10:03:55,656 INFO L226 Difference]: Without dead ends: 168 [2019-08-05 10:03:55,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:03:55,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-05 10:03:55,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 156. [2019-08-05 10:03:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 10:03:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 275 transitions. [2019-08-05 10:03:55,661 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 275 transitions. Word has length 27 [2019-08-05 10:03:55,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:55,662 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 275 transitions. [2019-08-05 10:03:55,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:03:55,662 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 275 transitions. [2019-08-05 10:03:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:03:55,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:55,663 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:55,663 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:55,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:55,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2090282147, now seen corresponding path program 1 times [2019-08-05 10:03:55,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:55,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:03:55,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:55,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:03:55,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:03:55,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:03:55,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:03:55,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:03:55,750 INFO L87 Difference]: Start difference. First operand 156 states and 275 transitions. Second operand 7 states. [2019-08-05 10:03:56,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:56,592 INFO L93 Difference]: Finished difference Result 267 states and 461 transitions. [2019-08-05 10:03:56,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:03:56,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-08-05 10:03:56,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:56,600 INFO L225 Difference]: With dead ends: 267 [2019-08-05 10:03:56,600 INFO L226 Difference]: Without dead ends: 266 [2019-08-05 10:03:56,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:03:56,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-08-05 10:03:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 168. [2019-08-05 10:03:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 10:03:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 295 transitions. [2019-08-05 10:03:56,607 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 295 transitions. Word has length 27 [2019-08-05 10:03:56,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:56,607 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 295 transitions. [2019-08-05 10:03:56,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:03:56,608 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 295 transitions. [2019-08-05 10:03:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:03:56,608 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:56,609 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:56,609 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:56,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:56,609 INFO L82 PathProgramCache]: Analyzing trace with hash -625227046, now seen corresponding path program 1 times [2019-08-05 10:03:56,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:56,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:03:56,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:56,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:56,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:56,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:03:56,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:03:56,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:03:56,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:03:56,731 INFO L87 Difference]: Start difference. First operand 168 states and 295 transitions. Second operand 8 states. [2019-08-05 10:03:57,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:57,225 INFO L93 Difference]: Finished difference Result 309 states and 533 transitions. [2019-08-05 10:03:57,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:03:57,226 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-08-05 10:03:57,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:57,229 INFO L225 Difference]: With dead ends: 309 [2019-08-05 10:03:57,229 INFO L226 Difference]: Without dead ends: 308 [2019-08-05 10:03:57,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:03:57,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-08-05 10:03:57,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 200. [2019-08-05 10:03:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 10:03:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 355 transitions. [2019-08-05 10:03:57,236 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 355 transitions. Word has length 27 [2019-08-05 10:03:57,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:57,236 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 355 transitions. [2019-08-05 10:03:57,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:03:57,237 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 355 transitions. [2019-08-05 10:03:57,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:03:57,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:57,238 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:57,238 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:57,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:57,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1847704249, now seen corresponding path program 1 times [2019-08-05 10:03:57,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:57,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:03:57,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:57,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:03:57,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:03:57,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:03:57,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:03:57,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:03:57,667 INFO L87 Difference]: Start difference. First operand 200 states and 355 transitions. Second operand 10 states. [2019-08-05 10:03:58,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:58,358 INFO L93 Difference]: Finished difference Result 248 states and 429 transitions. [2019-08-05 10:03:58,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:03:58,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-08-05 10:03:58,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:58,361 INFO L225 Difference]: With dead ends: 248 [2019-08-05 10:03:58,361 INFO L226 Difference]: Without dead ends: 247 [2019-08-05 10:03:58,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:03:58,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-08-05 10:03:58,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 201. [2019-08-05 10:03:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-08-05 10:03:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 357 transitions. [2019-08-05 10:03:58,368 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 357 transitions. Word has length 28 [2019-08-05 10:03:58,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:58,369 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 357 transitions. [2019-08-05 10:03:58,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:03:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 357 transitions. [2019-08-05 10:03:58,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:03:58,370 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:58,370 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:58,370 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:58,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:58,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1721498191, now seen corresponding path program 1 times [2019-08-05 10:03:58,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:58,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:03:58,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:58,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:58,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:03:58,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:03:58,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:03:58,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:03:58,505 INFO L87 Difference]: Start difference. First operand 201 states and 357 transitions. Second operand 3 states. [2019-08-05 10:03:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:59,354 INFO L93 Difference]: Finished difference Result 188 states and 326 transitions. [2019-08-05 10:03:59,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:03:59,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-08-05 10:03:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:59,356 INFO L225 Difference]: With dead ends: 188 [2019-08-05 10:03:59,357 INFO L226 Difference]: Without dead ends: 170 [2019-08-05 10:03:59,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:03:59,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-05 10:03:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2019-08-05 10:03:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 10:03:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 281 transitions. [2019-08-05 10:03:59,362 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 281 transitions. Word has length 28 [2019-08-05 10:03:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:59,362 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 281 transitions. [2019-08-05 10:03:59,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:03:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 281 transitions. [2019-08-05 10:03:59,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:03:59,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:59,363 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:59,364 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:59,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:59,364 INFO L82 PathProgramCache]: Analyzing trace with hash -757538879, now seen corresponding path program 1 times [2019-08-05 10:03:59,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:59,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:03:59,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:03:59,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:59,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:03:59,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:03:59,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:03:59,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:03:59,446 INFO L87 Difference]: Start difference. First operand 165 states and 281 transitions. Second operand 6 states. [2019-08-05 10:03:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:59,843 INFO L93 Difference]: Finished difference Result 186 states and 318 transitions. [2019-08-05 10:03:59,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:03:59,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-08-05 10:03:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:59,845 INFO L225 Difference]: With dead ends: 186 [2019-08-05 10:03:59,845 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 10:03:59,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:03:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 10:03:59,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 137. [2019-08-05 10:03:59,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:03:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 233 transitions. [2019-08-05 10:03:59,851 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 233 transitions. Word has length 28 [2019-08-05 10:03:59,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:59,851 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 233 transitions. [2019-08-05 10:03:59,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:03:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 233 transitions. [2019-08-05 10:03:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:03:59,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:59,852 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:59,852 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:59,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:59,853 INFO L82 PathProgramCache]: Analyzing trace with hash 690079662, now seen corresponding path program 3 times [2019-08-05 10:03:59,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:59,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:03:59,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:59,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:59,931 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:00,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:00,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:00,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:04:00,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:04:00,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:04:00,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:00,095 INFO L87 Difference]: Start difference. First operand 137 states and 233 transitions. Second operand 11 states. [2019-08-05 10:04:00,818 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:04:01,303 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 10:04:01,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:01,669 INFO L93 Difference]: Finished difference Result 142 states and 239 transitions. [2019-08-05 10:04:01,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:04:01,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-08-05 10:04:01,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:01,671 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:04:01,672 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 10:04:01,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:04:01,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 10:04:01,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2019-08-05 10:04:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 10:04:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 234 transitions. [2019-08-05 10:04:01,676 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 234 transitions. Word has length 28 [2019-08-05 10:04:01,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:01,677 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 234 transitions. [2019-08-05 10:04:01,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:04:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 234 transitions. [2019-08-05 10:04:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:01,678 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:01,678 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:01,678 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:01,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:01,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1435974862, now seen corresponding path program 1 times [2019-08-05 10:04:01,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:01,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:04:01,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:01,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:01,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:01,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:01,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:01,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:01,713 INFO L87 Difference]: Start difference. First operand 138 states and 234 transitions. Second operand 3 states. [2019-08-05 10:04:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:01,870 INFO L93 Difference]: Finished difference Result 141 states and 238 transitions. [2019-08-05 10:04:01,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:01,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-08-05 10:04:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:01,872 INFO L225 Difference]: With dead ends: 141 [2019-08-05 10:04:01,872 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:04:01,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:04:01,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:04:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 126. [2019-08-05 10:04:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 10:04:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 206 transitions. [2019-08-05 10:04:01,877 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 206 transitions. Word has length 28 [2019-08-05 10:04:01,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:01,877 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 206 transitions. [2019-08-05 10:04:01,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:01,878 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 206 transitions. [2019-08-05 10:04:01,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:01,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:01,878 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:01,879 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:01,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:01,879 INFO L82 PathProgramCache]: Analyzing trace with hash 573606834, now seen corresponding path program 2 times [2019-08-05 10:04:01,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:01,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:04:01,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:01,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:02,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:02,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:02,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:04:02,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:04:02,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:04:02,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:02,056 INFO L87 Difference]: Start difference. First operand 126 states and 206 transitions. Second operand 7 states. [2019-08-05 10:04:02,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:02,673 INFO L93 Difference]: Finished difference Result 130 states and 210 transitions. [2019-08-05 10:04:02,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:04:02,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-08-05 10:04:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:02,676 INFO L225 Difference]: With dead ends: 130 [2019-08-05 10:04:02,676 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 10:04:02,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 10:04:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-08-05 10:04:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 10:04:02,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 206 transitions. [2019-08-05 10:04:02,680 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 206 transitions. Word has length 28 [2019-08-05 10:04:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:02,680 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 206 transitions. [2019-08-05 10:04:02,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:04:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 206 transitions. [2019-08-05 10:04:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:02,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:02,681 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:02,681 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:02,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:02,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1178639755, now seen corresponding path program 2 times [2019-08-05 10:04:02,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:02,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:04:02,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:02,814 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:02,989 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:04:03,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:03,203 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:04:03,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:04:03,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:04:03,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:04:03,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:04:03,631 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:04:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:03,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:03,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:04:03,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:04:03,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:04:03,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:04:03,720 INFO L87 Difference]: Start difference. First operand 126 states and 206 transitions. Second operand 12 states. [2019-08-05 10:04:05,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:05,349 INFO L93 Difference]: Finished difference Result 158 states and 258 transitions. [2019-08-05 10:04:05,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:04:05,350 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-08-05 10:04:05,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:05,351 INFO L225 Difference]: With dead ends: 158 [2019-08-05 10:04:05,352 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 10:04:05,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:04:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 10:04:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2019-08-05 10:04:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 10:04:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 232 transitions. [2019-08-05 10:04:05,356 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 232 transitions. Word has length 28 [2019-08-05 10:04:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:05,357 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 232 transitions. [2019-08-05 10:04:05,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:04:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 232 transitions. [2019-08-05 10:04:05,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:05,357 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:05,358 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:05,358 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:05,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:05,358 INFO L82 PathProgramCache]: Analyzing trace with hash -375659443, now seen corresponding path program 1 times [2019-08-05 10:04:05,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:05,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:04:05,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:05,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:05,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:05,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:04:05,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:04:05,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:04:05,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:04:05,409 INFO L87 Difference]: Start difference. First operand 140 states and 232 transitions. Second operand 4 states. [2019-08-05 10:04:05,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:05,658 INFO L93 Difference]: Finished difference Result 149 states and 242 transitions. [2019-08-05 10:04:05,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:05,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-08-05 10:04:05,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:05,660 INFO L225 Difference]: With dead ends: 149 [2019-08-05 10:04:05,660 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 10:04:05,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:05,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 10:04:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 138. [2019-08-05 10:04:05,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 10:04:05,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 224 transitions. [2019-08-05 10:04:05,664 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 224 transitions. Word has length 28 [2019-08-05 10:04:05,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:05,665 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 224 transitions. [2019-08-05 10:04:05,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:04:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 224 transitions. [2019-08-05 10:04:05,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:05,666 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:05,666 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:05,666 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:05,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:05,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1800383053, now seen corresponding path program 1 times [2019-08-05 10:04:05,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:05,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:04:05,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:05,924 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:06,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:06,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:04:06,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:04:06,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:04:06,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:04:06,242 INFO L87 Difference]: Start difference. First operand 138 states and 224 transitions. Second operand 12 states. [2019-08-05 10:04:10,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:10,659 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2019-08-05 10:04:10,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:04:10,660 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-08-05 10:04:10,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:10,661 INFO L225 Difference]: With dead ends: 183 [2019-08-05 10:04:10,662 INFO L226 Difference]: Without dead ends: 182 [2019-08-05 10:04:10,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:04:10,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-08-05 10:04:10,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 142. [2019-08-05 10:04:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 10:04:10,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 232 transitions. [2019-08-05 10:04:10,666 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 232 transitions. Word has length 28 [2019-08-05 10:04:10,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:10,667 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 232 transitions. [2019-08-05 10:04:10,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:04:10,667 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 232 transitions. [2019-08-05 10:04:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:10,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:10,667 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:10,668 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:10,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:10,668 INFO L82 PathProgramCache]: Analyzing trace with hash 339190411, now seen corresponding path program 2 times [2019-08-05 10:04:10,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:10,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:04:10,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:10,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:10,812 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:10,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:10,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:10,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:10,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:10,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:04:10,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:10,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:10,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:10,946 INFO L87 Difference]: Start difference. First operand 142 states and 232 transitions. Second operand 9 states. [2019-08-05 10:04:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:11,490 INFO L93 Difference]: Finished difference Result 164 states and 264 transitions. [2019-08-05 10:04:11,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:04:11,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-08-05 10:04:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:11,492 INFO L225 Difference]: With dead ends: 164 [2019-08-05 10:04:11,492 INFO L226 Difference]: Without dead ends: 160 [2019-08-05 10:04:11,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-08-05 10:04:11,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 141. [2019-08-05 10:04:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 10:04:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 227 transitions. [2019-08-05 10:04:11,496 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 227 transitions. Word has length 28 [2019-08-05 10:04:11,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:11,496 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 227 transitions. [2019-08-05 10:04:11,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 227 transitions. [2019-08-05 10:04:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:11,497 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:11,497 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:11,497 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:11,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:11,498 INFO L82 PathProgramCache]: Analyzing trace with hash -752426676, now seen corresponding path program 1 times [2019-08-05 10:04:11,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:11,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:04:11,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:11,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:11,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:11,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:11,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:11,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:11,531 INFO L87 Difference]: Start difference. First operand 141 states and 227 transitions. Second operand 3 states. [2019-08-05 10:04:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:11,639 INFO L93 Difference]: Finished difference Result 128 states and 204 transitions. [2019-08-05 10:04:11,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:11,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-08-05 10:04:11,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:11,641 INFO L225 Difference]: With dead ends: 128 [2019-08-05 10:04:11,641 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:04:11,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:04:11,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:04:11,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 10:04:11,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 10:04:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 192 transitions. [2019-08-05 10:04:11,644 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 192 transitions. Word has length 28 [2019-08-05 10:04:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:11,644 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 192 transitions. [2019-08-05 10:04:11,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 192 transitions. [2019-08-05 10:04:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:11,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:11,645 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:11,645 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:11,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:11,646 INFO L82 PathProgramCache]: Analyzing trace with hash 196411151, now seen corresponding path program 1 times [2019-08-05 10:04:11,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:11,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:04:11,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:11,709 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:11,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:12,053 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-08-05 10:04:12,408 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-08-05 10:04:12,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:12,683 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-08-05 10:04:12,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:13,017 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-08-05 10:04:13,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:13,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:13,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:13,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:04:13,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:13,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:13,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:13,126 INFO L87 Difference]: Start difference. First operand 122 states and 192 transitions. Second operand 9 states. [2019-08-05 10:04:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:13,950 INFO L93 Difference]: Finished difference Result 142 states and 221 transitions. [2019-08-05 10:04:13,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:04:13,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-08-05 10:04:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:13,952 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:04:13,952 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 10:04:13,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 10:04:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 108. [2019-08-05 10:04:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:04:13,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 168 transitions. [2019-08-05 10:04:13,955 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 168 transitions. Word has length 28 [2019-08-05 10:04:13,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:13,955 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 168 transitions. [2019-08-05 10:04:13,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:13,955 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 168 transitions. [2019-08-05 10:04:13,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:13,955 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:13,955 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:13,956 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:13,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:13,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1536158329, now seen corresponding path program 2 times [2019-08-05 10:04:13,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:13,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:04:13,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:14,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:14,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:14,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:04:14,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:14,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:14,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:14,094 INFO L87 Difference]: Start difference. First operand 108 states and 168 transitions. Second operand 9 states. [2019-08-05 10:04:14,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:14,470 INFO L93 Difference]: Finished difference Result 131 states and 194 transitions. [2019-08-05 10:04:14,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:04:14,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-08-05 10:04:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:14,472 INFO L225 Difference]: With dead ends: 131 [2019-08-05 10:04:14,472 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:04:14,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:14,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:04:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2019-08-05 10:04:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:04:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 166 transitions. [2019-08-05 10:04:14,476 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 166 transitions. Word has length 29 [2019-08-05 10:04:14,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:14,476 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 166 transitions. [2019-08-05 10:04:14,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 166 transitions. [2019-08-05 10:04:14,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:14,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:14,476 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:14,477 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:14,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:14,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1442864479, now seen corresponding path program 1 times [2019-08-05 10:04:14,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:14,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:04:14,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:14,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:15,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:15,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:04:15,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:04:15,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:04:15,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:15,039 INFO L87 Difference]: Start difference. First operand 107 states and 166 transitions. Second operand 11 states. [2019-08-05 10:04:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:15,486 INFO L93 Difference]: Finished difference Result 132 states and 194 transitions. [2019-08-05 10:04:15,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:04:15,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-08-05 10:04:15,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:15,488 INFO L225 Difference]: With dead ends: 132 [2019-08-05 10:04:15,488 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 10:04:15,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:04:15,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 10:04:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2019-08-05 10:04:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:04:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 167 transitions. [2019-08-05 10:04:15,492 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 167 transitions. Word has length 29 [2019-08-05 10:04:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:15,492 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 167 transitions. [2019-08-05 10:04:15,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:04:15,492 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 167 transitions. [2019-08-05 10:04:15,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:15,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:15,493 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:15,493 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:15,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:15,494 INFO L82 PathProgramCache]: Analyzing trace with hash -832104843, now seen corresponding path program 1 times [2019-08-05 10:04:15,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:15,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:04:15,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:15,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:15,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:15,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:15,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:15,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:04:15,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:15,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:15,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:15,587 INFO L87 Difference]: Start difference. First operand 108 states and 167 transitions. Second operand 5 states. [2019-08-05 10:04:15,996 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2019-08-05 10:04:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:17,631 INFO L93 Difference]: Finished difference Result 123 states and 194 transitions. [2019-08-05 10:04:17,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:04:17,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-08-05 10:04:17,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:17,632 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:04:17,633 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:04:17,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:04:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2019-08-05 10:04:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:04:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 183 transitions. [2019-08-05 10:04:17,636 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 183 transitions. Word has length 29 [2019-08-05 10:04:17,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:17,636 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 183 transitions. [2019-08-05 10:04:17,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 183 transitions. [2019-08-05 10:04:17,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:17,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:17,637 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:17,637 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:17,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:17,638 INFO L82 PathProgramCache]: Analyzing trace with hash -80974566, now seen corresponding path program 4 times [2019-08-05 10:04:17,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:17,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:04:17,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:17,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:17,927 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-08-05 10:04:17,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:18,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:18,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:04:18,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:04:18,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:04:18,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:04:18,097 INFO L87 Difference]: Start difference. First operand 117 states and 183 transitions. Second operand 12 states. [2019-08-05 10:04:18,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:18,855 INFO L93 Difference]: Finished difference Result 123 states and 190 transitions. [2019-08-05 10:04:18,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:04:18,856 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-08-05 10:04:18,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:18,857 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:04:18,857 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:04:18,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:04:18,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:04:18,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2019-08-05 10:04:18,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:04:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 184 transitions. [2019-08-05 10:04:18,861 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 184 transitions. Word has length 29 [2019-08-05 10:04:18,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:18,862 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 184 transitions. [2019-08-05 10:04:18,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:04:18,862 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 184 transitions. [2019-08-05 10:04:18,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:18,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:18,863 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:18,863 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:18,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:18,863 INFO L82 PathProgramCache]: Analyzing trace with hash 603335062, now seen corresponding path program 3 times [2019-08-05 10:04:18,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:18,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:04:18,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:18,974 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:19,002 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:19,394 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-08-05 10:04:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:19,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:19,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:04:19,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:04:19,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:04:19,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:19,398 INFO L87 Difference]: Start difference. First operand 118 states and 184 transitions. Second operand 8 states. [2019-08-05 10:04:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:22,173 INFO L93 Difference]: Finished difference Result 123 states and 189 transitions. [2019-08-05 10:04:22,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:04:22,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-08-05 10:04:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:22,175 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:04:22,175 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:04:22,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:22,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:04:22,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2019-08-05 10:04:22,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:04:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 184 transitions. [2019-08-05 10:04:22,179 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 184 transitions. Word has length 29 [2019-08-05 10:04:22,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:22,180 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 184 transitions. [2019-08-05 10:04:22,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:04:22,180 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 184 transitions. [2019-08-05 10:04:22,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:22,180 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:22,181 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:22,181 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:22,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:22,181 INFO L82 PathProgramCache]: Analyzing trace with hash -2115480867, now seen corresponding path program 2 times [2019-08-05 10:04:22,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:22,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:04:22,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:22,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:22,387 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:22,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:22,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:22,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:04:22,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:22,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:22,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:22,517 INFO L87 Difference]: Start difference. First operand 118 states and 184 transitions. Second operand 9 states. [2019-08-05 10:04:23,116 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-08-05 10:04:23,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:23,165 INFO L93 Difference]: Finished difference Result 122 states and 190 transitions. [2019-08-05 10:04:23,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:04:23,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-08-05 10:04:23,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:23,166 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:04:23,166 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:04:23,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:04:23,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2019-08-05 10:04:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:04:23,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 166 transitions. [2019-08-05 10:04:23,168 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 166 transitions. Word has length 29 [2019-08-05 10:04:23,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:23,169 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 166 transitions. [2019-08-05 10:04:23,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:23,169 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 166 transitions. [2019-08-05 10:04:23,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:23,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:23,169 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:23,169 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:23,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:23,170 INFO L82 PathProgramCache]: Analyzing trace with hash 24092597, now seen corresponding path program 3 times [2019-08-05 10:04:23,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:23,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:04:23,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:23,213 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:23,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:23,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:04:23,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:04:23,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:04:23,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:23,553 INFO L87 Difference]: Start difference. First operand 105 states and 166 transitions. Second operand 11 states. [2019-08-05 10:04:24,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:24,669 INFO L93 Difference]: Finished difference Result 113 states and 177 transitions. [2019-08-05 10:04:24,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:04:24,669 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-08-05 10:04:24,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:24,670 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:04:24,671 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:04:24,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:04:24,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:04:24,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2019-08-05 10:04:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:04:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 166 transitions. [2019-08-05 10:04:24,674 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 166 transitions. Word has length 29 [2019-08-05 10:04:24,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:24,675 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 166 transitions. [2019-08-05 10:04:24,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:04:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 166 transitions. [2019-08-05 10:04:24,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:24,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:24,676 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:24,676 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:24,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:24,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1461590234, now seen corresponding path program 1 times [2019-08-05 10:04:24,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:24,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:04:24,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:24,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:24,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:28,178 WARN L188 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 32 DAG size of output: 18 [2019-08-05 10:04:28,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:28,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:28,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:28,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:04:28,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:04:28,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:04:28,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:28,204 INFO L87 Difference]: Start difference. First operand 105 states and 166 transitions. Second operand 7 states. [2019-08-05 10:04:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:29,079 INFO L93 Difference]: Finished difference Result 118 states and 189 transitions. [2019-08-05 10:04:29,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:04:29,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-08-05 10:04:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:29,081 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:04:29,081 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:04:29,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:04:29,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2019-08-05 10:04:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:04:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 162 transitions. [2019-08-05 10:04:29,085 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 162 transitions. Word has length 30 [2019-08-05 10:04:29,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:29,085 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 162 transitions. [2019-08-05 10:04:29,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:04:29,085 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 162 transitions. [2019-08-05 10:04:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:29,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:29,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:29,086 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:29,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:29,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1339998453, now seen corresponding path program 1 times [2019-08-05 10:04:29,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:29,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:04:29,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:29,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:29,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:29,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:29,168 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:29,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:29,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:29,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:29,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:29,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:29,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:04:29,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:04:29,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:04:29,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:29,492 INFO L87 Difference]: Start difference. First operand 103 states and 162 transitions. Second operand 11 states. [2019-08-05 10:04:30,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:30,333 INFO L93 Difference]: Finished difference Result 141 states and 219 transitions. [2019-08-05 10:04:30,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:04:30,333 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-08-05 10:04:30,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:30,334 INFO L225 Difference]: With dead ends: 141 [2019-08-05 10:04:30,334 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:04:30,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:04:30,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:04:30,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 124. [2019-08-05 10:04:30,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:04:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 195 transitions. [2019-08-05 10:04:30,337 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 195 transitions. Word has length 30 [2019-08-05 10:04:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:30,338 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 195 transitions. [2019-08-05 10:04:30,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:04:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 195 transitions. [2019-08-05 10:04:30,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:30,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:30,339 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:30,339 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:30,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:30,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1173082468, now seen corresponding path program 1 times [2019-08-05 10:04:30,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:30,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:04:30,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:30,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:30,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:04:30,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:04:30,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:04:30,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:30,445 INFO L87 Difference]: Start difference. First operand 124 states and 195 transitions. Second operand 6 states. [2019-08-05 10:04:30,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:30,750 INFO L93 Difference]: Finished difference Result 148 states and 235 transitions. [2019-08-05 10:04:30,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:04:30,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-08-05 10:04:30,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:30,752 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:04:30,752 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:04:30,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:04:30,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 126. [2019-08-05 10:04:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 10:04:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2019-08-05 10:04:30,755 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 30 [2019-08-05 10:04:30,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:30,755 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2019-08-05 10:04:30,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:04:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2019-08-05 10:04:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:30,756 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:30,756 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:30,756 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:30,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:30,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1786148142, now seen corresponding path program 5 times [2019-08-05 10:04:30,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:30,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:04:30,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:30,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:30,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:30,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:30,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:04:30,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:04:30,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:04:30,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:04:30,973 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 12 states. [2019-08-05 10:04:31,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:31,787 INFO L93 Difference]: Finished difference Result 133 states and 206 transitions. [2019-08-05 10:04:31,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:04:31,787 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-08-05 10:04:31,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:31,789 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:04:31,789 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 10:04:31,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:04:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 10:04:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2019-08-05 10:04:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 10:04:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 199 transitions. [2019-08-05 10:04:31,792 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 199 transitions. Word has length 30 [2019-08-05 10:04:31,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:31,793 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 199 transitions. [2019-08-05 10:04:31,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:04:31,793 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 199 transitions. [2019-08-05 10:04:31,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:31,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:31,794 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:31,794 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:31,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:31,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1524910130, now seen corresponding path program 4 times [2019-08-05 10:04:31,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:31,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:04:31,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:31,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:31,877 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:04:31,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:31,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:04:31,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:31,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:31,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:31,878 INFO L87 Difference]: Start difference. First operand 127 states and 199 transitions. Second operand 5 states. [2019-08-05 10:04:32,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:32,019 INFO L93 Difference]: Finished difference Result 146 states and 232 transitions. [2019-08-05 10:04:32,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:32,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-08-05 10:04:32,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:32,021 INFO L225 Difference]: With dead ends: 146 [2019-08-05 10:04:32,021 INFO L226 Difference]: Without dead ends: 144 [2019-08-05 10:04:32,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:32,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-08-05 10:04:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 119. [2019-08-05 10:04:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:04:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 184 transitions. [2019-08-05 10:04:32,024 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 184 transitions. Word has length 30 [2019-08-05 10:04:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:32,024 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 184 transitions. [2019-08-05 10:04:32,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:32,024 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 184 transitions. [2019-08-05 10:04:32,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:32,025 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:32,025 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:32,025 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:32,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:32,025 INFO L82 PathProgramCache]: Analyzing trace with hash 748262899, now seen corresponding path program 4 times [2019-08-05 10:04:32,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:32,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:04:32,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:32,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:33,022 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-08-05 10:04:33,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:33,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:33,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:33,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:33,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:33,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:33,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:33,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:33,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:33,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:04:33,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:33,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:04:33,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:04:33,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:04:33,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:33,361 INFO L87 Difference]: Start difference. First operand 119 states and 184 transitions. Second operand 10 states. [2019-08-05 10:04:34,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:34,015 INFO L93 Difference]: Finished difference Result 187 states and 298 transitions. [2019-08-05 10:04:34,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:04:34,016 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-08-05 10:04:34,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:34,017 INFO L225 Difference]: With dead ends: 187 [2019-08-05 10:04:34,017 INFO L226 Difference]: Without dead ends: 187 [2019-08-05 10:04:34,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:04:34,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-08-05 10:04:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 135. [2019-08-05 10:04:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-08-05 10:04:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 212 transitions. [2019-08-05 10:04:34,021 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 212 transitions. Word has length 30 [2019-08-05 10:04:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:34,022 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 212 transitions. [2019-08-05 10:04:34,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:04:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 212 transitions. [2019-08-05 10:04:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:34,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:34,023 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:34,023 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:34,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:34,023 INFO L82 PathProgramCache]: Analyzing trace with hash 508476674, now seen corresponding path program 1 times [2019-08-05 10:04:34,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:34,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:04:34,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:34,248 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:34,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:34,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:04:34,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:34,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:34,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:34,262 INFO L87 Difference]: Start difference. First operand 135 states and 212 transitions. Second operand 9 states. [2019-08-05 10:04:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:34,812 INFO L93 Difference]: Finished difference Result 146 states and 231 transitions. [2019-08-05 10:04:34,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:04:34,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-08-05 10:04:34,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:34,814 INFO L225 Difference]: With dead ends: 146 [2019-08-05 10:04:34,814 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 10:04:34,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:34,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 10:04:34,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2019-08-05 10:04:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 10:04:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 220 transitions. [2019-08-05 10:04:34,817 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 220 transitions. Word has length 30 [2019-08-05 10:04:34,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:34,818 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 220 transitions. [2019-08-05 10:04:34,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 220 transitions. [2019-08-05 10:04:34,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:34,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:34,818 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:34,818 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:34,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:34,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1719379575, now seen corresponding path program 1 times [2019-08-05 10:04:34,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:34,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:04:34,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:34,933 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,991 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,997 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,997 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,000 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,001 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,001 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,002 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,003 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,003 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,004 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,027 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,033 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,040 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,057 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,061 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,066 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,070 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,071 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,071 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,073 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,074 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,076 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,077 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,089 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,090 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,092 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,109 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,116 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,118 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,120 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,121 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,122 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,123 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,123 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,125 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:35,125 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:36,344 WARN L188 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 668 DAG size of output: 20 [2019-08-05 10:04:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:04:36,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:36,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:04:36,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:04:36,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:04:36,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:36,361 INFO L87 Difference]: Start difference. First operand 140 states and 220 transitions. Second operand 8 states. [2019-08-05 10:04:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:36,912 INFO L93 Difference]: Finished difference Result 192 states and 306 transitions. [2019-08-05 10:04:36,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:04:36,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-08-05 10:04:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:36,914 INFO L225 Difference]: With dead ends: 192 [2019-08-05 10:04:36,915 INFO L226 Difference]: Without dead ends: 192 [2019-08-05 10:04:36,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-08-05 10:04:36,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 140. [2019-08-05 10:04:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 10:04:36,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 219 transitions. [2019-08-05 10:04:36,920 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 219 transitions. Word has length 30 [2019-08-05 10:04:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:36,920 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 219 transitions. [2019-08-05 10:04:36,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:04:36,920 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 219 transitions. [2019-08-05 10:04:36,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:36,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:36,921 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:36,921 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:36,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:36,921 INFO L82 PathProgramCache]: Analyzing trace with hash -264530994, now seen corresponding path program 1 times [2019-08-05 10:04:36,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:36,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:04:36,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:36,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:36,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:36,990 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:36,990 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:36,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:36,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:37,200 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 21 [2019-08-05 10:04:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:04:37,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:37,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:04:37,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:37,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:37,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:37,208 INFO L87 Difference]: Start difference. First operand 140 states and 219 transitions. Second operand 5 states. [2019-08-05 10:04:40,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:40,548 INFO L93 Difference]: Finished difference Result 148 states and 234 transitions. [2019-08-05 10:04:40,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:40,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-08-05 10:04:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:40,550 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:04:40,550 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 10:04:40,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 10:04:40,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-08-05 10:04:40,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 10:04:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 226 transitions. [2019-08-05 10:04:40,554 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 226 transitions. Word has length 31 [2019-08-05 10:04:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:40,554 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 226 transitions. [2019-08-05 10:04:40,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 226 transitions. [2019-08-05 10:04:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:40,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:40,555 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:40,555 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:40,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:40,556 INFO L82 PathProgramCache]: Analyzing trace with hash -2032545366, now seen corresponding path program 1 times [2019-08-05 10:04:40,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:40,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:04:40,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:40,634 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:40,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:40,699 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:40,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:40,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:40,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:04:40,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:04:40,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:04:40,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:04:40,772 INFO L87 Difference]: Start difference. First operand 144 states and 226 transitions. Second operand 12 states. [2019-08-05 10:04:41,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:41,885 INFO L93 Difference]: Finished difference Result 166 states and 263 transitions. [2019-08-05 10:04:41,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:04:41,885 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-08-05 10:04:41,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:41,887 INFO L225 Difference]: With dead ends: 166 [2019-08-05 10:04:41,887 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 10:04:41,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:04:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 10:04:41,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 147. [2019-08-05 10:04:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-08-05 10:04:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 231 transitions. [2019-08-05 10:04:41,890 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 231 transitions. Word has length 31 [2019-08-05 10:04:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:41,890 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 231 transitions. [2019-08-05 10:04:41,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:04:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 231 transitions. [2019-08-05 10:04:41,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:41,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:41,891 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:41,892 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:41,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:41,892 INFO L82 PathProgramCache]: Analyzing trace with hash 665447232, now seen corresponding path program 1 times [2019-08-05 10:04:41,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:41,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:04:41,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:04:42,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:42,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:04:42,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:04:42,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:04:42,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:42,082 INFO L87 Difference]: Start difference. First operand 147 states and 231 transitions. Second operand 6 states. [2019-08-05 10:04:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:42,312 INFO L93 Difference]: Finished difference Result 167 states and 264 transitions. [2019-08-05 10:04:42,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:04:42,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-08-05 10:04:42,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:42,314 INFO L225 Difference]: With dead ends: 167 [2019-08-05 10:04:42,314 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 10:04:42,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 10:04:42,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 143. [2019-08-05 10:04:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:04:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 224 transitions. [2019-08-05 10:04:42,317 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 224 transitions. Word has length 31 [2019-08-05 10:04:42,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:42,317 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 224 transitions. [2019-08-05 10:04:42,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:04:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 224 transitions. [2019-08-05 10:04:42,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:42,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:42,318 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:42,318 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:42,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:42,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1800714033, now seen corresponding path program 1 times [2019-08-05 10:04:42,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:42,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:04:42,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:42,576 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 10:04:42,818 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-08-05 10:04:42,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:42,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:42,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:04:42,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:42,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:42,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:42,935 INFO L87 Difference]: Start difference. First operand 143 states and 224 transitions. Second operand 9 states. [2019-08-05 10:04:43,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:43,321 INFO L93 Difference]: Finished difference Result 146 states and 229 transitions. [2019-08-05 10:04:43,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:04:43,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-08-05 10:04:43,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:43,323 INFO L225 Difference]: With dead ends: 146 [2019-08-05 10:04:43,323 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 10:04:43,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:43,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 10:04:43,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2019-08-05 10:04:43,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-08-05 10:04:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 224 transitions. [2019-08-05 10:04:43,326 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 224 transitions. Word has length 31 [2019-08-05 10:04:43,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:43,327 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 224 transitions. [2019-08-05 10:04:43,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:43,327 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 224 transitions. [2019-08-05 10:04:43,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:43,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:43,327 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:43,328 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:43,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:43,328 INFO L82 PathProgramCache]: Analyzing trace with hash 683894671, now seen corresponding path program 1 times [2019-08-05 10:04:43,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:43,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:04:43,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:43,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:43,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:43,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:43,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:04:43,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:04:43,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:04:43,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:04:43,814 INFO L87 Difference]: Start difference. First operand 143 states and 224 transitions. Second operand 14 states. [2019-08-05 10:04:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:44,740 INFO L93 Difference]: Finished difference Result 182 states and 280 transitions. [2019-08-05 10:04:44,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:04:44,740 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-08-05 10:04:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:44,742 INFO L225 Difference]: With dead ends: 182 [2019-08-05 10:04:44,742 INFO L226 Difference]: Without dead ends: 182 [2019-08-05 10:04:44,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:04:44,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-08-05 10:04:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 149. [2019-08-05 10:04:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 10:04:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 231 transitions. [2019-08-05 10:04:44,746 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 231 transitions. Word has length 31 [2019-08-05 10:04:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:44,746 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 231 transitions. [2019-08-05 10:04:44,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:04:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 231 transitions. [2019-08-05 10:04:44,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:44,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:44,747 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:44,747 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:44,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:44,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1999839159, now seen corresponding path program 1 times [2019-08-05 10:04:44,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:44,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:04:44,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:44,834 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:44,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:44,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:44,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:04:44,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:04:44,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:04:44,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:44,994 INFO L87 Difference]: Start difference. First operand 149 states and 231 transitions. Second operand 10 states. [2019-08-05 10:04:45,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:45,487 INFO L93 Difference]: Finished difference Result 182 states and 279 transitions. [2019-08-05 10:04:45,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:04:45,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-08-05 10:04:45,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:45,489 INFO L225 Difference]: With dead ends: 182 [2019-08-05 10:04:45,489 INFO L226 Difference]: Without dead ends: 178 [2019-08-05 10:04:45,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:04:45,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-08-05 10:04:45,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 149. [2019-08-05 10:04:45,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 10:04:45,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 230 transitions. [2019-08-05 10:04:45,492 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 230 transitions. Word has length 31 [2019-08-05 10:04:45,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:45,493 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 230 transitions. [2019-08-05 10:04:45,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:04:45,493 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 230 transitions. [2019-08-05 10:04:45,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:04:45,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:45,494 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:45,494 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:45,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:45,494 INFO L82 PathProgramCache]: Analyzing trace with hash 593704237, now seen corresponding path program 1 times [2019-08-05 10:04:45,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:45,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:04:45,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:04:45,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:45,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:45,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:45,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:45,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:45,535 INFO L87 Difference]: Start difference. First operand 149 states and 230 transitions. Second operand 3 states. [2019-08-05 10:04:45,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:45,643 INFO L93 Difference]: Finished difference Result 150 states and 231 transitions. [2019-08-05 10:04:45,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:45,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-08-05 10:04:45,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:45,645 INFO L225 Difference]: With dead ends: 150 [2019-08-05 10:04:45,645 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 10:04:45,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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:04:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 10:04:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-08-05 10:04:45,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 10:04:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 227 transitions. [2019-08-05 10:04:45,648 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 227 transitions. Word has length 31 [2019-08-05 10:04:45,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:45,648 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 227 transitions. [2019-08-05 10:04:45,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 227 transitions. [2019-08-05 10:04:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:04:45,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:45,649 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:45,649 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:45,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:45,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1596370605, now seen corresponding path program 2 times [2019-08-05 10:04:45,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:45,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:04:45,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:45,817 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:45,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:45,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:45,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:45,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:45,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:45,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:45,902 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:45,934 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:04:45,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:45,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:04:45,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:04:45,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:04:45,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:45,936 INFO L87 Difference]: Start difference. First operand 149 states and 227 transitions. Second operand 7 states. [2019-08-05 10:04:46,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:46,400 INFO L93 Difference]: Finished difference Result 155 states and 238 transitions. [2019-08-05 10:04:46,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:04:46,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-08-05 10:04:46,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:46,402 INFO L225 Difference]: With dead ends: 155 [2019-08-05 10:04:46,402 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 10:04:46,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:46,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 10:04:46,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2019-08-05 10:04:46,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-08-05 10:04:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 230 transitions. [2019-08-05 10:04:46,406 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 230 transitions. Word has length 32 [2019-08-05 10:04:46,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:46,406 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 230 transitions. [2019-08-05 10:04:46,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:04:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2019-08-05 10:04:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:04:46,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:46,407 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:46,407 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:46,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:46,407 INFO L82 PathProgramCache]: Analyzing trace with hash 338442121, now seen corresponding path program 1 times [2019-08-05 10:04:46,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:46,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:04:46,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:46,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:46,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:46,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:47,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:47,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:04:47,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:04:47,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:04:47,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=153, Unknown=1, NotChecked=0, Total=182 [2019-08-05 10:04:47,249 INFO L87 Difference]: Start difference. First operand 151 states and 230 transitions. Second operand 14 states. [2019-08-05 10:04:48,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:48,339 INFO L93 Difference]: Finished difference Result 166 states and 256 transitions. [2019-08-05 10:04:48,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:04:48,339 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-08-05 10:04:48,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:48,341 INFO L225 Difference]: With dead ends: 166 [2019-08-05 10:04:48,341 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 10:04:48,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=40, Invalid=231, Unknown=1, NotChecked=0, Total=272 [2019-08-05 10:04:48,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 10:04:48,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 159. [2019-08-05 10:04:48,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-05 10:04:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 243 transitions. [2019-08-05 10:04:48,344 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 243 transitions. Word has length 32 [2019-08-05 10:04:48,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:48,344 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 243 transitions. [2019-08-05 10:04:48,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:04:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 243 transitions. [2019-08-05 10:04:48,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:04:48,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:48,345 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:48,345 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:48,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:48,346 INFO L82 PathProgramCache]: Analyzing trace with hash -778377241, now seen corresponding path program 1 times [2019-08-05 10:04:48,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:48,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:04:48,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:04:48,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:48,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:04:48,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:48,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:48,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:48,405 INFO L87 Difference]: Start difference. First operand 159 states and 243 transitions. Second operand 5 states. [2019-08-05 10:04:48,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:48,674 INFO L93 Difference]: Finished difference Result 165 states and 247 transitions. [2019-08-05 10:04:48,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:48,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-08-05 10:04:48,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:48,676 INFO L225 Difference]: With dead ends: 165 [2019-08-05 10:04:48,676 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 10:04:48,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 10:04:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2019-08-05 10:04:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 10:04:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 242 transitions. [2019-08-05 10:04:48,680 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 242 transitions. Word has length 32 [2019-08-05 10:04:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:48,680 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 242 transitions. [2019-08-05 10:04:48,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 242 transitions. [2019-08-05 10:04:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:04:48,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:48,681 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:48,682 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:48,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:48,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1089600798, now seen corresponding path program 2 times [2019-08-05 10:04:48,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:48,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:04:48,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:49,141 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2019-08-05 10:04:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:49,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:49,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:04:49,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:04:49,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:04:49,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:49,191 INFO L87 Difference]: Start difference. First operand 161 states and 242 transitions. Second operand 11 states. [2019-08-05 10:04:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:49,670 INFO L93 Difference]: Finished difference Result 165 states and 249 transitions. [2019-08-05 10:04:49,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:04:49,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2019-08-05 10:04:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:49,672 INFO L225 Difference]: With dead ends: 165 [2019-08-05 10:04:49,672 INFO L226 Difference]: Without dead ends: 165 [2019-08-05 10:04:49,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:04:49,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-08-05 10:04:49,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2019-08-05 10:04:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 10:04:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 242 transitions. [2019-08-05 10:04:49,676 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 242 transitions. Word has length 32 [2019-08-05 10:04:49,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:49,676 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 242 transitions. [2019-08-05 10:04:49,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:04:49,676 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 242 transitions. [2019-08-05 10:04:49,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:04:49,677 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:49,677 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:49,677 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:49,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:49,678 INFO L82 PathProgramCache]: Analyzing trace with hash 2088547136, now seen corresponding path program 1 times [2019-08-05 10:04:49,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:49,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:04:49,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:49,786 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:49,786 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:49,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:49,815 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:49,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:49,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:04:49,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:04:49,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:04:49,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:49,957 INFO L87 Difference]: Start difference. First operand 161 states and 242 transitions. Second operand 10 states. [2019-08-05 10:04:50,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:50,547 INFO L93 Difference]: Finished difference Result 171 states and 258 transitions. [2019-08-05 10:04:50,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:50,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-08-05 10:04:50,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:50,548 INFO L225 Difference]: With dead ends: 171 [2019-08-05 10:04:50,548 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 10:04:50,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:50,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 10:04:50,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2019-08-05 10:04:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-08-05 10:04:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 241 transitions. [2019-08-05 10:04:50,552 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 241 transitions. Word has length 32 [2019-08-05 10:04:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:50,552 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 241 transitions. [2019-08-05 10:04:50,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:04:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 241 transitions. [2019-08-05 10:04:50,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:04:50,553 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:50,553 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:50,553 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:50,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:50,554 INFO L82 PathProgramCache]: Analyzing trace with hash -890475672, now seen corresponding path program 1 times [2019-08-05 10:04:50,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:50,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:04:50,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:50,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:50,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:50,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:50,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:50,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:04:50,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:04:50,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:04:50,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:50,724 INFO L87 Difference]: Start difference. First operand 160 states and 241 transitions. Second operand 10 states. [2019-08-05 10:04:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:51,403 INFO L93 Difference]: Finished difference Result 178 states and 264 transitions. [2019-08-05 10:04:51,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:04:51,403 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-08-05 10:04:51,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:51,405 INFO L225 Difference]: With dead ends: 178 [2019-08-05 10:04:51,405 INFO L226 Difference]: Without dead ends: 174 [2019-08-05 10:04:51,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:04:51,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-05 10:04:51,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 163. [2019-08-05 10:04:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-05 10:04:51,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-08-05 10:04:51,409 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 32 [2019-08-05 10:04:51,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:51,409 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-08-05 10:04:51,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:04:51,409 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-08-05 10:04:51,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:04:51,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:51,410 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:51,410 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:51,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:51,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1588653775, now seen corresponding path program 2 times [2019-08-05 10:04:51,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:51,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:04:51,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:51,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:51,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:51,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:51,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:04:51,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:04:51,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:04:51,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:04:51,932 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 13 states. [2019-08-05 10:04:53,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:53,010 INFO L93 Difference]: Finished difference Result 206 states and 306 transitions. [2019-08-05 10:04:53,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:04:53,011 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-08-05 10:04:53,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:53,012 INFO L225 Difference]: With dead ends: 206 [2019-08-05 10:04:53,012 INFO L226 Difference]: Without dead ends: 196 [2019-08-05 10:04:53,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:04:53,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-08-05 10:04:53,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 163. [2019-08-05 10:04:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-05 10:04:53,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-08-05 10:04:53,016 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 32 [2019-08-05 10:04:53,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:53,016 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-08-05 10:04:53,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:04:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-08-05 10:04:53,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:04:53,016 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:53,016 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:53,017 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:53,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:53,017 INFO L82 PathProgramCache]: Analyzing trace with hash 672735468, now seen corresponding path program 1 times [2019-08-05 10:04:53,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:53,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:04:53,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:53,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:53,158 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:53,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:53,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:04:53,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:53,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:04:53,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:04:53,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:04:53,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:04:53,166 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-08-05 10:04:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:53,450 INFO L93 Difference]: Finished difference Result 174 states and 264 transitions. [2019-08-05 10:04:53,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:53,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-08-05 10:04:53,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:53,452 INFO L225 Difference]: With dead ends: 174 [2019-08-05 10:04:53,452 INFO L226 Difference]: Without dead ends: 172 [2019-08-05 10:04:53,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:53,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-08-05 10:04:53,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2019-08-05 10:04:53,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 10:04:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 259 transitions. [2019-08-05 10:04:53,459 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 259 transitions. Word has length 32 [2019-08-05 10:04:53,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:53,459 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 259 transitions. [2019-08-05 10:04:53,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:04:53,459 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 259 transitions. [2019-08-05 10:04:53,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:04:53,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:53,460 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:53,460 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:53,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:53,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1023735312, now seen corresponding path program 1 times [2019-08-05 10:04:53,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:53,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:04:53,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:53,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:53,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:53,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:04:53,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:04:53,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:04:53,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:53,489 INFO L87 Difference]: Start difference. First operand 172 states and 259 transitions. Second operand 6 states. [2019-08-05 10:04:53,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:53,793 INFO L93 Difference]: Finished difference Result 173 states and 258 transitions. [2019-08-05 10:04:53,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:04:53,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-08-05 10:04:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:53,794 INFO L225 Difference]: With dead ends: 173 [2019-08-05 10:04:53,794 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:04:53,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:53,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:04:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-08-05 10:04:53,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:04:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 220 transitions. [2019-08-05 10:04:53,797 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 220 transitions. Word has length 33 [2019-08-05 10:04:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:53,797 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 220 transitions. [2019-08-05 10:04:53,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:04:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 220 transitions. [2019-08-05 10:04:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:04:53,798 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:53,798 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:53,798 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:53,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:53,798 INFO L82 PathProgramCache]: Analyzing trace with hash -994100320, now seen corresponding path program 2 times [2019-08-05 10:04:53,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:53,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:04:53,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:53,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:53,897 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:53,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:04:54,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:54,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:04:54,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:04:54,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:04:54,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:54,041 INFO L87 Difference]: Start difference. First operand 148 states and 220 transitions. Second operand 10 states. [2019-08-05 10:04:54,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:54,438 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2019-08-05 10:04:54,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:04:54,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-08-05 10:04:54,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:54,441 INFO L225 Difference]: With dead ends: 186 [2019-08-05 10:04:54,441 INFO L226 Difference]: Without dead ends: 181 [2019-08-05 10:04:54,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:04:54,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-08-05 10:04:54,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-08-05 10:04:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-05 10:04:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-08-05 10:04:54,444 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 33 [2019-08-05 10:04:54,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:54,444 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-08-05 10:04:54,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:04:54,444 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-08-05 10:04:54,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:04:54,445 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:54,445 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:54,445 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:54,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:54,445 INFO L82 PathProgramCache]: Analyzing trace with hash -204702620, now seen corresponding path program 1 times [2019-08-05 10:04:54,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:54,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:04:54,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:04:54,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:54,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:04:54,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:04:54,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:04:54,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:04:54,659 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 9 states. [2019-08-05 10:04:55,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:55,825 INFO L93 Difference]: Finished difference Result 209 states and 314 transitions. [2019-08-05 10:04:55,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:04:55,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-08-05 10:04:55,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:55,827 INFO L225 Difference]: With dead ends: 209 [2019-08-05 10:04:55,827 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 10:04:55,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:55,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 10:04:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 163. [2019-08-05 10:04:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-05 10:04:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-08-05 10:04:55,831 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 33 [2019-08-05 10:04:55,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:55,831 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-08-05 10:04:55,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:04:55,832 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-08-05 10:04:55,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:04:55,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:55,832 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:55,832 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:55,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:55,833 INFO L82 PathProgramCache]: Analyzing trace with hash -98833145, now seen corresponding path program 1 times [2019-08-05 10:04:55,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:55,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:04:55,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:04:55,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:55,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:04:55,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:55,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:55,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:55,871 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 5 states. [2019-08-05 10:04:56,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:56,032 INFO L93 Difference]: Finished difference Result 171 states and 254 transitions. [2019-08-05 10:04:56,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:04:56,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-08-05 10:04:56,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:56,034 INFO L225 Difference]: With dead ends: 171 [2019-08-05 10:04:56,034 INFO L226 Difference]: Without dead ends: 169 [2019-08-05 10:04:56,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:56,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-08-05 10:04:56,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2019-08-05 10:04:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-05 10:04:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-08-05 10:04:56,037 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 33 [2019-08-05 10:04:56,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:56,038 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-08-05 10:04:56,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-08-05 10:04:56,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:04:56,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:56,038 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:56,039 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:56,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:56,039 INFO L82 PathProgramCache]: Analyzing trace with hash 269836441, now seen corresponding path program 1 times [2019-08-05 10:04:56,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:56,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:04:56,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:56,210 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:04:56,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:56,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:04:56,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:04:56,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:04:56,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:04:56,316 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 12 states. [2019-08-05 10:04:58,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:58,279 INFO L93 Difference]: Finished difference Result 171 states and 254 transitions. [2019-08-05 10:04:58,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:04:58,279 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2019-08-05 10:04:58,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:58,280 INFO L225 Difference]: With dead ends: 171 [2019-08-05 10:04:58,281 INFO L226 Difference]: Without dead ends: 170 [2019-08-05 10:04:58,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:04:58,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-05 10:04:58,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2019-08-05 10:04:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-05 10:04:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-08-05 10:04:58,284 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 34 [2019-08-05 10:04:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:58,284 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-08-05 10:04:58,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:04:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-08-05 10:04:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:04:58,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:58,285 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:58,286 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:58,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:58,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1506891559, now seen corresponding path program 2 times [2019-08-05 10:04:58,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:58,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:04:58,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:58,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:58,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:58,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:58,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:58,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:58,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:58,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:04:58,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:04:58,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:04:58,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:58,559 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 10 states. [2019-08-05 10:04:58,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:58,995 INFO L93 Difference]: Finished difference Result 180 states and 266 transitions. [2019-08-05 10:04:58,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:04:58,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-08-05 10:04:58,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:58,997 INFO L225 Difference]: With dead ends: 180 [2019-08-05 10:04:58,998 INFO L226 Difference]: Without dead ends: 173 [2019-08-05 10:04:58,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:58,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-08-05 10:04:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 163. [2019-08-05 10:04:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-08-05 10:04:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-08-05 10:04:59,001 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 34 [2019-08-05 10:04:59,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:59,001 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-08-05 10:04:59,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:04:59,001 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-08-05 10:04:59,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:04:59,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:59,002 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:59,002 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:59,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:59,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1153532452, now seen corresponding path program 1 times [2019-08-05 10:04:59,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:59,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:04:59,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:59,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:59,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:59,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:04:59,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:59,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:04:59,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:04:59,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:04:59,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:04:59,250 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 13 states. [2019-08-05 10:05:00,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:00,721 INFO L93 Difference]: Finished difference Result 193 states and 294 transitions. [2019-08-05 10:05:00,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:05:00,722 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2019-08-05 10:05:00,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:00,723 INFO L225 Difference]: With dead ends: 193 [2019-08-05 10:05:00,724 INFO L226 Difference]: Without dead ends: 188 [2019-08-05 10:05:00,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:05:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-08-05 10:05:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 172. [2019-08-05 10:05:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-08-05 10:05:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 261 transitions. [2019-08-05 10:05:00,727 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 261 transitions. Word has length 35 [2019-08-05 10:05:00,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:00,727 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 261 transitions. [2019-08-05 10:05:00,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:05:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 261 transitions. [2019-08-05 10:05:00,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:05:00,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:00,728 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:00,729 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:00,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:00,729 INFO L82 PathProgramCache]: Analyzing trace with hash -734330127, now seen corresponding path program 1 times [2019-08-05 10:05:00,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:00,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:05:00,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:00,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:00,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:00,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:05:00,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:00,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:05:00,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:05:00,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:05:00,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:05:00,825 INFO L87 Difference]: Start difference. First operand 172 states and 261 transitions. Second operand 8 states. [2019-08-05 10:05:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:01,376 INFO L93 Difference]: Finished difference Result 201 states and 313 transitions. [2019-08-05 10:05:01,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:05:01,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-08-05 10:05:01,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:01,378 INFO L225 Difference]: With dead ends: 201 [2019-08-05 10:05:01,378 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 10:05:01,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:05:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 10:05:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 173. [2019-08-05 10:05:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-08-05 10:05:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 263 transitions. [2019-08-05 10:05:01,381 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 263 transitions. Word has length 35 [2019-08-05 10:05:01,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:01,381 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 263 transitions. [2019-08-05 10:05:01,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:05:01,381 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 263 transitions. [2019-08-05 10:05:01,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:05:01,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:01,382 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:01,382 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:01,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:01,382 INFO L82 PathProgramCache]: Analyzing trace with hash -535205001, now seen corresponding path program 1 times [2019-08-05 10:05:01,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:01,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:05:01,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:01,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:01,638 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:05:01,639 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:01,639 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:01,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:01,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:01,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:01,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:01,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:01,892 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:05:01,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:01,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:05:01,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:05:01,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:05:01,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:05:01,942 INFO L87 Difference]: Start difference. First operand 173 states and 263 transitions. Second operand 10 states. [2019-08-05 10:05:02,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:02,939 INFO L93 Difference]: Finished difference Result 200 states and 305 transitions. [2019-08-05 10:05:02,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:05:02,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-08-05 10:05:02,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:02,941 INFO L225 Difference]: With dead ends: 200 [2019-08-05 10:05:02,942 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 10:05:02,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:05:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 10:05:02,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2019-08-05 10:05:02,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-08-05 10:05:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 283 transitions. [2019-08-05 10:05:02,945 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 283 transitions. Word has length 35 [2019-08-05 10:05:02,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:02,945 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 283 transitions. [2019-08-05 10:05:02,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:05:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 283 transitions. [2019-08-05 10:05:02,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:05:02,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:02,946 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:02,946 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:02,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:02,947 INFO L82 PathProgramCache]: Analyzing trace with hash -223612529, now seen corresponding path program 2 times [2019-08-05 10:05:02,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:02,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:05:02,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:02,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,076 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,076 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,077 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,090 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,092 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,845 WARN L188 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 63 [2019-08-05 10:05:03,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:05:03,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:03,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:04,179 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2019-08-05 10:05:04,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-08-05 10:05:04,368 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 111 [2019-08-05 10:05:04,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-08-05 10:05:04,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-08-05 10:05:04,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:05:04,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:04,940 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:04,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:04,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:05,258 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-08-05 10:05:05,467 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:05:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-08-05 10:05:05,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:05,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:05:05,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:05:05,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:05:05,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:05:05,492 INFO L87 Difference]: Start difference. First operand 187 states and 283 transitions. Second operand 13 states. [2019-08-05 10:05:06,765 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2019-08-05 10:05:07,353 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 128 [2019-08-05 10:05:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:08,340 INFO L93 Difference]: Finished difference Result 235 states and 356 transitions. [2019-08-05 10:05:08,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:05:08,341 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2019-08-05 10:05:08,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:08,342 INFO L225 Difference]: With dead ends: 235 [2019-08-05 10:05:08,342 INFO L226 Difference]: Without dead ends: 233 [2019-08-05 10:05:08,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:05:08,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-08-05 10:05:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 202. [2019-08-05 10:05:08,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 10:05:08,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 306 transitions. [2019-08-05 10:05:08,345 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 306 transitions. Word has length 35 [2019-08-05 10:05:08,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:08,346 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 306 transitions. [2019-08-05 10:05:08,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:05:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 306 transitions. [2019-08-05 10:05:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:05:08,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:08,346 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:08,347 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:08,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:08,347 INFO L82 PathProgramCache]: Analyzing trace with hash -2124473545, now seen corresponding path program 1 times [2019-08-05 10:05:08,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:08,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:05:08,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:08,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:08,407 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:08,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:08,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:05:08,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:05:08,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:05:08,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:05:08,518 INFO L87 Difference]: Start difference. First operand 202 states and 306 transitions. Second operand 13 states. [2019-08-05 10:05:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:13,078 INFO L93 Difference]: Finished difference Result 230 states and 347 transitions. [2019-08-05 10:05:13,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:05:13,079 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2019-08-05 10:05:13,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:13,080 INFO L225 Difference]: With dead ends: 230 [2019-08-05 10:05:13,081 INFO L226 Difference]: Without dead ends: 229 [2019-08-05 10:05:13,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:05:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-08-05 10:05:13,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 215. [2019-08-05 10:05:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-08-05 10:05:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 324 transitions. [2019-08-05 10:05:13,085 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 324 transitions. Word has length 35 [2019-08-05 10:05:13,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:13,085 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 324 transitions. [2019-08-05 10:05:13,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:05:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 324 transitions. [2019-08-05 10:05:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:05:13,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:13,085 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:13,086 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:13,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:13,086 INFO L82 PathProgramCache]: Analyzing trace with hash -183766645, now seen corresponding path program 1 times [2019-08-05 10:05:13,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:13,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:05:13,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:13,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-08-05 10:05:13,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:13,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:05:13,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:05:13,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:05:13,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:13,174 INFO L87 Difference]: Start difference. First operand 215 states and 324 transitions. Second operand 6 states. [2019-08-05 10:05:13,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:13,371 INFO L93 Difference]: Finished difference Result 216 states and 325 transitions. [2019-08-05 10:05:13,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:05:13,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-08-05 10:05:13,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:13,373 INFO L225 Difference]: With dead ends: 216 [2019-08-05 10:05:13,373 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 10:05:13,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:13,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 10:05:13,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2019-08-05 10:05:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-08-05 10:05:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 293 transitions. [2019-08-05 10:05:13,377 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 293 transitions. Word has length 35 [2019-08-05 10:05:13,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:13,377 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 293 transitions. [2019-08-05 10:05:13,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:05:13,377 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 293 transitions. [2019-08-05 10:05:13,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:05:13,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:13,378 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:13,378 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:13,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:13,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1570796798, now seen corresponding path program 3 times [2019-08-05 10:05:13,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:13,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:05:13,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:13,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:13,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:13,538 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:05:13,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:13,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:05:13,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:05:13,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:05:13,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:05:13,638 INFO L87 Difference]: Start difference. First operand 194 states and 293 transitions. Second operand 12 states. [2019-08-05 10:05:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:14,821 INFO L93 Difference]: Finished difference Result 200 states and 303 transitions. [2019-08-05 10:05:14,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:05:14,822 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-08-05 10:05:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:14,823 INFO L225 Difference]: With dead ends: 200 [2019-08-05 10:05:14,823 INFO L226 Difference]: Without dead ends: 200 [2019-08-05 10:05:14,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:05:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-08-05 10:05:14,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 192. [2019-08-05 10:05:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-08-05 10:05:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 289 transitions. [2019-08-05 10:05:14,827 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 289 transitions. Word has length 35 [2019-08-05 10:05:14,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:14,827 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 289 transitions. [2019-08-05 10:05:14,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:05:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 289 transitions. [2019-08-05 10:05:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:05:14,828 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:14,828 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:14,828 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:14,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash 85215548, now seen corresponding path program 1 times [2019-08-05 10:05:14,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:14,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:05:14,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:15,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:15,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:05:15,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:05:15,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:05:15,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:05:15,047 INFO L87 Difference]: Start difference. First operand 192 states and 289 transitions. Second operand 5 states. [2019-08-05 10:05:15,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:15,235 INFO L93 Difference]: Finished difference Result 212 states and 306 transitions. [2019-08-05 10:05:15,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:05:15,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-08-05 10:05:15,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:15,237 INFO L225 Difference]: With dead ends: 212 [2019-08-05 10:05:15,237 INFO L226 Difference]: Without dead ends: 212 [2019-08-05 10:05:15,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:15,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-08-05 10:05:15,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 183. [2019-08-05 10:05:15,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-08-05 10:05:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 271 transitions. [2019-08-05 10:05:15,240 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 271 transitions. Word has length 36 [2019-08-05 10:05:15,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:15,241 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 271 transitions. [2019-08-05 10:05:15,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:05:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 271 transitions. [2019-08-05 10:05:15,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:05:15,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:15,241 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:15,241 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:15,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:15,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1928408866, now seen corresponding path program 2 times [2019-08-05 10:05:15,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:15,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:05:15,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:15,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:05:15,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:15,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:05:15,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:05:15,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:05:15,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:15,281 INFO L87 Difference]: Start difference. First operand 183 states and 271 transitions. Second operand 6 states. [2019-08-05 10:05:15,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:15,602 INFO L93 Difference]: Finished difference Result 208 states and 312 transitions. [2019-08-05 10:05:15,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:05:15,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-08-05 10:05:15,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:15,604 INFO L225 Difference]: With dead ends: 208 [2019-08-05 10:05:15,604 INFO L226 Difference]: Without dead ends: 208 [2019-08-05 10:05:15,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:15,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-08-05 10:05:15,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 187. [2019-08-05 10:05:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-08-05 10:05:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 279 transitions. [2019-08-05 10:05:15,608 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 279 transitions. Word has length 36 [2019-08-05 10:05:15,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:15,608 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 279 transitions. [2019-08-05 10:05:15,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:05:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 279 transitions. [2019-08-05 10:05:15,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:05:15,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:15,609 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:15,609 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:15,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:15,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1691017743, now seen corresponding path program 1 times [2019-08-05 10:05:15,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:15,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:05:15,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:15,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:15,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:05:15,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:05:15,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:05:15,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:15,713 INFO L87 Difference]: Start difference. First operand 187 states and 279 transitions. Second operand 7 states. [2019-08-05 10:05:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:16,013 INFO L93 Difference]: Finished difference Result 193 states and 288 transitions. [2019-08-05 10:05:16,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:05:16,013 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-08-05 10:05:16,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:16,015 INFO L225 Difference]: With dead ends: 193 [2019-08-05 10:05:16,015 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 10:05:16,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:05:16,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 10:05:16,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2019-08-05 10:05:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-08-05 10:05:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 275 transitions. [2019-08-05 10:05:16,018 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 275 transitions. Word has length 36 [2019-08-05 10:05:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:16,018 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 275 transitions. [2019-08-05 10:05:16,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:05:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 275 transitions. [2019-08-05 10:05:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:05:16,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:16,019 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:16,019 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:16,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:16,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1429355889, now seen corresponding path program 1 times [2019-08-05 10:05:16,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:16,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:05:16,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:16,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:16,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:05:16,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:16,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:05:16,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:05:16,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:05:16,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:16,231 INFO L87 Difference]: Start difference. First operand 185 states and 275 transitions. Second operand 9 states. [2019-08-05 10:05:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:16,672 INFO L93 Difference]: Finished difference Result 187 states and 276 transitions. [2019-08-05 10:05:16,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:05:16,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-08-05 10:05:16,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:16,674 INFO L225 Difference]: With dead ends: 187 [2019-08-05 10:05:16,674 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 10:05:16,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:05:16,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 10:05:16,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 168. [2019-08-05 10:05:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 10:05:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-08-05 10:05:16,677 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 36 [2019-08-05 10:05:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:16,678 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-08-05 10:05:16,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:05:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-08-05 10:05:16,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:05:16,678 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:16,678 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:16,679 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:16,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:16,679 INFO L82 PathProgramCache]: Analyzing trace with hash 589906545, now seen corresponding path program 2 times [2019-08-05 10:05:16,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:16,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:05:16,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:16,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:16,731 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:16,795 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:05:16,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:16,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:05:16,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:05:16,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:05:16,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:16,796 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 9 states. [2019-08-05 10:05:17,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:17,201 INFO L93 Difference]: Finished difference Result 214 states and 319 transitions. [2019-08-05 10:05:17,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:05:17,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-08-05 10:05:17,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:17,203 INFO L225 Difference]: With dead ends: 214 [2019-08-05 10:05:17,203 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 10:05:17,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:17,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 10:05:17,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 185. [2019-08-05 10:05:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-08-05 10:05:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 273 transitions. [2019-08-05 10:05:17,206 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 273 transitions. Word has length 36 [2019-08-05 10:05:17,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:17,206 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 273 transitions. [2019-08-05 10:05:17,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:05:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 273 transitions. [2019-08-05 10:05:17,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:05:17,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:17,207 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:17,207 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:17,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:17,207 INFO L82 PathProgramCache]: Analyzing trace with hash 89043405, now seen corresponding path program 1 times [2019-08-05 10:05:17,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:17,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:05:17,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:17,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:17,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:17,980 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2019-08-05 10:05:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:05:18,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:18,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:05:18,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:05:18,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:05:18,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:05:18,207 INFO L87 Difference]: Start difference. First operand 185 states and 273 transitions. Second operand 14 states. [2019-08-05 10:05:20,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:20,459 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2019-08-05 10:05:20,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:05:20,460 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-08-05 10:05:20,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:20,461 INFO L225 Difference]: With dead ends: 214 [2019-08-05 10:05:20,461 INFO L226 Difference]: Without dead ends: 206 [2019-08-05 10:05:20,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:05:20,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-08-05 10:05:20,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2019-08-05 10:05:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-08-05 10:05:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 278 transitions. [2019-08-05 10:05:20,464 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 278 transitions. Word has length 36 [2019-08-05 10:05:20,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:20,464 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 278 transitions. [2019-08-05 10:05:20,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:05:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 278 transitions. [2019-08-05 10:05:20,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:05:20,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:20,465 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:20,465 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:20,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:20,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1798819174, now seen corresponding path program 1 times [2019-08-05 10:05:20,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:20,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:05:20,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:20,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:20,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:20,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:20,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:20,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:21,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:21,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:05:21,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:05:21,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:05:21,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:05:21,068 INFO L87 Difference]: Start difference. First operand 189 states and 278 transitions. Second operand 14 states. [2019-08-05 10:05:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:22,737 INFO L93 Difference]: Finished difference Result 225 states and 329 transitions. [2019-08-05 10:05:22,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:05:22,737 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-08-05 10:05:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:22,739 INFO L225 Difference]: With dead ends: 225 [2019-08-05 10:05:22,739 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 10:05:22,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:05:22,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 10:05:22,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 193. [2019-08-05 10:05:22,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-08-05 10:05:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 285 transitions. [2019-08-05 10:05:22,743 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 285 transitions. Word has length 36 [2019-08-05 10:05:22,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:22,743 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 285 transitions. [2019-08-05 10:05:22,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:05:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 285 transitions. [2019-08-05 10:05:22,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:05:22,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:22,744 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:22,744 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:22,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:22,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1530354718, now seen corresponding path program 1 times [2019-08-05 10:05:22,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:22,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:05:22,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:22,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 10:05:22,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:22,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:05:22,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:05:22,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:05:22,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:22,785 INFO L87 Difference]: Start difference. First operand 193 states and 285 transitions. Second operand 6 states. [2019-08-05 10:05:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:23,056 INFO L93 Difference]: Finished difference Result 200 states and 284 transitions. [2019-08-05 10:05:23,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:05:23,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-08-05 10:05:23,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:23,058 INFO L225 Difference]: With dead ends: 200 [2019-08-05 10:05:23,059 INFO L226 Difference]: Without dead ends: 200 [2019-08-05 10:05:23,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:23,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-08-05 10:05:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 176. [2019-08-05 10:05:23,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 10:05:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 256 transitions. [2019-08-05 10:05:23,062 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 256 transitions. Word has length 36 [2019-08-05 10:05:23,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:23,062 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 256 transitions. [2019-08-05 10:05:23,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:05:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 256 transitions. [2019-08-05 10:05:23,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:05:23,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:23,062 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:23,063 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:23,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:23,063 INFO L82 PathProgramCache]: Analyzing trace with hash 429243520, now seen corresponding path program 2 times [2019-08-05 10:05:23,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:23,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:05:23,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:23,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:23,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:23,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:23,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:23,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:23,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:23,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:23,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:23,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:05:23,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:05:23,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:05:23,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:05:23,544 INFO L87 Difference]: Start difference. First operand 176 states and 256 transitions. Second operand 16 states. [2019-08-05 10:05:25,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:25,970 INFO L93 Difference]: Finished difference Result 197 states and 281 transitions. [2019-08-05 10:05:25,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:05:25,971 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2019-08-05 10:05:25,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:25,972 INFO L225 Difference]: With dead ends: 197 [2019-08-05 10:05:25,973 INFO L226 Difference]: Without dead ends: 190 [2019-08-05 10:05:25,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:05:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-08-05 10:05:25,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 186. [2019-08-05 10:05:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 10:05:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 270 transitions. [2019-08-05 10:05:25,976 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 270 transitions. Word has length 36 [2019-08-05 10:05:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:25,976 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 270 transitions. [2019-08-05 10:05:25,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:05:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 270 transitions. [2019-08-05 10:05:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:05:25,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:25,977 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:25,977 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:25,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:25,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1885273334, now seen corresponding path program 1 times [2019-08-05 10:05:25,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:25,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:05:25,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:26,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:26,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:26,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:05:26,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:05:26,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:05:26,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:05:26,115 INFO L87 Difference]: Start difference. First operand 186 states and 270 transitions. Second operand 10 states. [2019-08-05 10:05:26,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:26,599 INFO L93 Difference]: Finished difference Result 202 states and 286 transitions. [2019-08-05 10:05:26,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:05:26,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-08-05 10:05:26,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:26,601 INFO L225 Difference]: With dead ends: 202 [2019-08-05 10:05:26,602 INFO L226 Difference]: Without dead ends: 194 [2019-08-05 10:05:26,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:05:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-08-05 10:05:26,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 184. [2019-08-05 10:05:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 10:05:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 266 transitions. [2019-08-05 10:05:26,605 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 266 transitions. Word has length 37 [2019-08-05 10:05:26,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:26,605 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 266 transitions. [2019-08-05 10:05:26,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:05:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 266 transitions. [2019-08-05 10:05:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:05:26,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:26,605 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:26,606 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:26,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:26,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1899270460, now seen corresponding path program 1 times [2019-08-05 10:05:26,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:26,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:05:26,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:26,679 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:26,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:27,470 WARN L188 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-08-05 10:05:27,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:27,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:28,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:28,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:28,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:28,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:05:28,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:05:28,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:05:28,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=127, Unknown=1, NotChecked=0, Total=156 [2019-08-05 10:05:28,497 INFO L87 Difference]: Start difference. First operand 184 states and 266 transitions. Second operand 13 states. [2019-08-05 10:05:32,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:32,905 INFO L93 Difference]: Finished difference Result 184 states and 267 transitions. [2019-08-05 10:05:32,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:05:32,906 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2019-08-05 10:05:32,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:32,907 INFO L225 Difference]: With dead ends: 184 [2019-08-05 10:05:32,907 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 10:05:32,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=47, Invalid=192, Unknown=1, NotChecked=0, Total=240 [2019-08-05 10:05:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 10:05:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-08-05 10:05:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-08-05 10:05:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 258 transitions. [2019-08-05 10:05:32,911 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 258 transitions. Word has length 37 [2019-08-05 10:05:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:32,912 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 258 transitions. [2019-08-05 10:05:32,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:05:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 258 transitions. [2019-08-05 10:05:32,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:05:32,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:32,912 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:32,912 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:32,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:32,913 INFO L82 PathProgramCache]: Analyzing trace with hash 844850225, now seen corresponding path program 3 times [2019-08-05 10:05:32,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:32,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:05:32,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:32,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:33,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:33,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:33,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:33,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:33,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:05:33,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:33,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:05:33,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:05:33,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:05:33,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:05:33,167 INFO L87 Difference]: Start difference. First operand 177 states and 258 transitions. Second operand 12 states. [2019-08-05 10:05:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:33,784 INFO L93 Difference]: Finished difference Result 185 states and 267 transitions. [2019-08-05 10:05:33,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:05:33,785 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-08-05 10:05:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:33,786 INFO L225 Difference]: With dead ends: 185 [2019-08-05 10:05:33,786 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 10:05:33,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:05:33,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 10:05:33,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-08-05 10:05:33,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 10:05:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2019-08-05 10:05:33,790 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 37 [2019-08-05 10:05:33,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:33,790 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2019-08-05 10:05:33,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:05:33,790 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2019-08-05 10:05:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:05:33,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:33,791 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:33,791 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:33,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:33,791 INFO L82 PathProgramCache]: Analyzing trace with hash -501654381, now seen corresponding path program 3 times [2019-08-05 10:05:33,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:33,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:05:33,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:33,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:33,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:33,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:33,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:05:33,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:05:33,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:05:33,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:05:33,943 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand 10 states. [2019-08-05 10:05:34,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:34,389 INFO L93 Difference]: Finished difference Result 151 states and 219 transitions. [2019-08-05 10:05:34,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:05:34,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-08-05 10:05:34,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:34,391 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:05:34,391 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:05:34,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:05:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:05:34,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2019-08-05 10:05:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 10:05:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 210 transitions. [2019-08-05 10:05:34,394 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 210 transitions. Word has length 38 [2019-08-05 10:05:34,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:34,394 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 210 transitions. [2019-08-05 10:05:34,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:05:34,395 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2019-08-05 10:05:34,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:05:34,395 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:34,395 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:34,395 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:34,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:34,396 INFO L82 PathProgramCache]: Analyzing trace with hash -739045504, now seen corresponding path program 1 times [2019-08-05 10:05:34,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:34,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:05:34,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:34,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:05:34,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:34,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:05:34,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:05:34,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:05:34,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:34,485 INFO L87 Difference]: Start difference. First operand 145 states and 210 transitions. Second operand 6 states. [2019-08-05 10:05:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:34,716 INFO L93 Difference]: Finished difference Result 141 states and 199 transitions. [2019-08-05 10:05:34,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:05:34,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-08-05 10:05:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:34,718 INFO L225 Difference]: With dead ends: 141 [2019-08-05 10:05:34,718 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 10:05:34,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:05:34,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 10:05:34,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2019-08-05 10:05:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:05:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 187 transitions. [2019-08-05 10:05:34,721 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 187 transitions. Word has length 38 [2019-08-05 10:05:34,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:34,722 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 187 transitions. [2019-08-05 10:05:34,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:05:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 187 transitions. [2019-08-05 10:05:34,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:05:34,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:34,723 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:34,723 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:34,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:34,723 INFO L82 PathProgramCache]: Analyzing trace with hash 2118734678, now seen corresponding path program 1 times [2019-08-05 10:05:34,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:34,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:05:34,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:34,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:34,851 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:35,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:35,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:05:35,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:05:35,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:05:35,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:05:35,144 INFO L87 Difference]: Start difference. First operand 133 states and 187 transitions. Second operand 12 states. [2019-08-05 10:05:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:36,263 INFO L93 Difference]: Finished difference Result 137 states and 191 transitions. [2019-08-05 10:05:36,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:05:36,264 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-08-05 10:05:36,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:36,265 INFO L225 Difference]: With dead ends: 137 [2019-08-05 10:05:36,265 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 10:05:36,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:05:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 10:05:36,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-08-05 10:05:36,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 10:05:36,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 188 transitions. [2019-08-05 10:05:36,268 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 188 transitions. Word has length 38 [2019-08-05 10:05:36,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:36,269 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 188 transitions. [2019-08-05 10:05:36,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:05:36,269 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 188 transitions. [2019-08-05 10:05:36,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:05:36,269 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:36,270 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:36,270 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:36,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:36,270 INFO L82 PathProgramCache]: Analyzing trace with hash -787079921, now seen corresponding path program 3 times [2019-08-05 10:05:36,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:36,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:05:36,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:36,361 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:36,489 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:36,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:36,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:05:36,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:05:36,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:05:36,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:05:36,490 INFO L87 Difference]: Start difference. First operand 134 states and 188 transitions. Second operand 10 states. [2019-08-05 10:05:37,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:37,570 INFO L93 Difference]: Finished difference Result 176 states and 249 transitions. [2019-08-05 10:05:37,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:05:37,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-08-05 10:05:37,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:37,573 INFO L225 Difference]: With dead ends: 176 [2019-08-05 10:05:37,573 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 10:05:37,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:05:37,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 10:05:37,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 147. [2019-08-05 10:05:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-08-05 10:05:37,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 207 transitions. [2019-08-05 10:05:37,576 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 207 transitions. Word has length 39 [2019-08-05 10:05:37,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:37,576 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 207 transitions. [2019-08-05 10:05:37,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:05:37,576 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 207 transitions. [2019-08-05 10:05:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:05:37,577 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:37,577 INFO L399 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:37,577 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:37,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:37,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1257657970, now seen corresponding path program 2 times [2019-08-05 10:05:37,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:37,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:05:37,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:37,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:37,653 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:37,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:37,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:05:37,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:05:37,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:05:37,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:05:37,951 INFO L87 Difference]: Start difference. First operand 147 states and 207 transitions. Second operand 13 states. [2019-08-05 10:05:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:39,164 INFO L93 Difference]: Finished difference Result 151 states and 211 transitions. [2019-08-05 10:05:39,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:05:39,164 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-08-05 10:05:39,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:39,166 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:05:39,166 INFO L226 Difference]: Without dead ends: 150 [2019-08-05 10:05:39,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:05:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-08-05 10:05:39,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-08-05 10:05:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:05:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 208 transitions. [2019-08-05 10:05:39,169 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 208 transitions. Word has length 39 [2019-08-05 10:05:39,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:39,169 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 208 transitions. [2019-08-05 10:05:39,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:05:39,169 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 208 transitions. [2019-08-05 10:05:39,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:05:39,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:39,170 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:39,170 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:39,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:39,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1991640627, now seen corresponding path program 2 times [2019-08-05 10:05:39,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:39,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:05:39,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:39,227 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:39,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:39,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:39,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:39,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:05:39,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:39,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:05:39,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:05:39,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:05:39,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:39,335 INFO L87 Difference]: Start difference. First operand 148 states and 208 transitions. Second operand 9 states. [2019-08-05 10:05:40,579 WARN L188 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-08-05 10:05:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:40,653 INFO L93 Difference]: Finished difference Result 165 states and 224 transitions. [2019-08-05 10:05:40,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:05:40,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-08-05 10:05:40,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:40,655 INFO L225 Difference]: With dead ends: 165 [2019-08-05 10:05:40,655 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 10:05:40,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:05:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 10:05:40,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 125. [2019-08-05 10:05:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 10:05:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 179 transitions. [2019-08-05 10:05:40,658 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 179 transitions. Word has length 39 [2019-08-05 10:05:40,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:40,658 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 179 transitions. [2019-08-05 10:05:40,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:05:40,658 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 179 transitions. [2019-08-05 10:05:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:05:40,659 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:40,659 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:40,659 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:40,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:40,659 INFO L82 PathProgramCache]: Analyzing trace with hash -853760553, now seen corresponding path program 1 times [2019-08-05 10:05:40,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:40,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:05:40,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:05:40,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:40,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:05:40,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:05:40,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:05:40,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:05:40,768 INFO L87 Difference]: Start difference. First operand 125 states and 179 transitions. Second operand 10 states. [2019-08-05 10:05:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:41,322 INFO L93 Difference]: Finished difference Result 137 states and 199 transitions. [2019-08-05 10:05:41,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:05:41,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-08-05 10:05:41,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:41,323 INFO L225 Difference]: With dead ends: 137 [2019-08-05 10:05:41,324 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 10:05:41,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:05:41,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 10:05:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 120. [2019-08-05 10:05:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:05:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 171 transitions. [2019-08-05 10:05:41,327 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 171 transitions. Word has length 39 [2019-08-05 10:05:41,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:41,327 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 171 transitions. [2019-08-05 10:05:41,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:05:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 171 transitions. [2019-08-05 10:05:41,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:05:41,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:41,327 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:41,328 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:41,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:41,328 INFO L82 PathProgramCache]: Analyzing trace with hash 365640473, now seen corresponding path program 2 times [2019-08-05 10:05:41,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:41,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:05:41,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:41,432 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:05:41,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:41,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:05:41,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:05:41,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:05:41,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:05:41,433 INFO L87 Difference]: Start difference. First operand 120 states and 171 transitions. Second operand 11 states. [2019-08-05 10:05:41,952 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 10:05:42,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:42,542 INFO L93 Difference]: Finished difference Result 152 states and 215 transitions. [2019-08-05 10:05:42,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:05:42,543 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-08-05 10:05:42,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:42,544 INFO L225 Difference]: With dead ends: 152 [2019-08-05 10:05:42,544 INFO L226 Difference]: Without dead ends: 152 [2019-08-05 10:05:42,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:05:42,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-08-05 10:05:42,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 121. [2019-08-05 10:05:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:05:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2019-08-05 10:05:42,546 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 39 [2019-08-05 10:05:42,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:42,546 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions. [2019-08-05 10:05:42,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:05:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2019-08-05 10:05:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:05:42,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:42,547 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:42,547 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:42,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:42,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1793529218, now seen corresponding path program 1 times [2019-08-05 10:05:42,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:42,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:05:42,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:42,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:42,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:42,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:42,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 10:05:42,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:42,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:05:42,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:05:42,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:05:42,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:42,684 INFO L87 Difference]: Start difference. First operand 121 states and 173 transitions. Second operand 9 states. [2019-08-05 10:05:43,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:43,383 INFO L93 Difference]: Finished difference Result 133 states and 189 transitions. [2019-08-05 10:05:43,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:05:43,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-08-05 10:05:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:43,384 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:05:43,384 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:05:43,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:05:43,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:05:43,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-08-05 10:05:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:05:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2019-08-05 10:05:43,387 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 40 [2019-08-05 10:05:43,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:43,387 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2019-08-05 10:05:43,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:05:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2019-08-05 10:05:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:05:43,388 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:43,388 INFO L399 BasicCegarLoop]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:43,388 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:43,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:43,388 INFO L82 PathProgramCache]: Analyzing trace with hash 334083798, now seen corresponding path program 3 times [2019-08-05 10:05:43,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:43,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:05:43,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:43,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:43,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:43,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:43,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:05:43,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:05:43,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:05:43,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:05:43,910 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand 15 states. [2019-08-05 10:05:45,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:45,600 INFO L93 Difference]: Finished difference Result 117 states and 164 transitions. [2019-08-05 10:05:45,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:05:45,600 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-08-05 10:05:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:45,601 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:05:45,601 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:05:45,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:05:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:05:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2019-08-05 10:05:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:05:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2019-08-05 10:05:45,604 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 40 [2019-08-05 10:05:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:45,604 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2019-08-05 10:05:45,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:05:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2019-08-05 10:05:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:05:45,604 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:45,604 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:45,605 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:45,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:45,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1773934340, now seen corresponding path program 3 times [2019-08-05 10:05:45,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:45,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:05:45,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:46,363 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:05:46,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:46,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:05:46,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:05:46,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:05:46,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:05:46,364 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand 11 states. [2019-08-05 10:05:46,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:46,970 INFO L93 Difference]: Finished difference Result 118 states and 167 transitions. [2019-08-05 10:05:46,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:05:46,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-08-05 10:05:46,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:46,972 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:05:46,972 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:05:46,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:05:46,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:05:46,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 97. [2019-08-05 10:05:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:05:46,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2019-08-05 10:05:46,975 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 40 [2019-08-05 10:05:46,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:46,975 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2019-08-05 10:05:46,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:05:46,975 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2019-08-05 10:05:46,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:05:46,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:46,976 INFO L399 BasicCegarLoop]: trace histogram [9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:46,976 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:46,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:46,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1768055538, now seen corresponding path program 4 times [2019-08-05 10:05:46,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:47,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:05:47,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:47,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:47,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:47,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:47,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:05:47,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:05:47,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:05:47,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:05:47,499 INFO L87 Difference]: Start difference. First operand 97 states and 133 transitions. Second operand 16 states. [2019-08-05 10:05:49,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:49,556 INFO L93 Difference]: Finished difference Result 102 states and 139 transitions. [2019-08-05 10:05:49,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:05:49,557 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2019-08-05 10:05:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:49,558 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:05:49,558 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:05:49,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:05:49,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:05:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2019-08-05 10:05:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:05:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 134 transitions. [2019-08-05 10:05:49,561 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 134 transitions. Word has length 41 [2019-08-05 10:05:49,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:49,561 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 134 transitions. [2019-08-05 10:05:49,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:05:49,561 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 134 transitions. [2019-08-05 10:05:49,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:05:49,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:49,562 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:49,562 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:49,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:49,562 INFO L82 PathProgramCache]: Analyzing trace with hash 2040228488, now seen corresponding path program 1 times [2019-08-05 10:05:49,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:49,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:05:49,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:49,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:49,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:49,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 10:05:49,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:49,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:05:49,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:05:49,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:05:49,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:49,715 INFO L87 Difference]: Start difference. First operand 98 states and 134 transitions. Second operand 9 states. [2019-08-05 10:05:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:50,336 INFO L93 Difference]: Finished difference Result 112 states and 156 transitions. [2019-08-05 10:05:50,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:05:50,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-08-05 10:05:50,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:50,337 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:05:50,337 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:05:50,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:05:50,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:05:50,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 93. [2019-08-05 10:05:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:05:50,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2019-08-05 10:05:50,339 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 41 [2019-08-05 10:05:50,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:50,339 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2019-08-05 10:05:50,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:05:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2019-08-05 10:05:50,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:05:50,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:50,341 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:50,341 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:50,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:50,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1023460778, now seen corresponding path program 5 times [2019-08-05 10:05:50,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:50,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:05:50,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:50,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:50,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:51,059 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:51,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:51,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:05:51,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:05:51,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:05:51,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:05:51,060 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand 17 states. [2019-08-05 10:05:52,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:52,485 INFO L93 Difference]: Finished difference Result 98 states and 134 transitions. [2019-08-05 10:05:52,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:05:52,486 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2019-08-05 10:05:52,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:52,487 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:05:52,487 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:05:52,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:05:52,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:05:52,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2019-08-05 10:05:52,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:05:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2019-08-05 10:05:52,490 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 42 [2019-08-05 10:05:52,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:52,490 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 129 transitions. [2019-08-05 10:05:52,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:05:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2019-08-05 10:05:52,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:05:52,490 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:52,490 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:52,491 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:52,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:52,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1096799317, now seen corresponding path program 2 times [2019-08-05 10:05:52,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:52,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:05:52,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:52,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:52,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:52,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:52,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:52,632 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:05:52,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:52,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:05:52,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:05:52,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:05:52,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:52,633 INFO L87 Difference]: Start difference. First operand 94 states and 129 transitions. Second operand 9 states. [2019-08-05 10:05:53,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:53,120 INFO L93 Difference]: Finished difference Result 90 states and 125 transitions. [2019-08-05 10:05:53,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:05:53,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-08-05 10:05:53,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:53,121 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:05:53,122 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:05:53,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:05:53,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:05:53,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:05:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:05:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2019-08-05 10:05:53,124 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 97 transitions. Word has length 42 [2019-08-05 10:05:53,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:53,124 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 97 transitions. [2019-08-05 10:05:53,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:05:53,124 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2019-08-05 10:05:53,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:05:53,125 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:53,125 INFO L399 BasicCegarLoop]: trace histogram [11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:53,125 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:53,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:53,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1661120654, now seen corresponding path program 6 times [2019-08-05 10:05:53,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:53,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:05:53,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:53,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:53,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:53,479 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:53,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:53,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:05:53,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:05:53,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:05:53,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:05:53,480 INFO L87 Difference]: Start difference. First operand 70 states and 97 transitions. Second operand 18 states. [2019-08-05 10:05:54,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:54,891 INFO L93 Difference]: Finished difference Result 73 states and 101 transitions. [2019-08-05 10:05:54,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:05:54,892 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2019-08-05 10:05:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:54,892 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:05:54,892 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:05:54,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:05:54,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:05:54,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-08-05 10:05:54,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:05:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2019-08-05 10:05:54,895 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 98 transitions. Word has length 43 [2019-08-05 10:05:54,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:54,895 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 98 transitions. [2019-08-05 10:05:54,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:05:54,895 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 98 transitions. [2019-08-05 10:05:54,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:05:54,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:54,896 INFO L399 BasicCegarLoop]: trace histogram [12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:54,896 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:54,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:54,896 INFO L82 PathProgramCache]: Analyzing trace with hash 46259670, now seen corresponding path program 7 times [2019-08-05 10:05:54,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:54,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:05:54,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:54,990 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:55,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:55,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:55,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:05:55,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:05:55,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:05:55,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:05:55,427 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. Second operand 19 states. [2019-08-05 10:05:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:57,031 INFO L93 Difference]: Finished difference Result 74 states and 102 transitions. [2019-08-05 10:05:57,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:05:57,031 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2019-08-05 10:05:57,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:57,032 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:05:57,032 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:05:57,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:05:57,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:05:57,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-08-05 10:05:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:05:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2019-08-05 10:05:57,035 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 99 transitions. Word has length 44 [2019-08-05 10:05:57,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:57,035 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 99 transitions. [2019-08-05 10:05:57,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:05:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2019-08-05 10:05:57,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:05:57,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:57,036 INFO L399 BasicCegarLoop]: trace histogram [13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:57,036 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:57,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:57,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1435442162, now seen corresponding path program 8 times [2019-08-05 10:05:57,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:57,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:05:57,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:57,079 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:57,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:57,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:57,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:05:57,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:05:57,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:05:57,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:05:57,495 INFO L87 Difference]: Start difference. First operand 72 states and 99 transitions. Second operand 20 states. [2019-08-05 10:05:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:59,205 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2019-08-05 10:05:59,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:05:59,205 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2019-08-05 10:05:59,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:59,206 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:05:59,206 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:05:59,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=1115, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:05:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:05:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-08-05 10:05:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:05:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2019-08-05 10:05:59,209 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 45 [2019-08-05 10:05:59,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:59,210 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2019-08-05 10:05:59,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:05:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2019-08-05 10:05:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:05:59,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:59,210 INFO L399 BasicCegarLoop]: trace histogram [14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:59,211 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:59,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:59,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1550426454, now seen corresponding path program 9 times [2019-08-05 10:05:59,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:59,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:05:59,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:59,252 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:59,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:05:59,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:59,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:05:59,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:05:59,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:05:59,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:05:59,663 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand 21 states. [2019-08-05 10:06:01,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:01,752 INFO L93 Difference]: Finished difference Result 76 states and 104 transitions. [2019-08-05 10:06:01,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:06:01,752 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2019-08-05 10:06:01,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:01,753 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:06:01,754 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:06:01,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=1252, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:06:01,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:06:01,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-08-05 10:06:01,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:06:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 101 transitions. [2019-08-05 10:06:01,756 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 101 transitions. Word has length 46 [2019-08-05 10:06:01,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:01,756 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 101 transitions. [2019-08-05 10:06:01,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:06:01,756 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2019-08-05 10:06:01,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:06:01,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:01,757 INFO L399 BasicCegarLoop]: trace histogram [15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:01,757 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:01,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:01,757 INFO L82 PathProgramCache]: Analyzing trace with hash 819972210, now seen corresponding path program 10 times [2019-08-05 10:06:01,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:01,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:06:01,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:01,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:01,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:06:02,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:02,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:06:02,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:06:02,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:06:02,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:06:02,340 INFO L87 Difference]: Start difference. First operand 74 states and 101 transitions. Second operand 22 states. [2019-08-05 10:06:04,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:04,352 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions. [2019-08-05 10:06:04,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:06:04,352 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2019-08-05 10:06:04,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:04,353 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:06:04,353 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:06:04,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=163, Invalid=1397, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:06:04,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:06:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-08-05 10:06:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:06:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-08-05 10:06:04,356 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 47 [2019-08-05 10:06:04,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:04,356 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-08-05 10:06:04,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:06:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-08-05 10:06:04,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:06:04,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:04,357 INFO L399 BasicCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:04,357 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:04,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:04,357 INFO L82 PathProgramCache]: Analyzing trace with hash -349272874, now seen corresponding path program 11 times [2019-08-05 10:06:04,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:04,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:06:04,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:04,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:04,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:06:04,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:04,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:06:04,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:06:04,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:06:04,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:06:04,911 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 23 states. [2019-08-05 10:06:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:07,154 INFO L93 Difference]: Finished difference Result 78 states and 106 transitions. [2019-08-05 10:06:07,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:06:07,154 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-08-05 10:06:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:07,155 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:06:07,155 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:06:07,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=1550, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:06:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:06:07,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-08-05 10:06:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:06:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 103 transitions. [2019-08-05 10:06:07,158 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 103 transitions. Word has length 48 [2019-08-05 10:06:07,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:07,159 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 103 transitions. [2019-08-05 10:06:07,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:06:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 103 transitions. [2019-08-05 10:06:07,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:06:07,159 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:07,159 INFO L399 BasicCegarLoop]: trace histogram [17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:07,159 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:07,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:07,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2058835186, now seen corresponding path program 12 times [2019-08-05 10:06:07,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:07,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:06:07,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:07,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:07,386 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:06:08,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:08,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:06:08,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:06:08,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:06:08,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:06:08,031 INFO L87 Difference]: Start difference. First operand 76 states and 103 transitions. Second operand 24 states. [2019-08-05 10:06:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:10,362 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2019-08-05 10:06:10,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:06:10,363 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 49 [2019-08-05 10:06:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:10,363 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:06:10,364 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:06:10,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=181, Invalid=1711, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:06:10,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:06:10,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-08-05 10:06:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:06:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2019-08-05 10:06:10,367 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 104 transitions. Word has length 49 [2019-08-05 10:06:10,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:10,367 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 104 transitions. [2019-08-05 10:06:10,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:06:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 104 transitions. [2019-08-05 10:06:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:06:10,368 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:10,368 INFO L399 BasicCegarLoop]: trace histogram [18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:10,369 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:10,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:10,369 INFO L82 PathProgramCache]: Analyzing trace with hash -599226282, now seen corresponding path program 13 times [2019-08-05 10:06:10,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:10,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:06:10,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:10,447 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:10,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:11,318 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:06:11,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:11,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:06:11,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:06:11,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:06:11,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:06:11,319 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. Second operand 25 states. [2019-08-05 10:06:13,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:13,839 INFO L93 Difference]: Finished difference Result 80 states and 108 transitions. [2019-08-05 10:06:13,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:06:13,840 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2019-08-05 10:06:13,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:13,840 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:06:13,840 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:06:13,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=190, Invalid=1880, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:06:13,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:06:13,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-08-05 10:06:13,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:06:13,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 105 transitions. [2019-08-05 10:06:13,842 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 105 transitions. Word has length 50 [2019-08-05 10:06:13,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:13,843 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 105 transitions. [2019-08-05 10:06:13,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:06:13,843 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 105 transitions. [2019-08-05 10:06:13,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:06:13,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:13,843 INFO L399 BasicCegarLoop]: trace histogram [19, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:13,843 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:13,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:13,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1394753166, now seen corresponding path program 14 times [2019-08-05 10:06:13,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:13,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:06:13,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:13,933 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:13,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:14,546 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:06:14,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:14,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:06:14,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:06:14,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:06:14,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:06:14,548 INFO L87 Difference]: Start difference. First operand 78 states and 105 transitions. Second operand 26 states. [2019-08-05 10:06:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:17,521 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2019-08-05 10:06:17,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:06:17,522 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-08-05 10:06:17,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:17,522 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:06:17,522 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:06:17,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=199, Invalid=2057, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:06:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:06:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-08-05 10:06:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:06:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2019-08-05 10:06:17,526 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 51 [2019-08-05 10:06:17,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:17,526 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2019-08-05 10:06:17,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:06:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2019-08-05 10:06:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:06:17,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:17,527 INFO L399 BasicCegarLoop]: trace histogram [20, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:17,527 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:17,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:17,527 INFO L82 PathProgramCache]: Analyzing trace with hash -286282794, now seen corresponding path program 15 times [2019-08-05 10:06:17,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:17,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:06:17,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:17,601 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:17,643 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:06:18,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:18,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:06:18,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:06:18,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:06:18,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:06:18,327 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand 27 states. [2019-08-05 10:06:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:21,402 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2019-08-05 10:06:21,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:06:21,402 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-08-05 10:06:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:21,403 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:06:21,403 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:06:21,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=208, Invalid=2242, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:06:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:06:21,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-08-05 10:06:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:06:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 107 transitions. [2019-08-05 10:06:21,405 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 107 transitions. Word has length 52 [2019-08-05 10:06:21,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:21,406 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 107 transitions. [2019-08-05 10:06:21,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:06:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 107 transitions. [2019-08-05 10:06:21,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:06:21,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:21,407 INFO L399 BasicCegarLoop]: trace histogram [21, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:21,407 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:21,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:21,407 INFO L82 PathProgramCache]: Analyzing trace with hash -283439630, now seen corresponding path program 16 times [2019-08-05 10:06:21,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:21,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:06:21,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:21,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:21,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:06:24,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:24,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:06:24,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:06:24,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:06:24,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:06:24,520 INFO L87 Difference]: Start difference. First operand 80 states and 107 transitions. Second operand 28 states. [2019-08-05 10:06:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:27,742 INFO L93 Difference]: Finished difference Result 83 states and 111 transitions. [2019-08-05 10:06:27,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:06:27,743 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2019-08-05 10:06:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:27,743 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:06:27,744 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:06:27,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=217, Invalid=2435, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:06:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:06:27,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-05 10:06:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:06:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 108 transitions. [2019-08-05 10:06:27,746 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 108 transitions. Word has length 53 [2019-08-05 10:06:27,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:27,746 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 108 transitions. [2019-08-05 10:06:27,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:06:27,746 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 108 transitions. [2019-08-05 10:06:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:06:27,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:27,747 INFO L399 BasicCegarLoop]: trace histogram [22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:27,747 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:27,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:27,747 INFO L82 PathProgramCache]: Analyzing trace with hash -195301546, now seen corresponding path program 17 times [2019-08-05 10:06:27,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:27,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:06:27,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:27,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:27,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:06:28,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:28,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:06:28,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:06:28,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:06:28,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:06:28,700 INFO L87 Difference]: Start difference. First operand 81 states and 108 transitions. Second operand 29 states. [2019-08-05 10:06:32,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:32,147 INFO L93 Difference]: Finished difference Result 84 states and 112 transitions. [2019-08-05 10:06:32,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:06:32,147 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2019-08-05 10:06:32,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:32,148 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:06:32,148 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:06:32,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=226, Invalid=2636, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:06:32,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:06:32,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-08-05 10:06:32,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:06:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 109 transitions. [2019-08-05 10:06:32,151 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 109 transitions. Word has length 54 [2019-08-05 10:06:32,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:32,151 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 109 transitions. [2019-08-05 10:06:32,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:06:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2019-08-05 10:06:32,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:06:32,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:32,152 INFO L399 BasicCegarLoop]: trace histogram [23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:32,152 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:32,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:32,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1757988238, now seen corresponding path program 18 times [2019-08-05 10:06:32,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:32,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:06:32,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:32,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:32,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:33,093 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:06:33,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:33,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:06:33,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:06:33,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:06:33,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=790, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:06:33,094 INFO L87 Difference]: Start difference. First operand 82 states and 109 transitions. Second operand 30 states. [2019-08-05 10:06:36,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:36,699 INFO L93 Difference]: Finished difference Result 85 states and 113 transitions. [2019-08-05 10:06:36,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:06:36,700 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 55 [2019-08-05 10:06:36,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:36,700 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:06:36,701 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:06:36,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=232, Invalid=2848, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:06:36,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:06:36,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-08-05 10:06:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:06:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2019-08-05 10:06:36,703 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 110 transitions. Word has length 55 [2019-08-05 10:06:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:36,703 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 110 transitions. [2019-08-05 10:06:36,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:06:36,704 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2019-08-05 10:06:36,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:06:36,704 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:36,704 INFO L399 BasicCegarLoop]: trace histogram [24, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:36,705 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:36,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:36,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1338331862, now seen corresponding path program 19 times [2019-08-05 10:06:36,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:36,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:06:36,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:36,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:36,803 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:37,665 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:06:37,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:37,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:06:37,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:06:37,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:06:37,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:06:37,666 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. Second operand 31 states. [2019-08-05 10:06:41,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:41,349 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2019-08-05 10:06:41,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:06:41,349 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2019-08-05 10:06:41,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:41,349 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:06:41,350 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:06:41,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=238, Invalid=3068, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:06:41,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:06:41,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-08-05 10:06:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:06:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2019-08-05 10:06:41,352 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 56 [2019-08-05 10:06:41,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:41,353 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2019-08-05 10:06:41,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:06:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2019-08-05 10:06:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:06:41,354 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:41,354 INFO L399 BasicCegarLoop]: trace histogram [25, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:41,354 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:41,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:41,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1459992846, now seen corresponding path program 20 times [2019-08-05 10:06:41,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:41,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:06:41,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:41,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:41,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:06:42,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:42,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:06:42,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:06:42,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:06:42,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:06:42,497 INFO L87 Difference]: Start difference. First operand 84 states and 111 transitions. Second operand 32 states. [2019-08-05 10:06:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:46,376 INFO L93 Difference]: Finished difference Result 87 states and 115 transitions. [2019-08-05 10:06:46,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:06:46,377 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2019-08-05 10:06:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:46,377 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:06:46,377 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:06:46,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=244, Invalid=3296, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:06:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:06:46,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-08-05 10:06:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:06:46,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2019-08-05 10:06:46,379 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 57 [2019-08-05 10:06:46,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:46,379 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2019-08-05 10:06:46,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:06:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2019-08-05 10:06:46,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:06:46,380 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:46,380 INFO L399 BasicCegarLoop]: trace histogram [26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:46,380 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:46,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:46,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1986254422, now seen corresponding path program 21 times [2019-08-05 10:06:46,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:46,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:06:46,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:46,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:46,800 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-08-05 10:06:46,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:06:48,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:48,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:06:48,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:06:48,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:06:48,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:06:48,085 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. Second operand 33 states. [2019-08-05 10:06:52,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:52,373 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2019-08-05 10:06:52,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:06:52,373 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 58 [2019-08-05 10:06:52,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:52,374 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:06:52,374 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:06:52,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=250, Invalid=3532, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:06:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:06:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-08-05 10:06:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:06:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 113 transitions. [2019-08-05 10:06:52,377 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 113 transitions. Word has length 58 [2019-08-05 10:06:52,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:52,377 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 113 transitions. [2019-08-05 10:06:52,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:06:52,377 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 113 transitions. [2019-08-05 10:06:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:06:52,378 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:52,378 INFO L399 BasicCegarLoop]: trace histogram [27, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:52,378 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:52,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:52,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1445737330, now seen corresponding path program 22 times [2019-08-05 10:06:52,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:52,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:06:52,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:52,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:52,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:06:53,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:53,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:06:53,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:06:53,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:06:53,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1034, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:06:53,601 INFO L87 Difference]: Start difference. First operand 86 states and 113 transitions. Second operand 34 states. [2019-08-05 10:06:58,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:58,002 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2019-08-05 10:06:58,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:06:58,003 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 59 [2019-08-05 10:06:58,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:58,003 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:06:58,003 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:06:58,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=256, Invalid=3776, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:06:58,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:06:58,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-08-05 10:06:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:06:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2019-08-05 10:06:58,005 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 114 transitions. Word has length 59 [2019-08-05 10:06:58,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:58,006 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 114 transitions. [2019-08-05 10:06:58,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:06:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2019-08-05 10:06:58,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:06:58,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:58,006 INFO L399 BasicCegarLoop]: trace histogram [28, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:58,006 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:58,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:58,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1869576662, now seen corresponding path program 23 times [2019-08-05 10:06:58,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:58,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:06:58,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:58,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:58,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:06:59,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:59,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:06:59,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:06:59,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:06:59,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1100, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:06:59,277 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. Second operand 35 states. [2019-08-05 10:07:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:03,803 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2019-08-05 10:07:03,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:07:03,803 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 60 [2019-08-05 10:07:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:03,804 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:07:03,804 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:07:03,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=262, Invalid=4028, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:07:03,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:07:03,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-08-05 10:07:03,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:07:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 115 transitions. [2019-08-05 10:07:03,807 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 115 transitions. Word has length 60 [2019-08-05 10:07:03,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:03,807 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 115 transitions. [2019-08-05 10:07:03,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:07:03,807 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2019-08-05 10:07:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:07:03,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:03,808 INFO L399 BasicCegarLoop]: trace histogram [29, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:03,808 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:03,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:03,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2123694066, now seen corresponding path program 24 times [2019-08-05 10:07:03,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:03,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:07:03,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:03,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:03,916 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:07:05,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:05,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:07:05,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:07:05,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:07:05,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1101, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:07:05,767 INFO L87 Difference]: Start difference. First operand 88 states and 115 transitions. Second operand 35 states. [2019-08-05 10:07:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:10,555 INFO L93 Difference]: Finished difference Result 90 states and 117 transitions. [2019-08-05 10:07:10,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:07:10,556 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 61 [2019-08-05 10:07:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:10,557 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:07:10,557 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:07:10,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=89, Invalid=1101, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:07:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:07:10,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:07:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:07:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions. [2019-08-05 10:07:10,560 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 116 transitions. Word has length 61 [2019-08-05 10:07:10,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:10,560 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 116 transitions. [2019-08-05 10:07:10,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:07:10,560 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 116 transitions. [2019-08-05 10:07:10,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:07:10,561 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:10,561 INFO L399 BasicCegarLoop]: trace histogram [30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:10,561 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:10,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:10,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1411398998, now seen corresponding path program 25 times [2019-08-05 10:07:10,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:10,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:07:10,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:10,667 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:10,701 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:13,050 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:07:13,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:13,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:07:13,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:07:13,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:07:13,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:07:13,051 INFO L87 Difference]: Start difference. First operand 89 states and 116 transitions. Second operand 36 states. [2019-08-05 10:07:19,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:19,347 INFO L93 Difference]: Finished difference Result 91 states and 118 transitions. [2019-08-05 10:07:19,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:07:19,348 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 62 [2019-08-05 10:07:19,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:19,348 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:07:19,349 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:07:19,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:07:19,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:07:19,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:07:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:07:19,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 117 transitions. [2019-08-05 10:07:19,352 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 117 transitions. Word has length 62 [2019-08-05 10:07:19,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:19,352 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 117 transitions. [2019-08-05 10:07:19,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:07:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 117 transitions. [2019-08-05 10:07:19,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:07:19,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:19,353 INFO L399 BasicCegarLoop]: trace histogram [31, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:19,353 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:19,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:19,353 INFO L82 PathProgramCache]: Analyzing trace with hash 805088370, now seen corresponding path program 26 times [2019-08-05 10:07:19,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:19,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:07:19,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:19,503 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:19,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:07:21,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:21,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:07:21,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:07:21,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:07:21,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:07:21,660 INFO L87 Difference]: Start difference. First operand 90 states and 117 transitions. Second operand 37 states. [2019-08-05 10:07:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:27,227 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2019-08-05 10:07:27,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:07:27,228 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 63 [2019-08-05 10:07:27,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:27,228 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:07:27,228 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:07:27,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:07:27,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:07:27,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:07:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:07:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 118 transitions. [2019-08-05 10:07:27,231 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 118 transitions. Word has length 63 [2019-08-05 10:07:27,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:27,231 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 118 transitions. [2019-08-05 10:07:27,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:07:27,231 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2019-08-05 10:07:27,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:07:27,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:27,232 INFO L399 BasicCegarLoop]: trace histogram [32, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:27,232 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:27,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:27,233 INFO L82 PathProgramCache]: Analyzing trace with hash -810671914, now seen corresponding path program 27 times [2019-08-05 10:07:27,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:27,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:07:27,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:27,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:27,377 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:07:29,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:29,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:07:29,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:07:29,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:07:29,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1311, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:07:29,477 INFO L87 Difference]: Start difference. First operand 91 states and 118 transitions. Second operand 38 states. Received shutdown request... [2019-08-05 10:07:32,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:07:32,200 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:07:32,205 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:07:32,205 INFO L202 PluginConnector]: Adding new model RanFile070.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:07:32 BoogieIcfgContainer [2019-08-05 10:07:32,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:07:32,207 INFO L168 Benchmark]: Toolchain (without parser) took 252745.06 ms. Allocated memory was 133.7 MB in the beginning and 184.5 MB in the end (delta: 50.9 MB). Free memory was 107.8 MB in the beginning and 165.4 MB in the end (delta: -57.6 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:07:32,207 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.57 ms. Allocated memory is still 133.7 MB. Free memory was 110.1 MB in the beginning and 109.9 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:07:32,207 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.05 ms. Allocated memory is still 133.7 MB. Free memory was 107.8 MB in the beginning and 105.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:07:32,208 INFO L168 Benchmark]: Boogie Preprocessor took 72.79 ms. Allocated memory is still 133.7 MB. Free memory was 105.7 MB in the beginning and 103.7 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:07:32,208 INFO L168 Benchmark]: RCFGBuilder took 2164.13 ms. Allocated memory was 133.7 MB in the beginning and 170.9 MB in the end (delta: 37.2 MB). Free memory was 103.7 MB in the beginning and 126.6 MB in the end (delta: -22.9 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:07:32,209 INFO L168 Benchmark]: TraceAbstraction took 250460.56 ms. Allocated memory was 170.9 MB in the beginning and 184.5 MB in the end (delta: 13.6 MB). Free memory was 126.6 MB in the beginning and 165.4 MB in the end (delta: -38.8 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:07:32,212 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.57 ms. Allocated memory is still 133.7 MB. Free memory was 110.1 MB in the beginning and 109.9 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 43.05 ms. Allocated memory is still 133.7 MB. Free memory was 107.8 MB in the beginning and 105.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.79 ms. Allocated memory is still 133.7 MB. Free memory was 105.7 MB in the beginning and 103.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2164.13 ms. Allocated memory was 133.7 MB in the beginning and 170.9 MB in the end (delta: 37.2 MB). Free memory was 103.7 MB in the beginning and 126.6 MB in the end (delta: -22.9 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250460.56 ms. Allocated memory was 170.9 MB in the beginning and 184.5 MB in the end (delta: 13.6 MB). Free memory was 126.6 MB in the beginning and 165.4 MB in the end (delta: -38.8 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 272]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 272). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and FLOYD_HOARE automaton (currently 10 states, 38 states before enhancement),while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 271]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 271). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and FLOYD_HOARE automaton (currently 10 states, 38 states before enhancement),while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 270]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 270). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and FLOYD_HOARE automaton (currently 10 states, 38 states before enhancement),while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 3 error locations. TIMEOUT Result, 250.4s OverallTime, 120 OverallIterations, 32 TraceHistogramMax, 179.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7726 SDtfs, 2047 SDslu, 3084 SDs, 0 SdLazy, 91717 SolverSat, 1662 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 139.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4860 GetRequests, 2886 SyntacticMatches, 38 SemanticMatches, 1936 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6882 ImplicationChecksByTransitivity, 86.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=69, 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.3s AutomataMinimizationTime, 119 MinimizatonAttempts, 1639 StatesRemovedByMinimization, 111 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 67.1s InterpolantComputationTime, 4328 NumberOfCodeBlocks, 4328 NumberOfCodeBlocksAsserted, 120 NumberOfCheckSat, 4208 ConstructedInterpolants, 886 QuantifiedInterpolants, 2052281 SizeOfPredicates, 405 NumberOfNonLiveVariables, 13613 ConjunctsInSsa, 1901 ConjunctsInUnsatCore, 120 InterpolantComputations, 27 PerfectInterpolantSequences, 541/6678 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown