java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/random/RanFile075.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:05:38,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:05:38,977 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:05:38,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:05:38,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:05:38,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:05:38,995 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:05:38,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:05:38,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:05:38,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:05:39,000 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:05:39,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:05:39,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:05:39,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:05:39,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:05:39,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:05:39,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:05:39,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:05:39,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:05:39,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:05:39,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:05:39,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:05:39,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:05:39,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:05:39,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:05:39,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:05:39,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:05:39,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:05:39,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:05:39,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:05:39,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:05:39,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:05:39,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:05:39,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:05:39,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:05:39,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:05:39,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:05:39,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:05:39,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:05:39,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:05:39,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:05:39,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:05:39,068 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:05:39,071 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:05:39,073 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:05:39,074 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:05:39,074 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile075.bpl [2019-08-05 10:05:39,075 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile075.bpl' [2019-08-05 10:05:39,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:05:39,143 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:05:39,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:05:39,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:05:39,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:05:39,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RanFile075.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:39" (1/1) ... [2019-08-05 10:05:39,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RanFile075.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:39" (1/1) ... [2019-08-05 10:05:39,182 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:05:39,182 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:05:39,183 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:05:39,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:05:39,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:05:39,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:05:39,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:05:39,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RanFile075.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:39" (1/1) ... [2019-08-05 10:05:39,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RanFile075.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:39" (1/1) ... [2019-08-05 10:05:39,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RanFile075.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:39" (1/1) ... [2019-08-05 10:05:39,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RanFile075.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:39" (1/1) ... [2019-08-05 10:05:39,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RanFile075.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:39" (1/1) ... [2019-08-05 10:05:39,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RanFile075.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:39" (1/1) ... [2019-08-05 10:05:39,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RanFile075.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:39" (1/1) ... [2019-08-05 10:05:39,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:05:39,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:05:39,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:05:39,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:05:39,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RanFile075.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:05:39,332 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:05:39,333 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:05:39,333 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:05:42,051 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:05:42,051 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:05:42,052 INFO L202 PluginConnector]: Adding new model RanFile075.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:05:42 BoogieIcfgContainer [2019-08-05 10:05:42,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:05:42,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:05:42,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:05:42,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:05:42,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile075.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:05:39" (1/2) ... [2019-08-05 10:05:42,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b93a82c and model type RanFile075.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:05:42, skipping insertion in model container [2019-08-05 10:05:42,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile075.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:05:42" (2/2) ... [2019-08-05 10:05:42,067 INFO L109 eAbstractionObserver]: Analyzing ICFG RanFile075.bpl [2019-08-05 10:05:42,079 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:05:42,088 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 10:05:42,107 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 10:05:42,133 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:05:42,134 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:05:42,134 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:05:42,134 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:05:42,135 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:05:42,135 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:05:42,135 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:05:42,135 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:05:42,136 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:05:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2019-08-05 10:05:42,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:05:42,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:42,164 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:42,167 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:42,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:42,172 INFO L82 PathProgramCache]: Analyzing trace with hash 481395120, now seen corresponding path program 1 times [2019-08-05 10:05:42,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:42,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:05:42,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:42,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:42,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:05:42,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:05:42,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:05:42,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:05:42,347 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 3 states. [2019-08-05 10:05:42,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:42,817 INFO L93 Difference]: Finished difference Result 85 states and 153 transitions. [2019-08-05 10:05:42,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:05:42,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-08-05 10:05:42,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:42,831 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:05:42,832 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:05:42,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:05:42,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:05:42,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:05:42,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:05:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2019-08-05 10:05:42,875 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 23 [2019-08-05 10:05:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:42,875 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2019-08-05 10:05:42,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:05:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2019-08-05 10:05:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:05:42,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:42,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:42,878 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:42,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:42,879 INFO L82 PathProgramCache]: Analyzing trace with hash -364940850, now seen corresponding path program 1 times [2019-08-05 10:05:42,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:42,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:05:42,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:43,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:43,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:05:43,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:05:43,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:05:43,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:05:43,007 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 4 states. [2019-08-05 10:05:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:44,071 INFO L93 Difference]: Finished difference Result 125 states and 224 transitions. [2019-08-05 10:05:44,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:05:44,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-08-05 10:05:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:44,076 INFO L225 Difference]: With dead ends: 125 [2019-08-05 10:05:44,077 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:05:44,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:05:44,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:05:44,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 102. [2019-08-05 10:05:44,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:05:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 183 transitions. [2019-08-05 10:05:44,092 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 183 transitions. Word has length 23 [2019-08-05 10:05:44,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:44,093 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 183 transitions. [2019-08-05 10:05:44,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:05:44,093 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 183 transitions. [2019-08-05 10:05:44,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:05:44,095 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:44,095 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:44,095 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:44,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:44,096 INFO L82 PathProgramCache]: Analyzing trace with hash -649446016, now seen corresponding path program 1 times [2019-08-05 10:05:44,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:44,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:05:44,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:44,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:44,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:44,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:05:44,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:05:44,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:05:44,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:05:44,382 INFO L87 Difference]: Start difference. First operand 102 states and 183 transitions. Second operand 8 states. [2019-08-05 10:05:46,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:46,496 INFO L93 Difference]: Finished difference Result 175 states and 311 transitions. [2019-08-05 10:05:46,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:05:46,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-08-05 10:05:46,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:46,500 INFO L225 Difference]: With dead ends: 175 [2019-08-05 10:05:46,500 INFO L226 Difference]: Without dead ends: 175 [2019-08-05 10:05:46,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:05:46,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-08-05 10:05:46,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 134. [2019-08-05 10:05:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 10:05:46,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 238 transitions. [2019-08-05 10:05:46,513 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 238 transitions. Word has length 24 [2019-08-05 10:05:46,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:46,514 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 238 transitions. [2019-08-05 10:05:46,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:05:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 238 transitions. [2019-08-05 10:05:46,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:05:46,516 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:46,516 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:46,516 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:46,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:46,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1140482146, now seen corresponding path program 1 times [2019-08-05 10:05:46,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:46,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:05:46,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:46,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:46,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:05:46,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:05:46,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:05:46,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:05:46,973 INFO L87 Difference]: Start difference. First operand 134 states and 238 transitions. Second operand 8 states. [2019-08-05 10:05:48,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:48,793 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2019-08-05 10:05:48,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:05:48,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-08-05 10:05:48,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:48,797 INFO L225 Difference]: With dead ends: 219 [2019-08-05 10:05:48,797 INFO L226 Difference]: Without dead ends: 176 [2019-08-05 10:05:48,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:05:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-08-05 10:05:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2019-08-05 10:05:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-08-05 10:05:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 303 transitions. [2019-08-05 10:05:48,820 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 303 transitions. Word has length 24 [2019-08-05 10:05:48,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:48,821 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 303 transitions. [2019-08-05 10:05:48,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:05:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 303 transitions. [2019-08-05 10:05:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:05:48,826 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:48,826 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:48,829 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:48,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:48,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1583557848, now seen corresponding path program 1 times [2019-08-05 10:05:48,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:48,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:05:48,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:48,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:48,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:48,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:05:48,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:05:48,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:05:48,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:05:48,884 INFO L87 Difference]: Start difference. First operand 173 states and 303 transitions. Second operand 3 states. [2019-08-05 10:05:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:49,050 INFO L93 Difference]: Finished difference Result 170 states and 296 transitions. [2019-08-05 10:05:49,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:05:49,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-08-05 10:05:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:49,054 INFO L225 Difference]: With dead ends: 170 [2019-08-05 10:05:49,054 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 10:05:49,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:05:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 10:05:49,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-08-05 10:05:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 10:05:49,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 288 transitions. [2019-08-05 10:05:49,063 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 288 transitions. Word has length 25 [2019-08-05 10:05:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:49,063 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 288 transitions. [2019-08-05 10:05:49,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:05:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 288 transitions. [2019-08-05 10:05:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:05:49,065 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:49,065 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:49,065 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:49,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:49,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1342010609, now seen corresponding path program 1 times [2019-08-05 10:05:49,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:49,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:05:49,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:49,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:49,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:49,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-08-05 10:05:49,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:05:49,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:05:49,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:05:49,846 INFO L87 Difference]: Start difference. First operand 166 states and 288 transitions. Second operand 11 states. [2019-08-05 10:05:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:51,387 INFO L93 Difference]: Finished difference Result 195 states and 337 transitions. [2019-08-05 10:05:51,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:05:51,388 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-08-05 10:05:51,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:51,390 INFO L225 Difference]: With dead ends: 195 [2019-08-05 10:05:51,390 INFO L226 Difference]: Without dead ends: 193 [2019-08-05 10:05:51,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:05:51,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-08-05 10:05:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 175. [2019-08-05 10:05:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-08-05 10:05:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 302 transitions. [2019-08-05 10:05:51,398 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 302 transitions. Word has length 25 [2019-08-05 10:05:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:51,399 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 302 transitions. [2019-08-05 10:05:51,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:05:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 302 transitions. [2019-08-05 10:05:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:05:51,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:51,400 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:51,401 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:51,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash -551225137, now seen corresponding path program 1 times [2019-08-05 10:05:51,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:51,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:05:51,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:51,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:51,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:51,479 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:51,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:51,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:51,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:51,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:05:51,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:05:51,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:51,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:05:51,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:05:51,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:05:51,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:05:51,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:05:51,693 INFO L87 Difference]: Start difference. First operand 175 states and 302 transitions. Second operand 10 states. [2019-08-05 10:05:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:53,637 INFO L93 Difference]: Finished difference Result 300 states and 522 transitions. [2019-08-05 10:05:53,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:05:53,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-08-05 10:05:53,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:53,641 INFO L225 Difference]: With dead ends: 300 [2019-08-05 10:05:53,642 INFO L226 Difference]: Without dead ends: 300 [2019-08-05 10:05:53,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:05:53,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-08-05 10:05:53,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 247. [2019-08-05 10:05:53,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-08-05 10:05:53,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 435 transitions. [2019-08-05 10:05:53,652 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 435 transitions. Word has length 26 [2019-08-05 10:05:53,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:53,652 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 435 transitions. [2019-08-05 10:05:53,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:05:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 435 transitions. [2019-08-05 10:05:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:05:53,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:53,654 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:53,654 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:53,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:53,654 INFO L82 PathProgramCache]: Analyzing trace with hash -960237717, now seen corresponding path program 1 times [2019-08-05 10:05:53,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:53,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:05:53,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:53,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:53,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:05:53,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:05:53,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:05:53,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:05:53,917 INFO L87 Difference]: Start difference. First operand 247 states and 435 transitions. Second operand 5 states. [2019-08-05 10:05:54,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:54,367 INFO L93 Difference]: Finished difference Result 315 states and 547 transitions. [2019-08-05 10:05:54,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:05:54,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-08-05 10:05:54,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:54,371 INFO L225 Difference]: With dead ends: 315 [2019-08-05 10:05:54,371 INFO L226 Difference]: Without dead ends: 313 [2019-08-05 10:05:54,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:05:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-08-05 10:05:54,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 254. [2019-08-05 10:05:54,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-08-05 10:05:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 447 transitions. [2019-08-05 10:05:54,379 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 447 transitions. Word has length 26 [2019-08-05 10:05:54,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:54,380 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 447 transitions. [2019-08-05 10:05:54,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:05:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 447 transitions. [2019-08-05 10:05:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:05:54,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:54,381 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:54,381 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:54,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:54,382 INFO L82 PathProgramCache]: Analyzing trace with hash 866148752, now seen corresponding path program 1 times [2019-08-05 10:05:54,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:54,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:05:54,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:54,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:54,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-08-05 10:05:54,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:05:54,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:05:54,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:05:54,989 INFO L87 Difference]: Start difference. First operand 254 states and 447 transitions. Second operand 12 states. [2019-08-05 10:05:57,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:05:57,416 INFO L93 Difference]: Finished difference Result 297 states and 525 transitions. [2019-08-05 10:05:57,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:05:57,417 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-08-05 10:05:57,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:05:57,419 INFO L225 Difference]: With dead ends: 297 [2019-08-05 10:05:57,419 INFO L226 Difference]: Without dead ends: 295 [2019-08-05 10:05:57,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:05:57,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-08-05 10:05:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 258. [2019-08-05 10:05:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-08-05 10:05:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 453 transitions. [2019-08-05 10:05:57,426 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 453 transitions. Word has length 26 [2019-08-05 10:05:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:05:57,427 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 453 transitions. [2019-08-05 10:05:57,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:05:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 453 transitions. [2019-08-05 10:05:57,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:05:57,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:05:57,428 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:05:57,429 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:05:57,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:05:57,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1692680082, now seen corresponding path program 1 times [2019-08-05 10:05:57,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:05:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:05:57,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:05:57,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:05:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:05:57,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:05:57,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:05:57,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:05:57,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:05:57,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:05:57,624 INFO L87 Difference]: Start difference. First operand 258 states and 453 transitions. Second operand 8 states. [2019-08-05 10:06:01,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:01,256 INFO L93 Difference]: Finished difference Result 309 states and 539 transitions. [2019-08-05 10:06:01,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:06:01,256 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-08-05 10:06:01,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:01,260 INFO L225 Difference]: With dead ends: 309 [2019-08-05 10:06:01,260 INFO L226 Difference]: Without dead ends: 309 [2019-08-05 10:06:01,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:06:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-08-05 10:06:01,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 267. [2019-08-05 10:06:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-08-05 10:06:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 467 transitions. [2019-08-05 10:06:01,267 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 467 transitions. Word has length 26 [2019-08-05 10:06:01,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:01,267 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 467 transitions. [2019-08-05 10:06:01,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:06:01,268 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 467 transitions. [2019-08-05 10:06:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:06:01,269 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:01,269 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:01,269 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:01,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:01,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1855755535, now seen corresponding path program 1 times [2019-08-05 10:06:01,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:01,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:06:01,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:01,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:01,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-08-05 10:06:01,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:06:01,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:06:01,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:06:01,510 INFO L87 Difference]: Start difference. First operand 267 states and 467 transitions. Second operand 10 states. [2019-08-05 10:06:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:05,454 INFO L93 Difference]: Finished difference Result 520 states and 902 transitions. [2019-08-05 10:06:05,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:06:05,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-08-05 10:06:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:05,458 INFO L225 Difference]: With dead ends: 520 [2019-08-05 10:06:05,458 INFO L226 Difference]: Without dead ends: 407 [2019-08-05 10:06:05,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:06:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-08-05 10:06:05,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 349. [2019-08-05 10:06:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-08-05 10:06:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 603 transitions. [2019-08-05 10:06:05,467 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 603 transitions. Word has length 26 [2019-08-05 10:06:05,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:05,468 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 603 transitions. [2019-08-05 10:06:05,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:06:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 603 transitions. [2019-08-05 10:06:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:06:05,469 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:05,469 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:05,469 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:05,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:05,469 INFO L82 PathProgramCache]: Analyzing trace with hash 848589492, now seen corresponding path program 1 times [2019-08-05 10:06:05,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:05,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:06:05,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:05,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:05,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:06:05,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:06:05,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:06:05,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:06:05,515 INFO L87 Difference]: Start difference. First operand 349 states and 603 transitions. Second operand 5 states. [2019-08-05 10:06:05,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:05,953 INFO L93 Difference]: Finished difference Result 436 states and 749 transitions. [2019-08-05 10:06:05,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:06:05,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-08-05 10:06:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:05,957 INFO L225 Difference]: With dead ends: 436 [2019-08-05 10:06:05,957 INFO L226 Difference]: Without dead ends: 436 [2019-08-05 10:06:05,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:06:05,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-08-05 10:06:05,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 379. [2019-08-05 10:06:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-08-05 10:06:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 661 transitions. [2019-08-05 10:06:05,968 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 661 transitions. Word has length 26 [2019-08-05 10:06:05,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:05,969 INFO L475 AbstractCegarLoop]: Abstraction has 379 states and 661 transitions. [2019-08-05 10:06:05,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:06:05,969 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 661 transitions. [2019-08-05 10:06:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:06:05,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:05,971 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:05,971 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:05,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:05,971 INFO L82 PathProgramCache]: Analyzing trace with hash -2094781999, now seen corresponding path program 1 times [2019-08-05 10:06:05,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:05,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:06:05,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:06,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:06,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:06:06,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:06:06,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:06:06,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:06:06,016 INFO L87 Difference]: Start difference. First operand 379 states and 661 transitions. Second operand 3 states. [2019-08-05 10:06:06,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:06,148 INFO L93 Difference]: Finished difference Result 390 states and 678 transitions. [2019-08-05 10:06:06,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:06:06,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-08-05 10:06:06,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:06,152 INFO L225 Difference]: With dead ends: 390 [2019-08-05 10:06:06,152 INFO L226 Difference]: Without dead ends: 377 [2019-08-05 10:06:06,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:06:06,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-08-05 10:06:06,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 366. [2019-08-05 10:06:06,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-08-05 10:06:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 631 transitions. [2019-08-05 10:06:06,161 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 631 transitions. Word has length 26 [2019-08-05 10:06:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:06,162 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 631 transitions. [2019-08-05 10:06:06,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:06:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 631 transitions. [2019-08-05 10:06:06,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:06:06,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:06,163 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:06,164 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:06,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:06,164 INFO L82 PathProgramCache]: Analyzing trace with hash 91890562, now seen corresponding path program 1 times [2019-08-05 10:06:06,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:06,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:06:06,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:06,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:06,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:06,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:06,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:06,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:06,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:06,256 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:06,256 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:06,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:06,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:06,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:06,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:06,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:06,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:06,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:06,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:06,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:06,651 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 36 [2019-08-05 10:06:06,653 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 10:06:06,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:06,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:06,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:06:06,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:06:06,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:06:06,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:06:06,743 INFO L87 Difference]: Start difference. First operand 366 states and 631 transitions. Second operand 7 states. [2019-08-05 10:06:07,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:07,489 INFO L93 Difference]: Finished difference Result 408 states and 706 transitions. [2019-08-05 10:06:07,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:06:07,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-08-05 10:06:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:07,492 INFO L225 Difference]: With dead ends: 408 [2019-08-05 10:06:07,492 INFO L226 Difference]: Without dead ends: 407 [2019-08-05 10:06:07,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:06:07,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-08-05 10:06:07,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 371. [2019-08-05 10:06:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-08-05 10:06:07,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 639 transitions. [2019-08-05 10:06:07,501 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 639 transitions. Word has length 27 [2019-08-05 10:06:07,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:07,502 INFO L475 AbstractCegarLoop]: Abstraction has 371 states and 639 transitions. [2019-08-05 10:06:07,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:06:07,502 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 639 transitions. [2019-08-05 10:06:07,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:06:07,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:07,503 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:07,503 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:07,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:07,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1278931027, now seen corresponding path program 1 times [2019-08-05 10:06:07,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:07,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:06:07,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:07,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:07,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:06:07,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:06:07,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:06:07,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:06:07,582 INFO L87 Difference]: Start difference. First operand 371 states and 639 transitions. Second operand 3 states. [2019-08-05 10:06:07,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:07,964 INFO L93 Difference]: Finished difference Result 375 states and 643 transitions. [2019-08-05 10:06:07,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:06:07,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:06:07,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:07,968 INFO L225 Difference]: With dead ends: 375 [2019-08-05 10:06:07,968 INFO L226 Difference]: Without dead ends: 371 [2019-08-05 10:06:07,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:06:07,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-08-05 10:06:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 361. [2019-08-05 10:06:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-08-05 10:06:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 617 transitions. [2019-08-05 10:06:07,977 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 617 transitions. Word has length 27 [2019-08-05 10:06:07,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:07,977 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 617 transitions. [2019-08-05 10:06:07,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:06:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 617 transitions. [2019-08-05 10:06:07,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:06:07,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:07,978 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:07,979 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:07,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:07,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1923779709, now seen corresponding path program 1 times [2019-08-05 10:06:07,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:07,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:06:07,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:08,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:08,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:06:08,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:06:08,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:06:08,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:06:08,247 INFO L87 Difference]: Start difference. First operand 361 states and 617 transitions. Second operand 10 states. [2019-08-05 10:06:09,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:09,307 INFO L93 Difference]: Finished difference Result 494 states and 847 transitions. [2019-08-05 10:06:09,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:06:09,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-08-05 10:06:09,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:09,311 INFO L225 Difference]: With dead ends: 494 [2019-08-05 10:06:09,311 INFO L226 Difference]: Without dead ends: 490 [2019-08-05 10:06:09,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:06:09,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-08-05 10:06:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 425. [2019-08-05 10:06:09,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-08-05 10:06:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 732 transitions. [2019-08-05 10:06:09,321 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 732 transitions. Word has length 27 [2019-08-05 10:06:09,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:09,321 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 732 transitions. [2019-08-05 10:06:09,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:06:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 732 transitions. [2019-08-05 10:06:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:06:09,322 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:09,323 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:09,323 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:09,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:09,323 INFO L82 PathProgramCache]: Analyzing trace with hash 572396082, now seen corresponding path program 1 times [2019-08-05 10:06:09,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:09,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:06:09,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:09,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:06:09,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:09,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-08-05 10:06:09,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:06:09,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:06:09,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:06:09,760 INFO L87 Difference]: Start difference. First operand 425 states and 732 transitions. Second operand 11 states. [2019-08-05 10:06:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:12,925 INFO L93 Difference]: Finished difference Result 617 states and 1045 transitions. [2019-08-05 10:06:12,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:06:12,925 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-08-05 10:06:12,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:12,930 INFO L225 Difference]: With dead ends: 617 [2019-08-05 10:06:12,930 INFO L226 Difference]: Without dead ends: 598 [2019-08-05 10:06:12,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:06:12,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-08-05 10:06:12,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 474. [2019-08-05 10:06:12,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-08-05 10:06:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 824 transitions. [2019-08-05 10:06:12,941 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 824 transitions. Word has length 27 [2019-08-05 10:06:12,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:12,941 INFO L475 AbstractCegarLoop]: Abstraction has 474 states and 824 transitions. [2019-08-05 10:06:12,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:06:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 824 transitions. [2019-08-05 10:06:12,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:06:12,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:12,943 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:12,943 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:12,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:12,943 INFO L82 PathProgramCache]: Analyzing trace with hash -933474365, now seen corresponding path program 1 times [2019-08-05 10:06:12,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:12,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:06:12,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:13,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:13,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:06:13,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:06:13,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:06:13,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:06:13,517 INFO L87 Difference]: Start difference. First operand 474 states and 824 transitions. Second operand 12 states. [2019-08-05 10:06:15,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:15,656 INFO L93 Difference]: Finished difference Result 508 states and 880 transitions. [2019-08-05 10:06:15,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:06:15,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-08-05 10:06:15,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:15,660 INFO L225 Difference]: With dead ends: 508 [2019-08-05 10:06:15,661 INFO L226 Difference]: Without dead ends: 500 [2019-08-05 10:06:15,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:06:15,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-08-05 10:06:15,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 482. [2019-08-05 10:06:15,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-08-05 10:06:15,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 836 transitions. [2019-08-05 10:06:15,670 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 836 transitions. Word has length 27 [2019-08-05 10:06:15,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:15,670 INFO L475 AbstractCegarLoop]: Abstraction has 482 states and 836 transitions. [2019-08-05 10:06:15,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:06:15,671 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 836 transitions. [2019-08-05 10:06:15,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:06:15,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:15,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:15,672 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:15,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:15,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1684711078, now seen corresponding path program 1 times [2019-08-05 10:06:15,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:15,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:06:15,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:15,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:15,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:06:15,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:06:15,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:06:15,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:06:15,891 INFO L87 Difference]: Start difference. First operand 482 states and 836 transitions. Second operand 10 states. [2019-08-05 10:06:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:17,191 INFO L93 Difference]: Finished difference Result 571 states and 987 transitions. [2019-08-05 10:06:17,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:06:17,192 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-08-05 10:06:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:17,195 INFO L225 Difference]: With dead ends: 571 [2019-08-05 10:06:17,195 INFO L226 Difference]: Without dead ends: 562 [2019-08-05 10:06:17,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:06:17,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-08-05 10:06:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 506. [2019-08-05 10:06:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-08-05 10:06:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 880 transitions. [2019-08-05 10:06:17,204 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 880 transitions. Word has length 27 [2019-08-05 10:06:17,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:17,205 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 880 transitions. [2019-08-05 10:06:17,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:06:17,205 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 880 transitions. [2019-08-05 10:06:17,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:06:17,206 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:17,206 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:17,207 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:17,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:17,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1583530062, now seen corresponding path program 1 times [2019-08-05 10:06:17,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:17,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:06:17,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:17,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:17,305 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:17,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:17,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:17,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:17,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:17,908 WARN L188 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-08-05 10:06:18,096 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-08-05 10:06:18,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:18,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:18,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:06:18,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:06:18,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:06:18,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:06:18,158 INFO L87 Difference]: Start difference. First operand 506 states and 880 transitions. Second operand 8 states. [2019-08-05 10:06:18,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:18,644 INFO L93 Difference]: Finished difference Result 543 states and 945 transitions. [2019-08-05 10:06:18,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:06:18,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-08-05 10:06:18,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:18,652 INFO L225 Difference]: With dead ends: 543 [2019-08-05 10:06:18,652 INFO L226 Difference]: Without dead ends: 543 [2019-08-05 10:06:18,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:06:18,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-08-05 10:06:18,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 507. [2019-08-05 10:06:18,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-08-05 10:06:18,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 881 transitions. [2019-08-05 10:06:18,661 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 881 transitions. Word has length 28 [2019-08-05 10:06:18,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:18,661 INFO L475 AbstractCegarLoop]: Abstraction has 507 states and 881 transitions. [2019-08-05 10:06:18,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:06:18,662 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 881 transitions. [2019-08-05 10:06:18,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:06:18,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:18,663 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:18,663 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:18,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:18,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1058420694, now seen corresponding path program 1 times [2019-08-05 10:06:18,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:18,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:06:18,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:18,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:18,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:18,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:06:18,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:06:18,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:06:18,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:06:18,716 INFO L87 Difference]: Start difference. First operand 507 states and 881 transitions. Second operand 3 states. [2019-08-05 10:06:18,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:18,912 INFO L93 Difference]: Finished difference Result 459 states and 782 transitions. [2019-08-05 10:06:18,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:06:18,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-08-05 10:06:18,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:18,915 INFO L225 Difference]: With dead ends: 459 [2019-08-05 10:06:18,915 INFO L226 Difference]: Without dead ends: 459 [2019-08-05 10:06:18,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:06:18,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-08-05 10:06:18,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 448. [2019-08-05 10:06:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-08-05 10:06:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 763 transitions. [2019-08-05 10:06:18,922 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 763 transitions. Word has length 28 [2019-08-05 10:06:18,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:18,922 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 763 transitions. [2019-08-05 10:06:18,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:06:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 763 transitions. [2019-08-05 10:06:18,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:06:18,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:18,923 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:18,924 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:18,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:18,924 INFO L82 PathProgramCache]: Analyzing trace with hash 748791946, now seen corresponding path program 1 times [2019-08-05 10:06:18,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:18,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:06:18,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:19,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:19,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-08-05 10:06:19,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:06:19,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:06:19,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:06:19,280 INFO L87 Difference]: Start difference. First operand 448 states and 763 transitions. Second operand 12 states. [2019-08-05 10:06:20,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:20,864 INFO L93 Difference]: Finished difference Result 511 states and 849 transitions. [2019-08-05 10:06:20,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:06:20,866 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-08-05 10:06:20,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:20,868 INFO L225 Difference]: With dead ends: 511 [2019-08-05 10:06:20,868 INFO L226 Difference]: Without dead ends: 511 [2019-08-05 10:06:20,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:06:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-08-05 10:06:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 432. [2019-08-05 10:06:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-08-05 10:06:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 727 transitions. [2019-08-05 10:06:20,877 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 727 transitions. Word has length 28 [2019-08-05 10:06:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:20,877 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 727 transitions. [2019-08-05 10:06:20,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:06:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 727 transitions. [2019-08-05 10:06:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:06:20,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:20,878 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:20,879 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:20,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:20,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1324781730, now seen corresponding path program 1 times [2019-08-05 10:06:20,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:20,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:06:20,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:21,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:21,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:06:21,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:06:21,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:06:21,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:06:21,240 INFO L87 Difference]: Start difference. First operand 432 states and 727 transitions. Second operand 11 states. [2019-08-05 10:06:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:23,156 INFO L93 Difference]: Finished difference Result 475 states and 801 transitions. [2019-08-05 10:06:23,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:06:23,156 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-08-05 10:06:23,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:23,159 INFO L225 Difference]: With dead ends: 475 [2019-08-05 10:06:23,159 INFO L226 Difference]: Without dead ends: 467 [2019-08-05 10:06:23,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:06:23,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-08-05 10:06:23,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 432. [2019-08-05 10:06:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-08-05 10:06:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 727 transitions. [2019-08-05 10:06:23,165 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 727 transitions. Word has length 28 [2019-08-05 10:06:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:23,165 INFO L475 AbstractCegarLoop]: Abstraction has 432 states and 727 transitions. [2019-08-05 10:06:23,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:06:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 727 transitions. [2019-08-05 10:06:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:06:23,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:23,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:23,166 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:23,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:23,167 INFO L82 PathProgramCache]: Analyzing trace with hash 553318740, now seen corresponding path program 1 times [2019-08-05 10:06:23,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:23,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:06:23,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:23,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:23,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:06:23,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:06:23,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:06:23,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:06:23,301 INFO L87 Difference]: Start difference. First operand 432 states and 727 transitions. Second operand 10 states. [2019-08-05 10:06:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:24,479 INFO L93 Difference]: Finished difference Result 493 states and 825 transitions. [2019-08-05 10:06:24,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:06:24,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-08-05 10:06:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:24,483 INFO L225 Difference]: With dead ends: 493 [2019-08-05 10:06:24,483 INFO L226 Difference]: Without dead ends: 492 [2019-08-05 10:06:24,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:06:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-08-05 10:06:24,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 457. [2019-08-05 10:06:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-08-05 10:06:24,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 765 transitions. [2019-08-05 10:06:24,491 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 765 transitions. Word has length 28 [2019-08-05 10:06:24,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:24,491 INFO L475 AbstractCegarLoop]: Abstraction has 457 states and 765 transitions. [2019-08-05 10:06:24,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:06:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 765 transitions. [2019-08-05 10:06:24,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:06:24,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:24,493 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:24,493 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:24,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:24,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1656772196, now seen corresponding path program 1 times [2019-08-05 10:06:24,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:24,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:06:24,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:06:24,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:24,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-08-05 10:06:24,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:06:24,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:06:24,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:06:24,870 INFO L87 Difference]: Start difference. First operand 457 states and 765 transitions. Second operand 11 states. [2019-08-05 10:06:28,349 WARN L188 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 56 [2019-08-05 10:06:37,648 WARN L188 SmtUtils]: Spent 730.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-08-05 10:06:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:37,826 INFO L93 Difference]: Finished difference Result 558 states and 923 transitions. [2019-08-05 10:06:37,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:06:37,826 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-08-05 10:06:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:37,828 INFO L225 Difference]: With dead ends: 558 [2019-08-05 10:06:37,828 INFO L226 Difference]: Without dead ends: 532 [2019-08-05 10:06:37,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:06:37,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-08-05 10:06:37,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 446. [2019-08-05 10:06:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-08-05 10:06:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 749 transitions. [2019-08-05 10:06:37,836 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 749 transitions. Word has length 28 [2019-08-05 10:06:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:37,836 INFO L475 AbstractCegarLoop]: Abstraction has 446 states and 749 transitions. [2019-08-05 10:06:37,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:06:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 749 transitions. [2019-08-05 10:06:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:06:37,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:37,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:37,838 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:37,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:37,839 INFO L82 PathProgramCache]: Analyzing trace with hash -622985483, now seen corresponding path program 1 times [2019-08-05 10:06:37,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:37,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:06:37,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:37,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:37,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:37,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:06:37,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:06:37,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:06:37,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:06:37,928 INFO L87 Difference]: Start difference. First operand 446 states and 749 transitions. Second operand 5 states. [2019-08-05 10:06:38,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:38,527 INFO L93 Difference]: Finished difference Result 531 states and 875 transitions. [2019-08-05 10:06:38,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:06:38,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-08-05 10:06:38,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:38,530 INFO L225 Difference]: With dead ends: 531 [2019-08-05 10:06:38,531 INFO L226 Difference]: Without dead ends: 525 [2019-08-05 10:06:38,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:06:38,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-08-05 10:06:38,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 393. [2019-08-05 10:06:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-08-05 10:06:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 649 transitions. [2019-08-05 10:06:38,537 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 649 transitions. Word has length 28 [2019-08-05 10:06:38,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:38,538 INFO L475 AbstractCegarLoop]: Abstraction has 393 states and 649 transitions. [2019-08-05 10:06:38,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:06:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 649 transitions. [2019-08-05 10:06:38,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:06:38,539 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:38,539 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:38,539 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:38,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:38,540 INFO L82 PathProgramCache]: Analyzing trace with hash 723998121, now seen corresponding path program 1 times [2019-08-05 10:06:38,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:38,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:06:38,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:38,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:38,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:38,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:06:38,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:06:38,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:06:38,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:06:38,681 INFO L87 Difference]: Start difference. First operand 393 states and 649 transitions. Second operand 9 states. [2019-08-05 10:06:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:40,600 INFO L93 Difference]: Finished difference Result 587 states and 970 transitions. [2019-08-05 10:06:40,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:06:40,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-08-05 10:06:40,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:40,604 INFO L225 Difference]: With dead ends: 587 [2019-08-05 10:06:40,604 INFO L226 Difference]: Without dead ends: 580 [2019-08-05 10:06:40,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:06:40,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-08-05 10:06:40,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 435. [2019-08-05 10:06:40,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-08-05 10:06:40,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 724 transitions. [2019-08-05 10:06:40,611 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 724 transitions. Word has length 28 [2019-08-05 10:06:40,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:40,612 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 724 transitions. [2019-08-05 10:06:40,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:06:40,612 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 724 transitions. [2019-08-05 10:06:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:06:40,615 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:40,615 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:40,616 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:40,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:40,616 INFO L82 PathProgramCache]: Analyzing trace with hash -907733629, now seen corresponding path program 1 times [2019-08-05 10:06:40,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:40,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:06:40,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:41,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:06:41,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:41,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:06:41,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:06:41,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:06:41,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:06:41,780 INFO L87 Difference]: Start difference. First operand 435 states and 724 transitions. Second operand 11 states. [2019-08-05 10:06:43,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:43,659 INFO L93 Difference]: Finished difference Result 558 states and 911 transitions. [2019-08-05 10:06:43,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:06:43,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-08-05 10:06:43,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:43,663 INFO L225 Difference]: With dead ends: 558 [2019-08-05 10:06:43,663 INFO L226 Difference]: Without dead ends: 542 [2019-08-05 10:06:43,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:06:43,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-08-05 10:06:43,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 442. [2019-08-05 10:06:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-08-05 10:06:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 730 transitions. [2019-08-05 10:06:43,670 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 730 transitions. Word has length 28 [2019-08-05 10:06:43,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:43,671 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 730 transitions. [2019-08-05 10:06:43,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:06:43,671 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 730 transitions. [2019-08-05 10:06:43,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:06:43,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:43,672 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:43,672 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:43,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:43,673 INFO L82 PathProgramCache]: Analyzing trace with hash -487376762, now seen corresponding path program 2 times [2019-08-05 10:06:43,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:43,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:06:43,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:43,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:43,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:06:43,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:06:43,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:06:43,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:06:43,867 INFO L87 Difference]: Start difference. First operand 442 states and 730 transitions. Second operand 12 states. [2019-08-05 10:06:45,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:45,621 INFO L93 Difference]: Finished difference Result 527 states and 860 transitions. [2019-08-05 10:06:45,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:06:45,621 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-08-05 10:06:45,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:45,624 INFO L225 Difference]: With dead ends: 527 [2019-08-05 10:06:45,624 INFO L226 Difference]: Without dead ends: 501 [2019-08-05 10:06:45,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:06:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-08-05 10:06:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 443. [2019-08-05 10:06:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-08-05 10:06:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 732 transitions. [2019-08-05 10:06:45,631 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 732 transitions. Word has length 28 [2019-08-05 10:06:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:45,631 INFO L475 AbstractCegarLoop]: Abstraction has 443 states and 732 transitions. [2019-08-05 10:06:45,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:06:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 732 transitions. [2019-08-05 10:06:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:06:45,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:45,632 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:45,633 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:45,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1457898231, now seen corresponding path program 1 times [2019-08-05 10:06:45,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:45,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:06:45,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:45,672 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:45,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:45,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:06:45,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:06:45,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:06:45,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:06:45,765 INFO L87 Difference]: Start difference. First operand 443 states and 732 transitions. Second operand 10 states. [2019-08-05 10:06:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:46,790 INFO L93 Difference]: Finished difference Result 494 states and 812 transitions. [2019-08-05 10:06:46,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:06:46,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-08-05 10:06:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:46,793 INFO L225 Difference]: With dead ends: 494 [2019-08-05 10:06:46,794 INFO L226 Difference]: Without dead ends: 481 [2019-08-05 10:06:46,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:06:46,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-08-05 10:06:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 475. [2019-08-05 10:06:46,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-08-05 10:06:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 781 transitions. [2019-08-05 10:06:46,800 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 781 transitions. Word has length 28 [2019-08-05 10:06:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:46,800 INFO L475 AbstractCegarLoop]: Abstraction has 475 states and 781 transitions. [2019-08-05 10:06:46,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:06:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 781 transitions. [2019-08-05 10:06:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:06:46,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:46,801 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:46,801 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:46,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:46,801 INFO L82 PathProgramCache]: Analyzing trace with hash 31054512, now seen corresponding path program 1 times [2019-08-05 10:06:46,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:46,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:06:46,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:46,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:46,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:46,864 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:46,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:46,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:46,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:46,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:06:47,149 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-08-05 10:06:47,293 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-08-05 10:06:47,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:06:47,867 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-08-05 10:06:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:47,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:47,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:06:47,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:06:47,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:06:47,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:06:47,916 INFO L87 Difference]: Start difference. First operand 475 states and 781 transitions. Second operand 9 states. [2019-08-05 10:06:48,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:48,841 INFO L93 Difference]: Finished difference Result 494 states and 815 transitions. [2019-08-05 10:06:48,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:06:48,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-08-05 10:06:48,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:48,845 INFO L225 Difference]: With dead ends: 494 [2019-08-05 10:06:48,845 INFO L226 Difference]: Without dead ends: 491 [2019-08-05 10:06:48,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:06:48,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-08-05 10:06:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 474. [2019-08-05 10:06:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-08-05 10:06:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 779 transitions. [2019-08-05 10:06:48,851 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 779 transitions. Word has length 29 [2019-08-05 10:06:48,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:48,851 INFO L475 AbstractCegarLoop]: Abstraction has 474 states and 779 transitions. [2019-08-05 10:06:48,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:06:48,851 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 779 transitions. [2019-08-05 10:06:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:06:48,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:48,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:48,852 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:48,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:48,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2033287601, now seen corresponding path program 1 times [2019-08-05 10:06:48,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:48,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:06:48,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:48,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:06:48,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:48,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:06:48,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:06:48,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:06:48,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:06:48,912 INFO L87 Difference]: Start difference. First operand 474 states and 779 transitions. Second operand 7 states. [2019-08-05 10:06:49,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:49,574 INFO L93 Difference]: Finished difference Result 535 states and 870 transitions. [2019-08-05 10:06:49,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:06:49,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-08-05 10:06:49,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:49,578 INFO L225 Difference]: With dead ends: 535 [2019-08-05 10:06:49,578 INFO L226 Difference]: Without dead ends: 529 [2019-08-05 10:06:49,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:06:49,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-08-05 10:06:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 463. [2019-08-05 10:06:49,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-08-05 10:06:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 756 transitions. [2019-08-05 10:06:49,584 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 756 transitions. Word has length 29 [2019-08-05 10:06:49,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:49,585 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 756 transitions. [2019-08-05 10:06:49,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:06:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 756 transitions. [2019-08-05 10:06:49,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:06:49,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:49,586 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:49,586 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:49,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:49,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1870212148, now seen corresponding path program 1 times [2019-08-05 10:06:49,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:49,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:06:49,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:49,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:49,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:06:49,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:06:49,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:06:49,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:06:49,760 INFO L87 Difference]: Start difference. First operand 463 states and 756 transitions. Second operand 10 states. [2019-08-05 10:06:51,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:51,344 INFO L93 Difference]: Finished difference Result 660 states and 1069 transitions. [2019-08-05 10:06:51,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:06:51,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-05 10:06:51,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:51,349 INFO L225 Difference]: With dead ends: 660 [2019-08-05 10:06:51,349 INFO L226 Difference]: Without dead ends: 633 [2019-08-05 10:06:51,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:06:51,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-08-05 10:06:51,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 481. [2019-08-05 10:06:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-08-05 10:06:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 787 transitions. [2019-08-05 10:06:51,364 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 787 transitions. Word has length 29 [2019-08-05 10:06:51,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:51,364 INFO L475 AbstractCegarLoop]: Abstraction has 481 states and 787 transitions. [2019-08-05 10:06:51,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:06:51,365 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 787 transitions. [2019-08-05 10:06:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:06:51,365 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:51,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:51,366 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:51,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:51,366 INFO L82 PathProgramCache]: Analyzing trace with hash -731327642, now seen corresponding path program 1 times [2019-08-05 10:06:51,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:51,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:06:51,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:51,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:51,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:06:51,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:06:51,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:06:51,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:06:51,399 INFO L87 Difference]: Start difference. First operand 481 states and 787 transitions. Second operand 5 states. [2019-08-05 10:06:51,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:51,796 INFO L93 Difference]: Finished difference Result 525 states and 857 transitions. [2019-08-05 10:06:51,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:06:51,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-08-05 10:06:51,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:51,798 INFO L225 Difference]: With dead ends: 525 [2019-08-05 10:06:51,798 INFO L226 Difference]: Without dead ends: 505 [2019-08-05 10:06:51,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:06:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-08-05 10:06:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 468. [2019-08-05 10:06:51,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-08-05 10:06:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 766 transitions. [2019-08-05 10:06:51,803 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 766 transitions. Word has length 29 [2019-08-05 10:06:51,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:51,803 INFO L475 AbstractCegarLoop]: Abstraction has 468 states and 766 transitions. [2019-08-05 10:06:51,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:06:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 766 transitions. [2019-08-05 10:06:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:06:51,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:51,804 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:51,805 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:51,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:51,805 INFO L82 PathProgramCache]: Analyzing trace with hash 378728580, now seen corresponding path program 1 times [2019-08-05 10:06:51,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:51,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:06:51,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:51,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:06:51,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:06:51,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:06:51,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:06:51,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:06:51,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:06:51,911 INFO L87 Difference]: Start difference. First operand 468 states and 766 transitions. Second operand 8 states. [2019-08-05 10:06:52,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:52,798 INFO L93 Difference]: Finished difference Result 587 states and 961 transitions. [2019-08-05 10:06:52,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:06:52,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-08-05 10:06:52,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:52,802 INFO L225 Difference]: With dead ends: 587 [2019-08-05 10:06:52,802 INFO L226 Difference]: Without dead ends: 573 [2019-08-05 10:06:52,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:06:52,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-08-05 10:06:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 480. [2019-08-05 10:06:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-08-05 10:06:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 788 transitions. [2019-08-05 10:06:52,810 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 788 transitions. Word has length 29 [2019-08-05 10:06:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:52,810 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 788 transitions. [2019-08-05 10:06:52,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:06:52,810 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 788 transitions. [2019-08-05 10:06:52,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:06:52,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:52,811 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:52,811 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:52,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:52,812 INFO L82 PathProgramCache]: Analyzing trace with hash 758582233, now seen corresponding path program 1 times [2019-08-05 10:06:52,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:52,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:06:52,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:53,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:53,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:06:53,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:06:53,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:06:53,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:06:53,078 INFO L87 Difference]: Start difference. First operand 480 states and 788 transitions. Second operand 10 states. [2019-08-05 10:06:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:54,913 INFO L93 Difference]: Finished difference Result 568 states and 926 transitions. [2019-08-05 10:06:54,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:06:54,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-05 10:06:54,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:54,916 INFO L225 Difference]: With dead ends: 568 [2019-08-05 10:06:54,916 INFO L226 Difference]: Without dead ends: 560 [2019-08-05 10:06:54,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=135, Unknown=1, NotChecked=0, Total=182 [2019-08-05 10:06:54,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-08-05 10:06:54,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 511. [2019-08-05 10:06:54,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-08-05 10:06:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 839 transitions. [2019-08-05 10:06:54,929 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 839 transitions. Word has length 29 [2019-08-05 10:06:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:54,930 INFO L475 AbstractCegarLoop]: Abstraction has 511 states and 839 transitions. [2019-08-05 10:06:54,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:06:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 839 transitions. [2019-08-05 10:06:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:06:54,930 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:54,930 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:54,931 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:54,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:54,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1536180715, now seen corresponding path program 2 times [2019-08-05 10:06:54,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:54,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:06:54,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:54,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:54,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:06:54,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:06:54,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:06:54,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:06:54,970 INFO L87 Difference]: Start difference. First operand 511 states and 839 transitions. Second operand 5 states. [2019-08-05 10:06:55,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:06:55,266 INFO L93 Difference]: Finished difference Result 524 states and 861 transitions. [2019-08-05 10:06:55,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:06:55,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-08-05 10:06:55,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:06:55,270 INFO L225 Difference]: With dead ends: 524 [2019-08-05 10:06:55,270 INFO L226 Difference]: Without dead ends: 524 [2019-08-05 10:06:55,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:06:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-08-05 10:06:55,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 502. [2019-08-05 10:06:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-08-05 10:06:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 824 transitions. [2019-08-05 10:06:55,277 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 824 transitions. Word has length 29 [2019-08-05 10:06:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:06:55,277 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 824 transitions. [2019-08-05 10:06:55,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:06:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 824 transitions. [2019-08-05 10:06:55,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:06:55,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:06:55,278 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:06:55,279 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:06:55,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:06:55,279 INFO L82 PathProgramCache]: Analyzing trace with hash -296152981, now seen corresponding path program 1 times [2019-08-05 10:06:55,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:06:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:06:55,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:06:55,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:06:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:06:55,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:06:55,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:06:55,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:06:55,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:06:55,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:06:55,555 INFO L87 Difference]: Start difference. First operand 502 states and 824 transitions. Second operand 12 states. [2019-08-05 10:07:08,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:08,768 INFO L93 Difference]: Finished difference Result 586 states and 947 transitions. [2019-08-05 10:07:08,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:07:08,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2019-08-05 10:07:08,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:08,772 INFO L225 Difference]: With dead ends: 586 [2019-08-05 10:07:08,772 INFO L226 Difference]: Without dead ends: 573 [2019-08-05 10:07:08,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=44, Invalid=194, Unknown=2, NotChecked=0, Total=240 [2019-08-05 10:07:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-08-05 10:07:08,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 505. [2019-08-05 10:07:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-08-05 10:07:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 828 transitions. [2019-08-05 10:07:08,778 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 828 transitions. Word has length 29 [2019-08-05 10:07:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:08,779 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 828 transitions. [2019-08-05 10:07:08,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:07:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 828 transitions. [2019-08-05 10:07:08,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:07:08,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:08,780 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:08,780 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:08,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:08,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1414515044, now seen corresponding path program 1 times [2019-08-05 10:07:08,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:08,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:07:08,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:07:08,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:08,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:07:08,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:07:08,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:07:08,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:07:08,924 INFO L87 Difference]: Start difference. First operand 505 states and 828 transitions. Second operand 8 states. [2019-08-05 10:07:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:11,270 INFO L93 Difference]: Finished difference Result 567 states and 927 transitions. [2019-08-05 10:07:11,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:07:11,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-08-05 10:07:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:11,274 INFO L225 Difference]: With dead ends: 567 [2019-08-05 10:07:11,274 INFO L226 Difference]: Without dead ends: 550 [2019-08-05 10:07:11,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:07:11,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-08-05 10:07:11,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 525. [2019-08-05 10:07:11,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-08-05 10:07:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 862 transitions. [2019-08-05 10:07:11,281 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 862 transitions. Word has length 29 [2019-08-05 10:07:11,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:11,281 INFO L475 AbstractCegarLoop]: Abstraction has 525 states and 862 transitions. [2019-08-05 10:07:11,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:07:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 862 transitions. [2019-08-05 10:07:11,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:07:11,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:11,282 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:11,283 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:11,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:11,283 INFO L82 PathProgramCache]: Analyzing trace with hash -149991992, now seen corresponding path program 2 times [2019-08-05 10:07:11,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:11,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:07:11,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:07:11,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:11,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:07:11,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:07:11,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:07:11,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:07:11,860 INFO L87 Difference]: Start difference. First operand 525 states and 862 transitions. Second operand 8 states. [2019-08-05 10:07:12,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:12,875 INFO L93 Difference]: Finished difference Result 659 states and 1083 transitions. [2019-08-05 10:07:12,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:07:12,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-08-05 10:07:12,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:12,879 INFO L225 Difference]: With dead ends: 659 [2019-08-05 10:07:12,880 INFO L226 Difference]: Without dead ends: 634 [2019-08-05 10:07:12,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:07:12,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-08-05 10:07:12,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 532. [2019-08-05 10:07:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-08-05 10:07:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 877 transitions. [2019-08-05 10:07:12,886 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 877 transitions. Word has length 29 [2019-08-05 10:07:12,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:12,886 INFO L475 AbstractCegarLoop]: Abstraction has 532 states and 877 transitions. [2019-08-05 10:07:12,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:07:12,887 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 877 transitions. [2019-08-05 10:07:12,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:07:12,887 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:12,887 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:12,888 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:12,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:12,888 INFO L82 PathProgramCache]: Analyzing trace with hash 954606899, now seen corresponding path program 1 times [2019-08-05 10:07:12,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:12,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:07:12,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:12,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:12,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:07:12,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:07:12,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:07:12,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:07:12,924 INFO L87 Difference]: Start difference. First operand 532 states and 877 transitions. Second operand 6 states. [2019-08-05 10:07:13,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:13,896 INFO L93 Difference]: Finished difference Result 693 states and 1135 transitions. [2019-08-05 10:07:13,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:07:13,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-08-05 10:07:13,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:13,900 INFO L225 Difference]: With dead ends: 693 [2019-08-05 10:07:13,900 INFO L226 Difference]: Without dead ends: 691 [2019-08-05 10:07:13,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:07:13,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-08-05 10:07:13,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 529. [2019-08-05 10:07:13,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-08-05 10:07:13,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 871 transitions. [2019-08-05 10:07:13,907 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 871 transitions. Word has length 30 [2019-08-05 10:07:13,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:13,907 INFO L475 AbstractCegarLoop]: Abstraction has 529 states and 871 transitions. [2019-08-05 10:07:13,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:07:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 871 transitions. [2019-08-05 10:07:13,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:07:13,908 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:13,908 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:13,908 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:13,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:13,909 INFO L82 PathProgramCache]: Analyzing trace with hash 431946348, now seen corresponding path program 1 times [2019-08-05 10:07:13,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:13,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:07:13,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:07:13,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:13,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:07:13,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:07:13,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:07:13,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:07:13,995 INFO L87 Difference]: Start difference. First operand 529 states and 871 transitions. Second operand 4 states. [2019-08-05 10:07:14,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:14,206 INFO L93 Difference]: Finished difference Result 537 states and 884 transitions. [2019-08-05 10:07:14,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:07:14,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-08-05 10:07:14,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:14,210 INFO L225 Difference]: With dead ends: 537 [2019-08-05 10:07:14,210 INFO L226 Difference]: Without dead ends: 537 [2019-08-05 10:07:14,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:07:14,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-08-05 10:07:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 527. [2019-08-05 10:07:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-08-05 10:07:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 866 transitions. [2019-08-05 10:07:14,217 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 866 transitions. Word has length 30 [2019-08-05 10:07:14,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:14,217 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 866 transitions. [2019-08-05 10:07:14,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:07:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 866 transitions. [2019-08-05 10:07:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:07:14,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:14,218 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:14,218 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:14,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:14,218 INFO L82 PathProgramCache]: Analyzing trace with hash 929469834, now seen corresponding path program 1 times [2019-08-05 10:07:14,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:14,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:07:14,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:14,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:14,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:07:14,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:07:14,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:07:14,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:07:14,440 INFO L87 Difference]: Start difference. First operand 527 states and 866 transitions. Second operand 9 states. [2019-08-05 10:07:15,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:15,843 INFO L93 Difference]: Finished difference Result 765 states and 1252 transitions. [2019-08-05 10:07:15,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:07:15,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-08-05 10:07:15,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:15,846 INFO L225 Difference]: With dead ends: 765 [2019-08-05 10:07:15,846 INFO L226 Difference]: Without dead ends: 744 [2019-08-05 10:07:15,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:07:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-08-05 10:07:15,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 568. [2019-08-05 10:07:15,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-08-05 10:07:15,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 938 transitions. [2019-08-05 10:07:15,854 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 938 transitions. Word has length 30 [2019-08-05 10:07:15,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:15,854 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 938 transitions. [2019-08-05 10:07:15,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:07:15,854 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 938 transitions. [2019-08-05 10:07:15,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:07:15,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:15,856 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:15,856 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:15,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:15,856 INFO L82 PathProgramCache]: Analyzing trace with hash 113087375, now seen corresponding path program 2 times [2019-08-05 10:07:15,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:15,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:07:15,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:16,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:16,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:07:16,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:07:16,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:07:16,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:07:16,044 INFO L87 Difference]: Start difference. First operand 568 states and 938 transitions. Second operand 9 states. [2019-08-05 10:07:16,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:16,843 INFO L93 Difference]: Finished difference Result 567 states and 926 transitions. [2019-08-05 10:07:16,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:07:16,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-08-05 10:07:16,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:16,846 INFO L225 Difference]: With dead ends: 567 [2019-08-05 10:07:16,846 INFO L226 Difference]: Without dead ends: 567 [2019-08-05 10:07:16,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:07:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-08-05 10:07:16,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 531. [2019-08-05 10:07:16,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-08-05 10:07:16,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 872 transitions. [2019-08-05 10:07:16,852 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 872 transitions. Word has length 30 [2019-08-05 10:07:16,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:16,853 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 872 transitions. [2019-08-05 10:07:16,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:07:16,853 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 872 transitions. [2019-08-05 10:07:16,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:07:16,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:16,854 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:16,854 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:16,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:16,854 INFO L82 PathProgramCache]: Analyzing trace with hash -155725352, now seen corresponding path program 3 times [2019-08-05 10:07:16,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:16,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:07:16,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:17,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:17,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:07:17,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:07:17,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:07:17,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:07:17,418 INFO L87 Difference]: Start difference. First operand 531 states and 872 transitions. Second operand 13 states. [2019-08-05 10:07:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:19,525 INFO L93 Difference]: Finished difference Result 622 states and 1010 transitions. [2019-08-05 10:07:19,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:07:19,525 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-08-05 10:07:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:19,529 INFO L225 Difference]: With dead ends: 622 [2019-08-05 10:07:19,529 INFO L226 Difference]: Without dead ends: 598 [2019-08-05 10:07:19,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:07:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-08-05 10:07:19,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 519. [2019-08-05 10:07:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-08-05 10:07:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 851 transitions. [2019-08-05 10:07:19,535 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 851 transitions. Word has length 30 [2019-08-05 10:07:19,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:19,535 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 851 transitions. [2019-08-05 10:07:19,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:07:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 851 transitions. [2019-08-05 10:07:19,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:07:19,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:19,537 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:19,537 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:19,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:19,537 INFO L82 PathProgramCache]: Analyzing trace with hash -911580841, now seen corresponding path program 1 times [2019-08-05 10:07:19,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:19,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:07:19,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:19,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:19,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:19,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:07:19,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:07:19,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:07:19,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:07:19,653 INFO L87 Difference]: Start difference. First operand 519 states and 851 transitions. Second operand 4 states. [2019-08-05 10:07:19,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:19,861 INFO L93 Difference]: Finished difference Result 435 states and 700 transitions. [2019-08-05 10:07:19,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:07:19,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-08-05 10:07:19,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:19,864 INFO L225 Difference]: With dead ends: 435 [2019-08-05 10:07:19,864 INFO L226 Difference]: Without dead ends: 434 [2019-08-05 10:07:19,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:07:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-08-05 10:07:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 429. [2019-08-05 10:07:19,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-08-05 10:07:19,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 690 transitions. [2019-08-05 10:07:19,869 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 690 transitions. Word has length 30 [2019-08-05 10:07:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:19,870 INFO L475 AbstractCegarLoop]: Abstraction has 429 states and 690 transitions. [2019-08-05 10:07:19,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:07:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 690 transitions. [2019-08-05 10:07:19,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:07:19,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:19,870 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:19,871 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:19,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:19,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1870674657, now seen corresponding path program 1 times [2019-08-05 10:07:19,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:19,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:07:19,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:20,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:20,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:20,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:20,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:20,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:20,019 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:20,431 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 70 [2019-08-05 10:07:20,619 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 82 [2019-08-05 10:07:20,789 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2019-08-05 10:07:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:20,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:20,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:07:20,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:07:20,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:07:20,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:07:20,799 INFO L87 Difference]: Start difference. First operand 429 states and 690 transitions. Second operand 11 states. [2019-08-05 10:07:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:21,751 INFO L93 Difference]: Finished difference Result 449 states and 717 transitions. [2019-08-05 10:07:21,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:07:21,752 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2019-08-05 10:07:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:21,754 INFO L225 Difference]: With dead ends: 449 [2019-08-05 10:07:21,755 INFO L226 Difference]: Without dead ends: 449 [2019-08-05 10:07:21,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:07:21,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-08-05 10:07:21,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 433. [2019-08-05 10:07:21,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-08-05 10:07:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 694 transitions. [2019-08-05 10:07:21,760 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 694 transitions. Word has length 31 [2019-08-05 10:07:21,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:21,760 INFO L475 AbstractCegarLoop]: Abstraction has 433 states and 694 transitions. [2019-08-05 10:07:21,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:07:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 694 transitions. [2019-08-05 10:07:21,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:07:21,761 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:21,761 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:21,761 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:21,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:21,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1882415859, now seen corresponding path program 2 times [2019-08-05 10:07:21,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:21,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:07:21,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:07:21,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:21,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:07:21,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:07:21,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:07:21,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:07:21,891 INFO L87 Difference]: Start difference. First operand 433 states and 694 transitions. Second operand 9 states. [2019-08-05 10:07:23,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:23,096 INFO L93 Difference]: Finished difference Result 586 states and 931 transitions. [2019-08-05 10:07:23,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:07:23,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-08-05 10:07:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:23,098 INFO L225 Difference]: With dead ends: 586 [2019-08-05 10:07:23,098 INFO L226 Difference]: Without dead ends: 560 [2019-08-05 10:07:23,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:07:23,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-08-05 10:07:23,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 427. [2019-08-05 10:07:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-08-05 10:07:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 683 transitions. [2019-08-05 10:07:23,106 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 683 transitions. Word has length 31 [2019-08-05 10:07:23,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:23,106 INFO L475 AbstractCegarLoop]: Abstraction has 427 states and 683 transitions. [2019-08-05 10:07:23,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:07:23,106 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 683 transitions. [2019-08-05 10:07:23,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:07:23,107 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:23,107 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:23,107 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:23,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:23,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1480489831, now seen corresponding path program 2 times [2019-08-05 10:07:23,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:23,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:07:23,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:07:23,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:23,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:07:23,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:07:23,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:07:23,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:07:23,387 INFO L87 Difference]: Start difference. First operand 427 states and 683 transitions. Second operand 12 states. [2019-08-05 10:07:25,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:25,670 INFO L93 Difference]: Finished difference Result 580 states and 931 transitions. [2019-08-05 10:07:25,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:07:25,670 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-08-05 10:07:25,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:25,674 INFO L225 Difference]: With dead ends: 580 [2019-08-05 10:07:25,674 INFO L226 Difference]: Without dead ends: 543 [2019-08-05 10:07:25,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:07:25,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-08-05 10:07:25,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 441. [2019-08-05 10:07:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-08-05 10:07:25,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 709 transitions. [2019-08-05 10:07:25,681 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 709 transitions. Word has length 31 [2019-08-05 10:07:25,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:25,681 INFO L475 AbstractCegarLoop]: Abstraction has 441 states and 709 transitions. [2019-08-05 10:07:25,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:07:25,681 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 709 transitions. [2019-08-05 10:07:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:07:25,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:25,682 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:25,682 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:25,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:25,682 INFO L82 PathProgramCache]: Analyzing trace with hash 328738653, now seen corresponding path program 1 times [2019-08-05 10:07:25,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:25,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:07:25,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:25,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:07:25,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:25,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:07:25,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:25,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:25,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:25,741 INFO L87 Difference]: Start difference. First operand 441 states and 709 transitions. Second operand 3 states. [2019-08-05 10:07:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:26,036 INFO L93 Difference]: Finished difference Result 507 states and 818 transitions. [2019-08-05 10:07:26,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:26,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-08-05 10:07:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:26,040 INFO L225 Difference]: With dead ends: 507 [2019-08-05 10:07:26,040 INFO L226 Difference]: Without dead ends: 507 [2019-08-05 10:07:26,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:26,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-08-05 10:07:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 454. [2019-08-05 10:07:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-08-05 10:07:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 734 transitions. [2019-08-05 10:07:26,047 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 734 transitions. Word has length 32 [2019-08-05 10:07:26,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:26,048 INFO L475 AbstractCegarLoop]: Abstraction has 454 states and 734 transitions. [2019-08-05 10:07:26,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 734 transitions. [2019-08-05 10:07:26,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:07:26,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:26,049 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:26,049 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:26,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:26,050 INFO L82 PathProgramCache]: Analyzing trace with hash -478003720, now seen corresponding path program 2 times [2019-08-05 10:07:26,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:26,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:07:26,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:26,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:07:26,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:26,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:07:26,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:07:26,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:07:26,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:07:26,359 INFO L87 Difference]: Start difference. First operand 454 states and 734 transitions. Second operand 13 states. [2019-08-05 10:07:30,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:30,137 INFO L93 Difference]: Finished difference Result 621 states and 1002 transitions. [2019-08-05 10:07:30,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:07:30,137 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-08-05 10:07:30,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:30,140 INFO L225 Difference]: With dead ends: 621 [2019-08-05 10:07:30,140 INFO L226 Difference]: Without dead ends: 597 [2019-08-05 10:07:30,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:07:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-08-05 10:07:30,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 468. [2019-08-05 10:07:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-08-05 10:07:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 760 transitions. [2019-08-05 10:07:30,148 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 760 transitions. Word has length 32 [2019-08-05 10:07:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:30,148 INFO L475 AbstractCegarLoop]: Abstraction has 468 states and 760 transitions. [2019-08-05 10:07:30,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:07:30,151 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 760 transitions. [2019-08-05 10:07:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:07:30,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:30,154 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:30,154 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:30,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:30,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1277145523, now seen corresponding path program 1 times [2019-08-05 10:07:30,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:30,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:07:30,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:07:30,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:30,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:07:30,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:07:30,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:07:30,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:07:30,192 INFO L87 Difference]: Start difference. First operand 468 states and 760 transitions. Second operand 4 states. [2019-08-05 10:07:30,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:30,474 INFO L93 Difference]: Finished difference Result 577 states and 940 transitions. [2019-08-05 10:07:30,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:07:30,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-08-05 10:07:30,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:30,478 INFO L225 Difference]: With dead ends: 577 [2019-08-05 10:07:30,478 INFO L226 Difference]: Without dead ends: 562 [2019-08-05 10:07:30,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:07:30,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-08-05 10:07:30,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 421. [2019-08-05 10:07:30,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-08-05 10:07:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 678 transitions. [2019-08-05 10:07:30,486 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 678 transitions. Word has length 32 [2019-08-05 10:07:30,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:30,486 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 678 transitions. [2019-08-05 10:07:30,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:07:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 678 transitions. [2019-08-05 10:07:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:07:30,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:30,487 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:30,487 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:30,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:30,488 INFO L82 PathProgramCache]: Analyzing trace with hash -192594518, now seen corresponding path program 1 times [2019-08-05 10:07:30,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:30,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:07:30,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:30,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:07:30,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:30,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:07:30,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:07:30,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:07:30,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:07:30,534 INFO L87 Difference]: Start difference. First operand 421 states and 678 transitions. Second operand 4 states. [2019-08-05 10:07:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:30,734 INFO L93 Difference]: Finished difference Result 408 states and 645 transitions. [2019-08-05 10:07:30,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:07:30,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-08-05 10:07:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:30,737 INFO L225 Difference]: With dead ends: 408 [2019-08-05 10:07:30,737 INFO L226 Difference]: Without dead ends: 408 [2019-08-05 10:07:30,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:07:30,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-08-05 10:07:30,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 358. [2019-08-05 10:07:30,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-08-05 10:07:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 565 transitions. [2019-08-05 10:07:30,741 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 565 transitions. Word has length 33 [2019-08-05 10:07:30,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:30,742 INFO L475 AbstractCegarLoop]: Abstraction has 358 states and 565 transitions. [2019-08-05 10:07:30,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:07:30,742 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 565 transitions. [2019-08-05 10:07:30,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:07:30,742 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:30,742 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:30,743 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:30,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:30,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1461869241, now seen corresponding path program 3 times [2019-08-05 10:07:30,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:30,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:07:30,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:31,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:07:31,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:31,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:07:31,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:07:31,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:07:31,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:07:31,799 INFO L87 Difference]: Start difference. First operand 358 states and 565 transitions. Second operand 13 states. [2019-08-05 10:07:35,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:35,504 INFO L93 Difference]: Finished difference Result 606 states and 953 transitions. [2019-08-05 10:07:35,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:07:35,504 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2019-08-05 10:07:35,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:35,506 INFO L225 Difference]: With dead ends: 606 [2019-08-05 10:07:35,506 INFO L226 Difference]: Without dead ends: 595 [2019-08-05 10:07:35,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:07:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-08-05 10:07:35,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 368. [2019-08-05 10:07:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-08-05 10:07:35,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 583 transitions. [2019-08-05 10:07:35,512 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 583 transitions. Word has length 33 [2019-08-05 10:07:35,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:35,512 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 583 transitions. [2019-08-05 10:07:35,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:07:35,513 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 583 transitions. [2019-08-05 10:07:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:07:35,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:35,513 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:35,513 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:35,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:35,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1852363772, now seen corresponding path program 1 times [2019-08-05 10:07:35,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:35,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:07:35,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:35,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:35,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:07:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:07:35,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:35,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:07:35,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:07:35,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:07:35,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:07:35,774 INFO L87 Difference]: Start difference. First operand 368 states and 583 transitions. Second operand 10 states. [2019-08-05 10:07:36,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:36,463 INFO L93 Difference]: Finished difference Result 360 states and 569 transitions. [2019-08-05 10:07:36,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:07:36,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-08-05 10:07:36,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:36,464 INFO L225 Difference]: With dead ends: 360 [2019-08-05 10:07:36,464 INFO L226 Difference]: Without dead ends: 354 [2019-08-05 10:07:36,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:07:36,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-08-05 10:07:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 341. [2019-08-05 10:07:36,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-08-05 10:07:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 541 transitions. [2019-08-05 10:07:36,470 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 541 transitions. Word has length 33 [2019-08-05 10:07:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:36,470 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 541 transitions. [2019-08-05 10:07:36,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:07:36,471 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 541 transitions. [2019-08-05 10:07:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:07:36,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:36,471 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:36,472 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:36,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:36,472 INFO L82 PathProgramCache]: Analyzing trace with hash 410064182, now seen corresponding path program 1 times [2019-08-05 10:07:36,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:36,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:07:36,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:37,453 WARN L188 SmtUtils]: Spent 875.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-08-05 10:07:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:07:37,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:37,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-08-05 10:07:37,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:07:37,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:07:37,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:07:37,578 INFO L87 Difference]: Start difference. First operand 341 states and 541 transitions. Second operand 9 states. [2019-08-05 10:07:47,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:47,692 INFO L93 Difference]: Finished difference Result 484 states and 778 transitions. [2019-08-05 10:07:47,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:07:47,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-08-05 10:07:47,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:47,694 INFO L225 Difference]: With dead ends: 484 [2019-08-05 10:07:47,694 INFO L226 Difference]: Without dead ends: 471 [2019-08-05 10:07:47,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=51, Invalid=129, Unknown=2, NotChecked=0, Total=182 [2019-08-05 10:07:47,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-08-05 10:07:47,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 360. [2019-08-05 10:07:47,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-08-05 10:07:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 574 transitions. [2019-08-05 10:07:47,700 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 574 transitions. Word has length 34 [2019-08-05 10:07:47,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:47,701 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 574 transitions. [2019-08-05 10:07:47,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:07:47,701 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 574 transitions. [2019-08-05 10:07:47,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:07:47,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:47,702 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:47,702 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:47,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:47,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1446543978, now seen corresponding path program 1 times [2019-08-05 10:07:47,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:47,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:07:47,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:07:47,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:07:47,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:07:47,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:07:47,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:07:47,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:47,719 INFO L87 Difference]: Start difference. First operand 360 states and 574 transitions. Second operand 3 states. [2019-08-05 10:07:47,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:07:47,868 INFO L93 Difference]: Finished difference Result 355 states and 563 transitions. [2019-08-05 10:07:47,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:07:47,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-08-05 10:07:47,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:07:47,870 INFO L225 Difference]: With dead ends: 355 [2019-08-05 10:07:47,870 INFO L226 Difference]: Without dead ends: 318 [2019-08-05 10:07:47,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:07:47,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-08-05 10:07:47,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 282. [2019-08-05 10:07:47,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-08-05 10:07:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 449 transitions. [2019-08-05 10:07:47,875 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 449 transitions. Word has length 34 [2019-08-05 10:07:47,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:07:47,875 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 449 transitions. [2019-08-05 10:07:47,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:07:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 449 transitions. [2019-08-05 10:07:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:07:47,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:07:47,876 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:07:47,876 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:07:47,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:07:47,876 INFO L82 PathProgramCache]: Analyzing trace with hash -145390874, now seen corresponding path program 3 times [2019-08-05 10:07:47,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:07:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:07:47,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:07:47,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:07:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:07:48,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:07:48,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:07:48,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:07:48,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:07:48,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:07:48,714 INFO L87 Difference]: Start difference. First operand 282 states and 449 transitions. Second operand 14 states. [2019-08-05 10:07:49,690 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2019-08-05 10:07:53,570 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-08-05 10:07:54,608 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-08-05 10:07:56,278 WARN L188 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-08-05 10:08:01,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:08:01,211 INFO L93 Difference]: Finished difference Result 443 states and 708 transitions. [2019-08-05 10:08:01,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:08:01,212 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-08-05 10:08:01,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:08:01,213 INFO L225 Difference]: With dead ends: 443 [2019-08-05 10:08:01,213 INFO L226 Difference]: Without dead ends: 418 [2019-08-05 10:08:01,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=257, Invalid=1225, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:08:01,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-08-05 10:08:01,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 273. [2019-08-05 10:08:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-08-05 10:08:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 432 transitions. [2019-08-05 10:08:01,219 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 432 transitions. Word has length 34 [2019-08-05 10:08:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:08:01,220 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 432 transitions. [2019-08-05 10:08:01,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:08:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 432 transitions. [2019-08-05 10:08:01,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:08:01,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:08:01,221 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:08:01,221 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:08:01,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:08:01,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1926694410, now seen corresponding path program 1 times [2019-08-05 10:08:01,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:08:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:08:01,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:08:01,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:08:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:08:02,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:08:02,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:08:02,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:08:02,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:08:02,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=130, Unknown=1, NotChecked=0, Total=156 [2019-08-05 10:08:02,580 INFO L87 Difference]: Start difference. First operand 273 states and 432 transitions. Second operand 13 states. [2019-08-05 10:09:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:19,160 INFO L93 Difference]: Finished difference Result 425 states and 670 transitions. [2019-08-05 10:09:19,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:09:19,161 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-08-05 10:09:19,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:19,162 INFO L225 Difference]: With dead ends: 425 [2019-08-05 10:09:19,162 INFO L226 Difference]: Without dead ends: 395 [2019-08-05 10:09:19,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=101, Invalid=548, Unknown=1, NotChecked=0, Total=650 [2019-08-05 10:09:19,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-08-05 10:09:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 280. [2019-08-05 10:09:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-08-05 10:09:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 444 transitions. [2019-08-05 10:09:19,166 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 444 transitions. Word has length 34 [2019-08-05 10:09:19,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:19,166 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 444 transitions. [2019-08-05 10:09:19,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:09:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 444 transitions. [2019-08-05 10:09:19,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:09:19,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:19,167 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:19,167 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:19,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:19,168 INFO L82 PathProgramCache]: Analyzing trace with hash -32257919, now seen corresponding path program 1 times [2019-08-05 10:09:19,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:19,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:09:19,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:19,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:19,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:09:19,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:19,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:09:19,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:09:19,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:09:19,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:09:19,298 INFO L87 Difference]: Start difference. First operand 280 states and 444 transitions. Second operand 8 states. [2019-08-05 10:09:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:20,026 INFO L93 Difference]: Finished difference Result 298 states and 474 transitions. [2019-08-05 10:09:20,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:09:20,026 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-08-05 10:09:20,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:20,027 INFO L225 Difference]: With dead ends: 298 [2019-08-05 10:09:20,027 INFO L226 Difference]: Without dead ends: 156 [2019-08-05 10:09:20,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:09:20,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-08-05 10:09:20,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 145. [2019-08-05 10:09:20,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 10:09:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 204 transitions. [2019-08-05 10:09:20,030 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 204 transitions. Word has length 34 [2019-08-05 10:09:20,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:20,030 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 204 transitions. [2019-08-05 10:09:20,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:09:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 204 transitions. [2019-08-05 10:09:20,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:09:20,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:20,031 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:20,031 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:20,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:20,031 INFO L82 PathProgramCache]: Analyzing trace with hash 406719493, now seen corresponding path program 1 times [2019-08-05 10:09:20,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:20,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:09:20,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:20,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,175 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,175 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,178 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:09:20,415 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 79 [2019-08-05 10:09:20,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-08-05 10:09:20,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:09:20,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:09:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:09:20,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:20,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:09:20,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:20,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:20,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:20,745 INFO L87 Difference]: Start difference. First operand 145 states and 204 transitions. Second operand 9 states. [2019-08-05 10:09:21,356 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-08-05 10:09:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:21,836 INFO L93 Difference]: Finished difference Result 198 states and 278 transitions. [2019-08-05 10:09:21,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:09:21,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-08-05 10:09:21,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:21,837 INFO L225 Difference]: With dead ends: 198 [2019-08-05 10:09:21,837 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 10:09:21,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:09:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 10:09:21,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2019-08-05 10:09:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 10:09:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 223 transitions. [2019-08-05 10:09:21,841 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 223 transitions. Word has length 35 [2019-08-05 10:09:21,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:21,841 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 223 transitions. [2019-08-05 10:09:21,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 223 transitions. [2019-08-05 10:09:21,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:09:21,842 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:21,842 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:21,842 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:21,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:21,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1139090665, now seen corresponding path program 1 times [2019-08-05 10:09:21,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:21,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:09:21,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:09:21,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:21,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:09:21,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:09:21,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:09:21,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:09:21,957 INFO L87 Difference]: Start difference. First operand 158 states and 223 transitions. Second operand 9 states. [2019-08-05 10:09:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:30,652 INFO L93 Difference]: Finished difference Result 258 states and 373 transitions. [2019-08-05 10:09:30,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:09:30,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-08-05 10:09:30,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:30,654 INFO L225 Difference]: With dead ends: 258 [2019-08-05 10:09:30,654 INFO L226 Difference]: Without dead ends: 240 [2019-08-05 10:09:30,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:09:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-08-05 10:09:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 192. [2019-08-05 10:09:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-08-05 10:09:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 274 transitions. [2019-08-05 10:09:30,657 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 274 transitions. Word has length 35 [2019-08-05 10:09:30,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:30,657 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 274 transitions. [2019-08-05 10:09:30,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:09:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 274 transitions. [2019-08-05 10:09:30,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:09:30,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:30,657 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:30,658 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:30,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:30,658 INFO L82 PathProgramCache]: Analyzing trace with hash -747351435, now seen corresponding path program 4 times [2019-08-05 10:09:30,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:30,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:09:30,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:31,006 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:09:31,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:31,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:09:31,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:09:31,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:09:31,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:09:31,008 INFO L87 Difference]: Start difference. First operand 192 states and 274 transitions. Second operand 16 states. [2019-08-05 10:09:32,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:32,848 INFO L93 Difference]: Finished difference Result 239 states and 341 transitions. [2019-08-05 10:09:32,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:09:32,849 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2019-08-05 10:09:32,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:32,849 INFO L225 Difference]: With dead ends: 239 [2019-08-05 10:09:32,849 INFO L226 Difference]: Without dead ends: 239 [2019-08-05 10:09:32,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:09:32,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-08-05 10:09:32,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 213. [2019-08-05 10:09:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-08-05 10:09:32,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 302 transitions. [2019-08-05 10:09:32,853 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 302 transitions. Word has length 35 [2019-08-05 10:09:32,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:32,853 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 302 transitions. [2019-08-05 10:09:32,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:09:32,853 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 302 transitions. [2019-08-05 10:09:32,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:09:32,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:32,854 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:32,854 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:32,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:32,854 INFO L82 PathProgramCache]: Analyzing trace with hash -532693535, now seen corresponding path program 1 times [2019-08-05 10:09:32,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:32,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:09:32,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:09:32,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:09:32,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:09:32,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:09:32,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:09:32,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:32,988 INFO L87 Difference]: Start difference. First operand 213 states and 302 transitions. Second operand 3 states. [2019-08-05 10:09:33,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:33,138 INFO L93 Difference]: Finished difference Result 215 states and 304 transitions. [2019-08-05 10:09:33,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:09:33,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-08-05 10:09:33,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:33,139 INFO L225 Difference]: With dead ends: 215 [2019-08-05 10:09:33,140 INFO L226 Difference]: Without dead ends: 201 [2019-08-05 10:09:33,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:09:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-08-05 10:09:33,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 193. [2019-08-05 10:09:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-08-05 10:09:33,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 272 transitions. [2019-08-05 10:09:33,143 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 272 transitions. Word has length 35 [2019-08-05 10:09:33,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:33,143 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 272 transitions. [2019-08-05 10:09:33,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:09:33,143 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 272 transitions. [2019-08-05 10:09:33,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:09:33,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:33,144 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:33,144 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:33,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:33,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1693057380, now seen corresponding path program 2 times [2019-08-05 10:09:33,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:33,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:09:33,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:09:35,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:35,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:09:35,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:09:35,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:09:35,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=153, Unknown=2, NotChecked=0, Total=182 [2019-08-05 10:09:35,416 INFO L87 Difference]: Start difference. First operand 193 states and 272 transitions. Second operand 14 states. [2019-08-05 10:09:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:41,307 INFO L93 Difference]: Finished difference Result 219 states and 318 transitions. [2019-08-05 10:09:41,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:09:41,308 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-08-05 10:09:41,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:41,308 INFO L225 Difference]: With dead ends: 219 [2019-08-05 10:09:41,308 INFO L226 Difference]: Without dead ends: 184 [2019-08-05 10:09:41,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=46, Invalid=258, Unknown=2, NotChecked=0, Total=306 [2019-08-05 10:09:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-08-05 10:09:41,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2019-08-05 10:09:41,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 10:09:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 254 transitions. [2019-08-05 10:09:41,310 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 254 transitions. Word has length 36 [2019-08-05 10:09:41,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:41,311 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 254 transitions. [2019-08-05 10:09:41,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:09:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 254 transitions. [2019-08-05 10:09:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:09:41,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:41,311 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:41,311 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:41,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:41,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1564949399, now seen corresponding path program 2 times [2019-08-05 10:09:41,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:41,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:09:41,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:41,929 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:09:41,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:41,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:09:41,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:09:41,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:09:41,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=87, Unknown=1, NotChecked=0, Total=110 [2019-08-05 10:09:41,930 INFO L87 Difference]: Start difference. First operand 180 states and 254 transitions. Second operand 11 states. [2019-08-05 10:09:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:43,292 INFO L93 Difference]: Finished difference Result 199 states and 276 transitions. [2019-08-05 10:09:43,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:09:43,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-08-05 10:09:43,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:43,294 INFO L225 Difference]: With dead ends: 199 [2019-08-05 10:09:43,294 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 10:09:43,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=125, Unknown=1, NotChecked=0, Total=156 [2019-08-05 10:09:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 10:09:43,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 81. [2019-08-05 10:09:43,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:09:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2019-08-05 10:09:43,296 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 37 [2019-08-05 10:09:43,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:43,297 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2019-08-05 10:09:43,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:09:43,297 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2019-08-05 10:09:43,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:09:43,298 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:09:43,298 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:09:43,298 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:09:43,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:09:43,298 INFO L82 PathProgramCache]: Analyzing trace with hash -2014602939, now seen corresponding path program 1 times [2019-08-05 10:09:43,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:09:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:09:43,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:09:43,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:09:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 10:09:43,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:09:43,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:09:43,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:09:43,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:09:43,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:09:43,435 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand 6 states. [2019-08-05 10:09:43,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:09:43,602 INFO L93 Difference]: Finished difference Result 64 states and 90 transitions. [2019-08-05 10:09:43,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:09:43,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-08-05 10:09:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:09:43,603 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:09:43,603 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:09:43,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:09:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:09:43,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:09:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:09:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:09:43,604 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-08-05 10:09:43,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:09:43,604 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:09:43,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:09:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:09:43,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:09:43,610 INFO L202 PluginConnector]: Adding new model RanFile075.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:09:43 BoogieIcfgContainer [2019-08-05 10:09:43,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:09:43,612 INFO L168 Benchmark]: Toolchain (without parser) took 244468.59 ms. Allocated memory was 134.7 MB in the beginning and 198.7 MB in the end (delta: 64.0 MB). Free memory was 108.3 MB in the beginning and 146.3 MB in the end (delta: -38.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:43,612 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 134.7 MB. Free memory is still 110.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:09:43,613 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.22 ms. Allocated memory is still 134.7 MB. Free memory was 107.9 MB in the beginning and 106.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:43,613 INFO L168 Benchmark]: Boogie Preprocessor took 68.38 ms. Allocated memory is still 134.7 MB. Free memory was 106.2 MB in the beginning and 103.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:43,614 INFO L168 Benchmark]: RCFGBuilder took 2798.03 ms. Allocated memory was 134.7 MB in the beginning and 170.9 MB in the end (delta: 36.2 MB). Free memory was 103.7 MB in the beginning and 109.5 MB in the end (delta: -5.8 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:09:43,615 INFO L168 Benchmark]: TraceAbstraction took 241554.46 ms. Allocated memory was 170.9 MB in the beginning and 198.7 MB in the end (delta: 27.8 MB). Free memory was 109.5 MB in the beginning and 146.3 MB in the end (delta: -36.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:09:43,617 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.19 ms. Allocated memory is still 134.7 MB. Free memory is still 110.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.22 ms. Allocated memory is still 134.7 MB. Free memory was 107.9 MB in the beginning and 106.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.38 ms. Allocated memory is still 134.7 MB. Free memory was 106.2 MB in the beginning and 103.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2798.03 ms. Allocated memory was 134.7 MB in the beginning and 170.9 MB in the end (delta: 36.2 MB). Free memory was 103.7 MB in the beginning and 109.5 MB in the end (delta: -5.8 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241554.46 ms. Allocated memory was 170.9 MB in the beginning and 198.7 MB in the end (delta: 27.8 MB). Free memory was 109.5 MB in the beginning and 146.3 MB in the end (delta: -36.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 348]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 349]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 347]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 77 locations, 3 error locations. SAFE Result, 241.4s OverallTime, 67 OverallIterations, 4 TraceHistogramMax, 216.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6660 SDtfs, 5363 SDslu, 5805 SDs, 0 SdLazy, 61997 SolverSat, 1059 SolverUnsat, 50 SolverUnknown, 0 SolverNotchecked, 189.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2211 GetRequests, 1461 SyntacticMatches, 15 SemanticMatches, 735 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1844 ImplicationChecksByTransitivity, 36.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=568occurred in iteration=43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 67 MinimizatonAttempts, 3955 StatesRemovedByMinimization, 65 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 23.6s InterpolantComputationTime, 1974 NumberOfCodeBlocks, 1974 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 1907 ConstructedInterpolants, 596 QuantifiedInterpolants, 686992 SizeOfPredicates, 222 NumberOfNonLiveVariables, 4483 ConjunctsInSsa, 757 ConjunctsInUnsatCore, 67 InterpolantComputations, 27 PerfectInterpolantSequences, 114/242 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...