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/gascake/GasCakeWithJohoFractions01HardcodedInput.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:16:36,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:16:36,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:16:36,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:16:36,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:16:36,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:16:36,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:16:36,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:16:37,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:16:37,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:16:37,002 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:16:37,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:16:37,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:16:37,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:16:37,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:16:37,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:16:37,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:16:37,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:16:37,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:16:37,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:16:37,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:16:37,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:16:37,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:16:37,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:16:37,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:16:37,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:16:37,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:16:37,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:16:37,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:16:37,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:16:37,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:16:37,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:16:37,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:16:37,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:16:37,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:16:37,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:16:37,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:16:37,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:16:37,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:16:37,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:16:37,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:16:37,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:16:37,107 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:16:37,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:16:37,114 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:16:37,115 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:16:37,116 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/gascake/GasCakeWithJohoFractions01HardcodedInput.bpl [2019-08-05 11:16:37,116 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/gascake/GasCakeWithJohoFractions01HardcodedInput.bpl' [2019-08-05 11:16:37,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:16:37,146 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:16:37,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:16:37,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:16:37,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:16:37,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GasCakeWithJohoFractions01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GasCakeWithJohoFractions01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,180 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:16:37,180 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:16:37,180 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:16:37,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:16:37,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:16:37,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:16:37,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:16:37,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GasCakeWithJohoFractions01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:16:37,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:16:37,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:16:37,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:16:37,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GasCakeWithJohoFractions01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:16:37,270 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:16:37,270 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:16:37,271 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:16:37,527 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:16:37,529 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 11:16:37,531 INFO L202 PluginConnector]: Adding new model GasCakeWithJohoFractions01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:16:37 BoogieIcfgContainer [2019-08-05 11:16:37,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:16:37,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:16:37,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:16:37,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:16:37,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GasCakeWithJohoFractions01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/2) ... [2019-08-05 11:16:37,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30be8eb5 and model type GasCakeWithJohoFractions01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:16:37, skipping insertion in model container [2019-08-05 11:16:37,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GasCakeWithJohoFractions01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:16:37" (2/2) ... [2019-08-05 11:16:37,539 INFO L109 eAbstractionObserver]: Analyzing ICFG GasCakeWithJohoFractions01HardcodedInput.bpl [2019-08-05 11:16:37,549 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:16:37,558 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:16:37,574 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:16:37,602 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:16:37,602 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:16:37,603 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:16:37,603 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:16:37,603 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:16:37,603 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:16:37,603 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:16:37,603 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:16:37,604 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:16:37,617 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 11:16:37,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:16:37,625 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:37,626 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:16:37,628 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:37,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:37,634 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-08-05 11:16:37,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:37,733 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:16:37,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:37,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:16:37,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:16:37,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:16:37,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:16:37,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:37,942 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 4 states. [2019-08-05 11:16:38,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:38,051 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:16:38,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:16:38,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:16:38,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:38,063 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:16:38,063 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:16:38,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:16:38,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 11:16:38,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:16:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:16:38,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-08-05 11:16:38,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:38,101 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:16:38,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:16:38,102 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:16:38,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:16:38,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:38,102 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:16:38,103 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:38,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:38,103 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-08-05 11:16:38,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:38,118 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:16:38,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:38,311 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 11:16:38,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:38,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:16:38,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:16:38,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:16:38,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:38,314 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-05 11:16:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:38,397 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:16:38,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:16:38,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 11:16:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:38,400 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:16:38,400 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:16:38,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:38,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:16:38,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-08-05 11:16:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:16:38,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:16:38,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-08-05 11:16:38,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:38,404 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:16:38,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:16:38,404 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:16:38,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:16:38,404 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:38,405 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-08-05 11:16:38,405 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:38,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:38,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-08-05 11:16:38,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:38,422 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:16:38,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:38,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:38,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:16:38,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:16:38,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:16:38,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:16:38,804 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 11:16:38,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:38,947 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:16:38,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:16:38,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 11:16:38,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:38,948 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:16:38,948 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:16:38,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:16:38,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:16:38,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 11:16:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:16:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:16:38,951 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 11:16:38,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:38,952 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:16:38,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:16:38,952 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:16:38,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:16:38,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:38,953 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-08-05 11:16:38,953 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:38,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:38,954 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-08-05 11:16:38,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:38,975 WARN L254 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:16:38,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:39,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:39,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:16:39,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:16:39,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:16:39,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:16:39,362 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-08-05 11:16:39,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:39,513 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:16:39,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:16:39,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-08-05 11:16:39,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:39,516 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:16:39,516 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:16:39,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:16:39,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:16:39,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-08-05 11:16:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:16:39,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:16:39,521 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 11:16:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:39,522 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:16:39,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:16:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:16:39,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:16:39,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:39,524 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-08-05 11:16:39,524 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:39,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:39,524 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-08-05 11:16:39,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:39,569 WARN L254 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:16:39,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:40,066 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:40,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:40,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:16:40,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:16:40,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:16:40,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:16:40,071 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2019-08-05 11:16:40,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:40,232 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:16:40,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:16:40,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-08-05 11:16:40,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:40,237 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:16:40,237 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:16:40,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:16:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:16:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-08-05 11:16:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:16:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:16:40,241 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 11:16:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:40,241 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:16:40,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:16:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:16:40,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:16:40,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:40,242 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-08-05 11:16:40,243 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:40,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:40,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-08-05 11:16:40,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:40,281 WARN L254 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:16:40,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:40,648 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:40,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:40,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:16:40,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:16:40,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:16:40,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:16:40,650 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 10 states. [2019-08-05 11:16:40,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:40,837 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:16:40,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:16:40,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-08-05 11:16:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:40,839 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:16:40,839 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:16:40,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:16:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:16:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-08-05 11:16:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:16:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:16:40,844 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 11:16:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:40,844 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:16:40,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:16:40,844 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:16:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:16:40,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:40,845 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-08-05 11:16:40,845 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:40,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:40,846 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-08-05 11:16:40,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:40,873 WARN L254 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:16:40,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:41,348 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:41,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:41,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:16:41,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:16:41,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:16:41,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:16:41,350 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 11 states. [2019-08-05 11:16:41,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:41,597 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:16:41,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:16:41,598 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-08-05 11:16:41,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:41,599 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:16:41,599 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:16:41,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:16:41,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:16:41,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-08-05 11:16:41,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:16:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:16:41,603 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-08-05 11:16:41,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:41,603 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:16:41,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:16:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:16:41,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:16:41,604 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:41,604 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-08-05 11:16:41,605 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:41,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:41,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-08-05 11:16:41,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:41,638 WARN L254 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:16:41,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:42,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:42,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:16:42,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:16:42,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:16:42,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:16:42,064 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 12 states. [2019-08-05 11:16:42,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:42,230 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:16:42,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:16:42,231 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-08-05 11:16:42,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:42,231 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:16:42,231 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:16:42,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:16:42,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:16:42,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-08-05 11:16:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:16:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:16:42,235 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-08-05 11:16:42,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:42,235 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:16:42,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:16:42,235 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:16:42,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:16:42,236 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:42,236 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-08-05 11:16:42,236 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:42,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:42,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-08-05 11:16:42,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:42,272 WARN L254 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:16:42,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:42,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:42,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:16:42,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:16:42,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:16:42,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:16:42,649 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-08-05 11:16:42,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:42,868 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:16:42,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:16:42,869 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-08-05 11:16:42,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:42,871 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:16:42,871 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:16:42,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:16:42,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:16:42,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-08-05 11:16:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:16:42,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:16:42,877 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-08-05 11:16:42,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:42,877 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:16:42,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:16:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:16:42,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:16:42,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:42,878 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-08-05 11:16:42,878 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:42,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:42,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-08-05 11:16:42,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:42,911 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:16:42,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:43,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:43,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:16:43,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:16:43,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:16:43,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:16:43,333 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 14 states. [2019-08-05 11:16:43,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:43,994 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:16:43,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:16:43,995 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-08-05 11:16:43,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:43,996 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:16:43,996 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:16:43,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:16:43,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:16:44,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-08-05 11:16:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:16:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:16:44,001 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-08-05 11:16:44,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:44,002 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:16:44,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:16:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:16:44,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:16:44,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:44,003 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-08-05 11:16:44,003 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:44,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:44,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2019-08-05 11:16:44,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:44,038 WARN L254 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:16:44,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:44,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:44,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:16:44,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:16:44,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:16:44,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:16:44,507 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 15 states. [2019-08-05 11:16:44,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:44,808 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:16:44,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:16:44,808 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-08-05 11:16:44,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:44,809 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:16:44,810 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:16:44,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:16:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:16:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-08-05 11:16:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:16:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 11:16:44,814 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-08-05 11:16:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:44,814 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 11:16:44,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:16:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 11:16:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:16:44,815 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:44,815 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-08-05 11:16:44,816 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:44,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:44,816 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2019-08-05 11:16:44,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:44,859 WARN L254 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:16:44,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:45,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:45,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:16:45,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:16:45,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:16:45,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:16:45,471 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 16 states. [2019-08-05 11:16:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:45,819 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:16:45,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:16:45,819 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-08-05 11:16:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:45,820 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:16:45,820 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:16:45,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 10 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:16:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:16:45,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-08-05 11:16:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:16:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 11:16:45,824 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-08-05 11:16:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:45,824 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 11:16:45,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:16:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 11:16:45,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:16:45,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:45,827 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-08-05 11:16:45,827 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:45,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:45,828 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2019-08-05 11:16:45,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:45,890 WARN L254 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:16:45,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:46,757 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:46,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:46,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:16:46,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:16:46,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:16:46,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:16:46,759 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 17 states. [2019-08-05 11:16:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:47,136 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:16:47,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:16:47,136 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-08-05 11:16:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:47,137 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:16:47,137 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:16:47,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 11 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:16:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:16:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-08-05 11:16:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:16:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 11:16:47,142 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-08-05 11:16:47,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:47,143 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 11:16:47,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:16:47,143 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 11:16:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:16:47,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:47,144 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-08-05 11:16:47,144 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:47,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:47,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2019-08-05 11:16:47,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:47,191 WARN L254 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:16:47,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:48,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:48,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:16:48,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:16:48,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:16:48,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:16:48,192 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 18 states. [2019-08-05 11:16:48,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:48,703 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:16:48,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:16:48,704 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-08-05 11:16:48,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:48,705 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:16:48,705 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:16:48,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 12 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:16:48,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:16:48,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-08-05 11:16:48,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:16:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:16:48,711 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-08-05 11:16:48,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:48,711 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:16:48,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:16:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:16:48,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:16:48,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:48,712 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-08-05 11:16:48,712 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:48,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:48,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2019-08-05 11:16:48,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:48,801 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:16:48,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:49,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:49,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:16:49,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:16:49,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:16:49,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:16:49,592 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 19 states. [2019-08-05 11:16:50,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:50,174 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 11:16:50,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:16:50,175 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-08-05 11:16:50,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:50,176 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:16:50,176 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:16:50,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 13 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:16:50,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:16:50,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-08-05 11:16:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:16:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 11:16:50,180 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-08-05 11:16:50,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:50,181 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 11:16:50,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:16:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 11:16:50,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:16:50,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:50,182 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-08-05 11:16:50,182 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:50,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:50,182 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2019-08-05 11:16:50,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:50,260 WARN L254 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:16:50,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:51,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:51,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:16:51,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:16:51,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:16:51,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:16:51,094 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 20 states. [2019-08-05 11:16:51,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:51,776 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:16:51,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:16:51,782 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2019-08-05 11:16:51,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:51,783 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:16:51,783 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:16:51,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 14 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:16:51,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:16:51,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-08-05 11:16:51,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:16:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 11:16:51,788 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-08-05 11:16:51,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:51,789 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 11:16:51,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:16:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 11:16:51,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:16:51,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:51,790 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-08-05 11:16:51,790 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:51,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:51,790 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2019-08-05 11:16:51,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:51,869 WARN L254 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:16:51,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:52,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:52,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:16:52,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:16:52,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:16:52,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:16:52,577 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 21 states. [2019-08-05 11:16:53,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:53,201 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:16:53,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:16:53,202 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2019-08-05 11:16:53,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:53,202 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:16:53,202 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:16:53,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 15 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:16:53,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:16:53,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-08-05 11:16:53,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:16:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 11:16:53,207 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-08-05 11:16:53,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:53,207 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 11:16:53,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:16:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 11:16:53,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:16:53,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:53,209 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-08-05 11:16:53,209 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:53,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:53,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2019-08-05 11:16:53,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:53,300 WARN L254 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:16:53,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:54,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:54,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:16:54,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:16:54,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:16:54,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:16:54,009 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 22 states. [2019-08-05 11:16:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:55,188 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 11:16:55,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:16:55,188 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2019-08-05 11:16:55,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:55,189 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:16:55,189 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:16:55,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 16 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:16:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:16:55,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-08-05 11:16:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:16:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 11:16:55,194 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-08-05 11:16:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:55,194 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 11:16:55,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:16:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 11:16:55,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:16:55,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:55,195 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-08-05 11:16:55,196 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:55,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2019-08-05 11:16:55,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:55,304 WARN L254 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:16:55,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:56,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:56,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:16:56,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:16:56,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:16:56,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:16:56,665 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 23 states. [2019-08-05 11:16:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:57,587 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:16:57,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:16:57,587 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-08-05 11:16:57,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:57,588 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:16:57,588 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:16:57,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 17 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:16:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:16:57,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-08-05 11:16:57,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:16:57,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 11:16:57,593 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-08-05 11:16:57,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:57,594 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 11:16:57,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:16:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 11:16:57,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:16:57,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:57,595 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-08-05 11:16:57,595 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:57,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:57,596 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2019-08-05 11:16:57,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:57,714 WARN L254 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:16:57,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:58,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:58,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:16:58,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:16:58,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:16:58,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:16:58,717 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 24 states. [2019-08-05 11:16:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:59,564 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:16:59,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:16:59,570 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 41 [2019-08-05 11:16:59,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:59,571 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:16:59,571 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:16:59,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 18 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:16:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:16:59,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-08-05 11:16:59,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:16:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 11:16:59,575 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-08-05 11:16:59,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:59,576 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 11:16:59,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:16:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 11:16:59,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:16:59,576 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:59,577 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-08-05 11:16:59,577 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:59,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:59,577 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2019-08-05 11:16:59,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:59,779 WARN L254 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:16:59,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:00,766 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:00,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:00,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:17:00,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:17:00,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:17:00,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:17:00,768 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 25 states. [2019-08-05 11:17:01,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:01,787 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 11:17:01,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:17:01,788 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 43 [2019-08-05 11:17:01,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:01,788 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:17:01,789 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:17:01,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 19 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:17:01,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:17:01,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-08-05 11:17:01,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:17:01,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 11:17:01,799 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-08-05 11:17:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:01,800 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 11:17:01,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:17:01,800 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 11:17:01,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:17:01,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:01,801 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-08-05 11:17:01,801 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:01,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:01,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2019-08-05 11:17:01,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:02,028 WARN L254 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:17:02,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:03,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:03,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:17:03,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:17:03,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:17:03,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:17:03,162 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 26 states. [2019-08-05 11:17:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:04,222 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:17:04,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:17:04,225 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2019-08-05 11:17:04,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:04,226 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:17:04,226 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:17:04,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 20 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:17:04,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:17:04,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-08-05 11:17:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:17:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 11:17:04,229 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-08-05 11:17:04,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:04,229 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 11:17:04,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:17:04,229 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 11:17:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:17:04,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:04,230 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-08-05 11:17:04,230 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:04,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2019-08-05 11:17:04,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:04,477 WARN L254 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:17:04,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:05,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:05,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:17:05,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:17:05,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:17:05,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:17:05,597 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 27 states. [2019-08-05 11:17:06,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:06,766 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:17:06,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:17:06,766 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2019-08-05 11:17:06,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:06,767 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:17:06,767 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:17:06,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 21 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:17:06,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:17:06,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-08-05 11:17:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:17:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 11:17:06,772 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-08-05 11:17:06,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:06,772 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 11:17:06,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:17:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 11:17:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:17:06,774 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:06,774 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-08-05 11:17:06,774 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:06,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:06,774 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2019-08-05 11:17:06,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:07,085 WARN L254 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:17:07,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:08,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:08,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:17:08,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:17:08,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:17:08,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:17:08,868 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 28 states. [2019-08-05 11:17:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:10,076 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 11:17:10,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:17:10,077 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 49 [2019-08-05 11:17:10,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:10,078 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:17:10,078 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:17:10,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 22 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:17:10,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:17:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-08-05 11:17:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:17:10,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 11:17:10,083 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-08-05 11:17:10,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:10,083 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 11:17:10,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:17:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 11:17:10,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:17:10,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:10,085 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-08-05 11:17:10,085 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:10,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2019-08-05 11:17:10,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:10,296 WARN L254 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 11:17:10,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:12,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:12,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:17:12,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:17:12,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:17:12,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:17:12,584 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 29 states. [2019-08-05 11:17:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:13,887 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:17:13,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:17:13,888 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2019-08-05 11:17:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:13,889 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:17:13,889 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:17:13,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 23 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:17:13,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:17:13,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-08-05 11:17:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:17:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 11:17:13,892 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-08-05 11:17:13,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:13,892 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 11:17:13,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:17:13,893 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 11:17:13,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:17:13,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:13,893 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-08-05 11:17:13,893 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:13,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:13,894 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2019-08-05 11:17:13,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:14,118 WARN L254 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 11:17:14,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:15,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:15,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:17:15,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:17:15,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:17:15,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:17:15,596 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 30 states. [2019-08-05 11:17:17,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:17,093 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:17:17,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:17:17,093 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 53 [2019-08-05 11:17:17,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:17,094 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:17:17,094 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:17:17,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 24 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:17:17,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:17:17,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-08-05 11:17:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:17:17,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 11:17:17,098 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-08-05 11:17:17,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:17,098 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 11:17:17,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:17:17,099 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 11:17:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:17:17,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:17,099 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-08-05 11:17:17,100 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:17,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2019-08-05 11:17:17,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:17,381 WARN L254 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 11:17:17,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:18,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:18,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:17:18,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:17:18,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:17:18,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:17:18,988 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 31 states. [2019-08-05 11:17:20,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:20,517 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 11:17:20,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:17:20,517 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 55 [2019-08-05 11:17:20,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:20,518 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:17:20,519 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:17:20,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 25 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:17:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:17:20,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-08-05 11:17:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:17:20,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 11:17:20,523 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-08-05 11:17:20,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:20,523 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 11:17:20,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:17:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 11:17:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:17:20,524 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:20,524 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-08-05 11:17:20,524 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:20,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:20,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2019-08-05 11:17:20,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:20,839 WARN L254 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 11:17:20,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:22,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:22,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:17:22,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:17:22,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:17:22,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:17:22,581 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 32 states. [2019-08-05 11:17:24,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:24,255 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:17:24,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:17:24,258 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2019-08-05 11:17:24,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:24,259 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:17:24,259 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:17:24,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 26 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:17:24,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:17:24,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-08-05 11:17:24,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:17:24,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 11:17:24,261 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-08-05 11:17:24,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:24,262 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 11:17:24,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:17:24,262 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 11:17:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:17:24,262 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:24,263 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-08-05 11:17:24,263 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:24,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:24,263 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2019-08-05 11:17:24,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:24,603 WARN L254 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 11:17:24,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:26,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:26,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:17:26,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:17:26,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:17:26,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:17:26,166 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 33 states. [2019-08-05 11:17:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:28,014 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:17:28,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:17:28,015 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2019-08-05 11:17:28,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:28,016 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:17:28,016 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:17:28,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 27 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:17:28,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:17:28,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-08-05 11:17:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:17:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 11:17:28,019 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-08-05 11:17:28,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:28,020 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 11:17:28,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:17:28,020 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 11:17:28,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:17:28,021 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:28,021 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-08-05 11:17:28,021 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:28,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:28,021 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2019-08-05 11:17:28,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:28,434 WARN L254 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 11:17:28,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:30,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:30,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:17:30,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:17:30,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:17:30,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:17:30,095 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 34 states. [2019-08-05 11:17:32,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:32,132 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 11:17:32,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:17:32,132 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 61 [2019-08-05 11:17:32,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:32,133 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:17:32,133 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:17:32,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 28 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:17:32,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:17:32,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-08-05 11:17:32,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:17:32,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 11:17:32,137 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-08-05 11:17:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:32,137 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 11:17:32,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:17:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 11:17:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:17:32,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:32,137 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-08-05 11:17:32,138 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:32,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2019-08-05 11:17:32,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:32,588 WARN L254 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 11:17:32,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:34,400 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:34,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:34,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:17:34,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:17:34,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:17:34,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:17:34,401 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 35 states. [2019-08-05 11:17:36,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:36,444 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 11:17:36,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:17:36,445 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 63 [2019-08-05 11:17:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:36,446 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:17:36,446 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:17:36,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 29 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:17:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:17:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-08-05 11:17:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:17:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 11:17:36,450 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-08-05 11:17:36,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:36,450 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 11:17:36,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:17:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 11:17:36,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:17:36,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:36,451 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-08-05 11:17:36,451 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:36,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:36,451 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2019-08-05 11:17:36,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:36,947 WARN L254 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 11:17:36,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:39,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:39,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:17:39,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:17:39,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:17:39,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:17:39,114 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 36 states. [2019-08-05 11:17:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:41,290 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 11:17:41,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:17:41,291 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 65 [2019-08-05 11:17:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:41,292 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:17:41,292 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:17:41,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 30 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:17:41,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:17:41,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-08-05 11:17:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:17:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 11:17:41,296 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-08-05 11:17:41,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:41,297 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 11:17:41,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:17:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 11:17:41,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:17:41,297 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:41,297 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-08-05 11:17:41,298 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:41,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:41,298 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2019-08-05 11:17:41,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:41,862 WARN L254 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 11:17:41,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:44,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:44,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:17:44,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:17:44,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:17:44,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:17:44,084 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 37 states. [2019-08-05 11:17:46,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:46,449 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 11:17:46,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:17:46,449 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 67 [2019-08-05 11:17:46,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:46,450 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:17:46,450 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:17:46,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 31 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:17:46,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:17:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-08-05 11:17:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:17:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 11:17:46,454 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-08-05 11:17:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:46,454 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 11:17:46,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:17:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 11:17:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:17:46,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:46,455 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-08-05 11:17:46,455 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:46,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:46,456 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2019-08-05 11:17:46,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:47,090 WARN L254 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 11:17:47,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:49,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:49,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:17:49,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:17:49,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:17:49,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:17:49,495 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 38 states. [2019-08-05 11:17:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:52,070 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 11:17:52,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:17:52,071 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 69 [2019-08-05 11:17:52,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:52,072 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:17:52,072 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:17:52,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 32 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:17:52,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:17:52,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-08-05 11:17:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:17:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 11:17:52,075 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-08-05 11:17:52,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:52,075 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 11:17:52,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:17:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 11:17:52,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:17:52,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:52,076 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2019-08-05 11:17:52,076 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:52,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:52,076 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2019-08-05 11:17:52,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:52,780 WARN L254 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 11:17:52,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:55,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:55,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:17:55,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:17:55,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:17:55,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:17:55,293 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 39 states. [2019-08-05 11:17:58,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:58,022 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 11:17:58,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:17:58,023 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 71 [2019-08-05 11:17:58,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:58,024 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:17:58,025 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:17:58,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 33 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:17:58,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:17:58,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-08-05 11:17:58,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:17:58,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 11:17:58,028 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-08-05 11:17:58,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:58,028 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 11:17:58,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:17:58,028 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 11:17:58,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:17:58,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:58,029 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2019-08-05 11:17:58,029 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:58,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:58,030 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2019-08-05 11:17:58,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:58,825 WARN L254 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-05 11:17:58,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:01,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:01,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:18:01,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:18:01,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:18:01,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:18:01,330 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 40 states. [2019-08-05 11:18:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:04,205 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 11:18:04,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:18:04,206 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 73 [2019-08-05 11:18:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:04,206 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:18:04,207 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:18:04,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 34 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:18:04,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:18:04,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-08-05 11:18:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:18:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 11:18:04,210 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-08-05 11:18:04,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:04,210 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 11:18:04,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:18:04,211 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 11:18:04,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:18:04,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:04,211 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2019-08-05 11:18:04,211 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:04,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:04,212 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2019-08-05 11:18:04,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:05,088 WARN L254 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 11:18:05,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:07,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:07,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:18:07,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:18:07,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:18:07,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:18:07,678 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 41 states. [2019-08-05 11:18:10,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:10,746 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 11:18:10,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:18:10,746 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 75 [2019-08-05 11:18:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:10,747 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:18:10,747 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:18:10,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 35 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:18:10,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:18:10,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-08-05 11:18:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:18:10,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 11:18:10,752 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-08-05 11:18:10,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:10,753 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 11:18:10,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:18:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 11:18:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:18:10,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:10,754 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2019-08-05 11:18:10,755 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:10,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:10,755 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2019-08-05 11:18:10,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:11,769 WARN L254 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-05 11:18:11,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:14,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:14,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:18:14,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:18:14,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:18:14,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:18:14,728 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 42 states. [2019-08-05 11:18:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:17,908 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 11:18:17,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:18:17,914 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 77 [2019-08-05 11:18:17,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:17,915 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:18:17,915 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:18:17,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 36 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:18:17,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:18:17,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-08-05 11:18:17,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:18:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 11:18:17,917 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-08-05 11:18:17,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:17,917 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 11:18:17,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:18:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 11:18:17,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:18:17,918 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:17,918 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2019-08-05 11:18:17,919 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:17,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:17,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2019-08-05 11:18:17,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:19,017 WARN L254 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-05 11:18:19,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:22,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:22,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:18:22,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:18:22,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:18:22,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1722, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:18:22,097 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 43 states. [2019-08-05 11:18:25,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:25,535 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 11:18:25,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:18:25,536 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 79 [2019-08-05 11:18:25,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:25,537 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:18:25,537 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:18:25,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 37 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=84, Invalid=1722, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:18:25,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:18:25,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-08-05 11:18:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:18:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 11:18:25,540 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-08-05 11:18:25,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:25,540 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 11:18:25,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:18:25,540 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 11:18:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:18:25,541 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:25,541 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2019-08-05 11:18:25,541 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:25,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:25,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2019-08-05 11:18:25,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:26,753 WARN L254 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 11:18:26,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:30,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:30,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:18:30,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:18:30,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:18:30,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:18:30,081 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 44 states. [2019-08-05 11:18:33,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:33,764 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 11:18:33,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:18:33,765 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 81 [2019-08-05 11:18:33,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:33,766 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:18:33,766 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:18:33,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 38 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:18:33,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:18:33,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-08-05 11:18:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:18:33,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 11:18:33,770 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-08-05 11:18:33,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:33,770 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 11:18:33,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:18:33,770 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 11:18:33,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:18:33,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:33,771 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2019-08-05 11:18:33,771 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:33,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:33,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2019-08-05 11:18:33,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:35,124 WARN L254 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-05 11:18:35,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:38,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:38,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:38,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:18:38,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:18:38,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:18:38,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:18:38,657 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 45 states. [2019-08-05 11:18:42,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:42,473 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 11:18:42,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:18:42,473 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 83 [2019-08-05 11:18:42,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:42,474 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:18:42,475 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:18:42,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 39 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:18:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:18:42,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-08-05 11:18:42,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:18:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 11:18:42,478 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-08-05 11:18:42,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:42,479 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 11:18:42,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:18:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 11:18:42,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:18:42,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:42,480 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2019-08-05 11:18:42,480 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:42,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:42,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2019-08-05 11:18:42,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:43,981 WARN L254 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 170 conjunts are in the unsatisfiable core [2019-08-05 11:18:43,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:47,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:47,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:18:47,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:18:47,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:18:47,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:18:47,850 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 46 states. [2019-08-05 11:18:51,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:51,996 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 11:18:51,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:18:51,997 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 85 [2019-08-05 11:18:51,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:51,997 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:18:51,998 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:18:51,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 40 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=90, Invalid=1980, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:18:51,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:18:52,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-08-05 11:18:52,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:18:52,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 11:18:52,001 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-08-05 11:18:52,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:52,001 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 11:18:52,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:18:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 11:18:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:18:52,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:52,002 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2019-08-05 11:18:52,002 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:52,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:52,002 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2019-08-05 11:18:52,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:53,641 WARN L254 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 174 conjunts are in the unsatisfiable core [2019-08-05 11:18:53,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:57,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:57,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:57,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:18:57,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:18:57,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:18:57,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=2070, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:18:57,659 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 47 states. [2019-08-05 11:19:01,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:01,892 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 11:19:01,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:19:01,893 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 87 [2019-08-05 11:19:01,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:01,894 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:19:01,894 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:19:01,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 41 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=92, Invalid=2070, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:19:01,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:19:01,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-08-05 11:19:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:19:01,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 11:19:01,897 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-08-05 11:19:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:01,898 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 11:19:01,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:19:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 11:19:01,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 11:19:01,898 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:01,899 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2019-08-05 11:19:01,899 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:01,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:01,899 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2019-08-05 11:19:01,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:03,770 WARN L254 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 178 conjunts are in the unsatisfiable core [2019-08-05 11:19:03,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:07,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:07,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:19:07,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:19:07,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:19:07,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:19:07,983 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 48 states. [2019-08-05 11:19:12,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:12,467 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 11:19:12,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:19:12,468 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 89 [2019-08-05 11:19:12,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:12,469 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:19:12,469 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:19:12,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 42 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:19:12,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:19:12,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-08-05 11:19:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:19:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 11:19:12,472 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-08-05 11:19:12,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:12,473 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 11:19:12,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:19:12,473 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 11:19:12,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:19:12,474 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:12,474 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2019-08-05 11:19:12,474 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:12,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:12,475 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2019-08-05 11:19:12,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:14,514 WARN L254 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 182 conjunts are in the unsatisfiable core [2019-08-05 11:19:14,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:18,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:18,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:19:18,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:19:18,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:19:18,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=2256, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:19:18,815 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 49 states. [2019-08-05 11:19:23,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:23,541 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 11:19:23,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:19:23,542 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 91 [2019-08-05 11:19:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:23,543 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:19:23,543 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:19:23,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 43 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=96, Invalid=2256, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:19:23,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:19:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-08-05 11:19:23,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:19:23,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 11:19:23,547 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-08-05 11:19:23,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:23,548 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 11:19:23,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:19:23,548 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 11:19:23,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:19:23,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:23,549 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2019-08-05 11:19:23,549 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:23,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:23,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2019-08-05 11:19:23,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:25,668 WARN L254 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 186 conjunts are in the unsatisfiable core [2019-08-05 11:19:25,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:30,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:30,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:30,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:19:30,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:19:30,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:19:30,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2351, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:19:30,194 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 50 states. [2019-08-05 11:19:35,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:35,106 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 11:19:35,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:19:35,107 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 93 [2019-08-05 11:19:35,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:35,107 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:19:35,108 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:19:35,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=109, Invalid=2543, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:19:35,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:19:35,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-08-05 11:19:35,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:19:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 11:19:35,110 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-08-05 11:19:35,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:35,110 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 11:19:35,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:19:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 11:19:35,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 11:19:35,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:35,111 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2019-08-05 11:19:35,111 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:35,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:35,111 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2019-08-05 11:19:35,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:37,691 WARN L254 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 190 conjunts are in the unsatisfiable core [2019-08-05 11:19:37,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:43,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:43,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:19:43,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:19:43,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:19:43,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2447, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:19:43,238 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 51 states. [2019-08-05 11:19:48,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:48,513 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 11:19:48,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:19:48,514 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 95 [2019-08-05 11:19:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:48,515 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:19:48,515 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:19:48,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 45 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=121, Invalid=2741, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:19:48,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:19:48,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-08-05 11:19:48,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:19:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 11:19:48,519 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-08-05 11:19:48,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:48,519 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 11:19:48,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:19:48,519 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 11:19:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:19:48,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:48,520 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2019-08-05 11:19:48,520 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:48,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:48,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2019-08-05 11:19:48,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:51,048 WARN L254 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 194 conjunts are in the unsatisfiable core [2019-08-05 11:19:51,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:55,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:55,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:55,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:19:55,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:19:55,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:19:55,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2543, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:19:55,923 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 52 states. [2019-08-05 11:20:01,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:01,930 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 11:20:01,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:20:01,930 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 97 [2019-08-05 11:20:01,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:01,932 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:20:01,932 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:20:01,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 46 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=146, Invalid=3046, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:20:01,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:20:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-08-05 11:20:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:20:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 11:20:01,936 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-08-05 11:20:01,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:01,936 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 11:20:01,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:20:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 11:20:01,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:20:01,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:01,937 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2019-08-05 11:20:01,937 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:01,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:01,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2019-08-05 11:20:01,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:04,627 WARN L254 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 198 conjunts are in the unsatisfiable core [2019-08-05 11:20:04,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:09,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:09,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:09,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:20:09,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:20:09,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:20:09,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=2639, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:20:09,721 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 53 states. [2019-08-05 11:20:15,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:15,502 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 11:20:15,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:20:15,503 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 99 [2019-08-05 11:20:15,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:15,504 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:20:15,504 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:20:15,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 0 SyntacticMatches, 47 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=176, Invalid=3364, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:20:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:20:15,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-08-05 11:20:15,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 11:20:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 11:20:15,508 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-08-05 11:20:15,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:15,508 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 11:20:15,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:20:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 11:20:15,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:20:15,509 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:15,509 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2019-08-05 11:20:15,509 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:15,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:15,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2019-08-05 11:20:15,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:18,444 WARN L254 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 202 conjunts are in the unsatisfiable core [2019-08-05 11:20:18,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:23,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:23,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:23,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:20:23,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:20:23,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:20:23,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=2735, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:20:23,875 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 54 states. [2019-08-05 11:20:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:29,741 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 11:20:29,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:20:29,742 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 101 [2019-08-05 11:20:29,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:29,743 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:20:29,743 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:20:29,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 0 SyntacticMatches, 48 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=212, Invalid=3694, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:20:29,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:20:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-08-05 11:20:29,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:20:29,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 11:20:29,748 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-08-05 11:20:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:29,748 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 11:20:29,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:20:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 11:20:29,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:20:29,749 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:29,749 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2019-08-05 11:20:29,749 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:29,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:29,750 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2019-08-05 11:20:29,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:32,901 WARN L254 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 206 conjunts are in the unsatisfiable core [2019-08-05 11:20:32,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:38,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:38,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:38,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:20:38,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:20:38,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:20:38,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2831, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:20:38,541 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 55 states. [2019-08-05 11:20:45,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:45,214 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 11:20:45,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:20:45,215 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 103 [2019-08-05 11:20:45,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:45,216 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:20:45,217 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:20:45,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 0 SyntacticMatches, 49 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=254, Invalid=4036, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:20:45,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:20:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-08-05 11:20:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:20:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 11:20:45,220 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-08-05 11:20:45,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:45,221 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 11:20:45,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:20:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 11:20:45,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:20:45,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:45,222 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2019-08-05 11:20:45,222 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:45,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:45,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2019-08-05 11:20:45,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:48,702 WARN L254 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 210 conjunts are in the unsatisfiable core [2019-08-05 11:20:48,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:54,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:54,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:20:54,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:20:54,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:20:54,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2927, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:20:54,599 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 56 states. Received shutdown request... [2019-08-05 11:20:58,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:20:58,379 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:20:58,386 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:20:58,386 INFO L202 PluginConnector]: Adding new model GasCakeWithJohoFractions01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:20:58 BoogieIcfgContainer [2019-08-05 11:20:58,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:20:58,389 INFO L168 Benchmark]: Toolchain (without parser) took 261242.30 ms. Allocated memory was 134.2 MB in the beginning and 1.1 GB in the end (delta: 986.2 MB). Free memory was 110.6 MB in the beginning and 723.7 MB in the end (delta: -613.1 MB). Peak memory consumption was 373.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:20:58,390 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 134.2 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 11:20:58,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.62 ms. Allocated memory is still 134.2 MB. Free memory was 110.6 MB in the beginning and 108.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:20:58,391 INFO L168 Benchmark]: Boogie Preprocessor took 18.75 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 107.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:20:58,392 INFO L168 Benchmark]: RCFGBuilder took 328.89 ms. Allocated memory is still 134.2 MB. Free memory was 107.6 MB in the beginning and 98.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:20:58,392 INFO L168 Benchmark]: TraceAbstraction took 260854.50 ms. Allocated memory was 134.2 MB in the beginning and 1.1 GB in the end (delta: 986.2 MB). Free memory was 98.3 MB in the beginning and 723.7 MB in the end (delta: -625.4 MB). Peak memory consumption was 360.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:20:58,395 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 134.2 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.62 ms. Allocated memory is still 134.2 MB. Free memory was 110.6 MB in the beginning and 108.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 18.75 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 107.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 328.89 ms. Allocated memory is still 134.2 MB. Free memory was 107.6 MB in the beginning and 98.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 260854.50 ms. Allocated memory was 134.2 MB in the beginning and 1.1 GB in the end (delta: 986.2 MB). Free memory was 98.3 MB in the beginning and 723.7 MB in the end (delta: -625.4 MB). Peak memory consumption was 360.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 20]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20). Cancelled while BasicCegarLoop was constructing difference of abstraction (106states) and FLOYD_HOARE automaton (currently 37 states, 56 states before enhancement),while ReachableStatesComputation was computing reachable states (68 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 260.7s OverallTime, 52 OverallIterations, 52 TraceHistogramMax, 110.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 103 SDtfs, 163 SDslu, 0 SDs, 0 SdLazy, 98556 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 93.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2793 GetRequests, 0 SyntacticMatches, 1275 SemanticMatches, 1518 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 111.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=51, 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.1s AutomataMinimizationTime, 51 MinimizatonAttempts, 51 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 38.2s SatisfiabilityAnalysisTime, 111.0s InterpolantComputationTime, 2808 NumberOfCodeBlocks, 2808 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 2756 ConstructedInterpolants, 0 QuantifiedInterpolants, 2855246 SizeOfPredicates, 0 NumberOfNonLiveVariables, 8528 ConjunctsInSsa, 5617 ConjunctsInUnsatCore, 52 InterpolantComputations, 1 PerfectInterpolantSequences, 0/46852 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown