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/recursive/Eiger.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:07:59,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:07:59,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:07:59,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:07:59,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:07:59,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:07:59,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:07:59,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:07:59,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:07:59,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:07:59,968 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:07:59,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:07:59,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:07:59,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:07:59,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:07:59,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:07:59,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:07:59,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:07:59,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:07:59,980 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:07:59,982 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:07:59,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:07:59,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:07:59,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:07:59,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:07:59,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:07:59,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:07:59,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:07:59,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:07:59,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:07:59,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:07:59,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:07:59,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:07:59,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:08:00,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:08:00,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:08:00,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:08:00,003 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:08:00,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:08:00,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:08:00,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:08:00,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:08:00,056 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:08:00,059 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:08:00,061 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:08:00,061 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:08:00,063 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/recursive/Eiger.bpl [2019-08-05 11:08:00,064 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/recursive/Eiger.bpl' [2019-08-05 11:08:00,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:08:00,102 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:08:00,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:08:00,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:08:00,103 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:08:00,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Eiger.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... [2019-08-05 11:08:00,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Eiger.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... [2019-08-05 11:08:00,139 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:08:00,139 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:08:00,140 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:08:00,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:08:00,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:08:00,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:08:00,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:08:00,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Eiger.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... [2019-08-05 11:08:00,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Eiger.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... [2019-08-05 11:08:00,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Eiger.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... [2019-08-05 11:08:00,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Eiger.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... [2019-08-05 11:08:00,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Eiger.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... [2019-08-05 11:08:00,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Eiger.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... [2019-08-05 11:08:00,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Eiger.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... [2019-08-05 11:08:00,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:08:00,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:08:00,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:08:00,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:08:00,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Eiger.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:08:00,258 INFO L130 BoogieDeclarations]: Found specification of procedure increaseByTwo [2019-08-05 11:08:00,258 INFO L138 BoogieDeclarations]: Found implementation of procedure increaseByTwo [2019-08-05 11:08:00,258 INFO L130 BoogieDeclarations]: Found specification of procedure decreaseByOne [2019-08-05 11:08:00,258 INFO L138 BoogieDeclarations]: Found implementation of procedure decreaseByOne [2019-08-05 11:08:00,259 INFO L130 BoogieDeclarations]: Found specification of procedure Main [2019-08-05 11:08:00,259 INFO L138 BoogieDeclarations]: Found implementation of procedure Main [2019-08-05 11:08:00,707 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:08:00,707 INFO L283 CfgBuilder]: Removed 9 assume(true) statements. [2019-08-05 11:08:00,708 INFO L202 PluginConnector]: Adding new model Eiger.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:08:00 BoogieIcfgContainer [2019-08-05 11:08:00,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:08:00,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:08:00,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:08:00,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:08:00,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Eiger.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:00" (1/2) ... [2019-08-05 11:08:00,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7aa71e and model type Eiger.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:08:00, skipping insertion in model container [2019-08-05 11:08:00,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Eiger.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:08:00" (2/2) ... [2019-08-05 11:08:00,716 INFO L109 eAbstractionObserver]: Analyzing ICFG Eiger.bpl [2019-08-05 11:08:00,725 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:08:00,731 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 11:08:00,748 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 11:08:00,770 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:08:00,771 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:08:00,771 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:08:00,772 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:08:00,772 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:08:00,772 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:08:00,772 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:08:00,772 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:08:00,773 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:08:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-08-05 11:08:00,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:08:00,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:00,792 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:08:00,795 INFO L418 AbstractCegarLoop]: === Iteration 1 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:00,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1165, now seen corresponding path program 1 times [2019-08-05 11:08:00,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:00,874 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:08:00,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:00,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:00,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:08:00,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:00,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:00,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:00,971 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2019-08-05 11:08:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:01,061 INFO L93 Difference]: Finished difference Result 14 states and 12 transitions. [2019-08-05 11:08:01,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:01,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:08:01,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:01,074 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:08:01,074 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:08:01,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:01,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:08:01,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-08-05 11:08:01,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:08:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 11:08:01,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 2 [2019-08-05 11:08:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:01,109 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 11:08:01,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 11:08:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:08:01,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:01,110 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:08:01,110 INFO L418 AbstractCegarLoop]: === Iteration 2 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:01,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:01,111 INFO L82 PathProgramCache]: Analyzing trace with hash 36166, now seen corresponding path program 1 times [2019-08-05 11:08:01,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:01,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:08:01,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:01,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:01,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:08:01,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:01,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:01,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:01,229 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2019-08-05 11:08:01,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:01,276 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:08:01,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:01,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:08:01,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:01,278 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:08:01,278 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:08:01,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 11:08:01,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:08:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:08:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:08:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:08:01,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-08-05 11:08:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:01,282 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:08:01,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:08:01,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:08:01,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:01,283 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:08:01,283 INFO L418 AbstractCegarLoop]: === Iteration 3 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:01,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:01,284 INFO L82 PathProgramCache]: Analyzing trace with hash 36474, now seen corresponding path program 1 times [2019-08-05 11:08:01,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:01,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:08:01,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:01,391 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 11:08:01,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:01,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 11:08:01,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:08:01,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:08:01,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:08:01,393 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 4 states. [2019-08-05 11:08:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:01,509 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:08:01,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:08:01,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:08:01,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:01,510 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:08:01,510 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:08:01,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:08:01,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:08:01,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-08-05 11:08:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:08:01,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 11:08:01,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 3 [2019-08-05 11:08:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:01,513 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 11:08:01,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:08:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 11:08:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:08:01,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:01,514 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:08:01,514 INFO L418 AbstractCegarLoop]: === Iteration 4 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:01,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:01,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1130745, now seen corresponding path program 1 times [2019-08-05 11:08:01,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:01,530 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:08:01,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:01,680 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 11:08:01,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:01,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 11:08:01,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:08:01,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:08:01,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:08:01,681 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-05 11:08:01,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:01,769 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:08:01,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:08:01,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:08:01,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:01,771 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:08:01,771 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:08:01,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 11:08:01,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:08:01,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:08:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:08:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:08:01,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-05 11:08:01,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:01,775 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:08:01,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:08:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:08:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:08:01,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:01,776 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-08-05 11:08:01,776 INFO L418 AbstractCegarLoop]: === Iteration 5 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:01,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1131053, now seen corresponding path program 2 times [2019-08-05 11:08:01,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:01,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:08:01,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:01,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:01,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:08:01,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:08:01,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:08:01,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:08:01,944 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 11:08:01,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:01,993 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:08:01,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:08:01,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 11:08:01,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:01,999 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:08:02,000 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:08:02,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:08:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:08:02,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2019-08-05 11:08:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:08:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-05 11:08:02,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 4 [2019-08-05 11:08:02,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:02,003 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-05 11:08:02,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:08:02,003 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-05 11:08:02,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:08:02,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:02,003 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:08:02,004 INFO L418 AbstractCegarLoop]: === Iteration 6 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:02,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:02,006 INFO L82 PathProgramCache]: Analyzing trace with hash 35062694, now seen corresponding path program 2 times [2019-08-05 11:08:02,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:02,038 WARN L254 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:08:02,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:02,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:02,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:08:02,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:08:02,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:08:02,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:08:02,126 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2019-08-05 11:08:02,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:02,300 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:08:02,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:08:02,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:08:02,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:02,301 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:08:02,302 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:08:02,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:08:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:08:02,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:08:02,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:08:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:08:02,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-08-05 11:08:02,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:02,307 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:08:02,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:08:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:08:02,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:08:02,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:02,308 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-08-05 11:08:02,308 INFO L418 AbstractCegarLoop]: === Iteration 7 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:02,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:02,309 INFO L82 PathProgramCache]: Analyzing trace with hash 35063002, now seen corresponding path program 3 times [2019-08-05 11:08:02,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:02,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:08:02,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:02,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:02,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:08:02,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:08:02,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:08:02,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:08:02,433 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-08-05 11:08:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:02,527 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:08:02,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:08:02,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 11:08:02,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:02,528 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:08:02,528 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:08:02,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:08:02,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:08:02,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-08-05 11:08:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:08:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 11:08:02,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2019-08-05 11:08:02,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:02,531 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 11:08:02,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:08:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 11:08:02,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:08:02,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:02,532 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 11:08:02,532 INFO L418 AbstractCegarLoop]: === Iteration 8 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:02,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:02,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1086953113, now seen corresponding path program 3 times [2019-08-05 11:08:02,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:02,567 WARN L254 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:08:02,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:02,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:02,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:08:02,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:08:02,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:08:02,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:08:02,662 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2019-08-05 11:08:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:02,712 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:08:02,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:08:02,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 11:08:02,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:02,713 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:08:02,714 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:08:02,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:08:02,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:08:02,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:08:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:08:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:08:02,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 11:08:02,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:02,717 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:08:02,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:08:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:08:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:08:02,718 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:02,718 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1] [2019-08-05 11:08:02,718 INFO L418 AbstractCegarLoop]: === Iteration 9 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:02,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:02,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1086953421, now seen corresponding path program 4 times [2019-08-05 11:08:02,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:02,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:08:02,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:03,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:03,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:03,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:08:03,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:08:03,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:08:03,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:08:03,064 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-08-05 11:08:03,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:03,132 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:08:03,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:08:03,133 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 11:08:03,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:03,133 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:08:03,134 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:08:03,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:08:03,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:08:03,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2019-08-05 11:08:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:08:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-05 11:08:03,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2019-08-05 11:08:03,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:03,137 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-05 11:08:03,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:08:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-05 11:08:03,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:08:03,138 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:03,138 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 11:08:03,138 INFO L418 AbstractCegarLoop]: === Iteration 10 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:03,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:03,139 INFO L82 PathProgramCache]: Analyzing trace with hash -664182266, now seen corresponding path program 4 times [2019-08-05 11:08:03,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:03,162 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:08:03,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:03,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:03,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:03,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:08:03,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:08:03,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:08:03,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:08:03,276 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 7 states. [2019-08-05 11:08:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:03,331 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:08:03,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:08:03,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 11:08:03,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:03,333 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:08:03,333 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:08:03,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:08:03,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:08:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:08:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:08:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:08:03,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 11:08:03,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:03,337 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:08:03,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:08:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:08:03,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:08:03,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:03,338 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1] [2019-08-05 11:08:03,339 INFO L418 AbstractCegarLoop]: === Iteration 11 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:03,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:03,339 INFO L82 PathProgramCache]: Analyzing trace with hash -664181958, now seen corresponding path program 5 times [2019-08-05 11:08:03,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:03,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:08:03,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:03,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:03,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:08:03,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:08:03,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:08:03,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:08:03,536 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-08-05 11:08:03,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:03,641 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:08:03,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:08:03,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 11:08:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:03,645 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:08:03,646 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:08:03,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:08:03,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:08:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-08-05 11:08:03,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:08:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 11:08:03,648 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 7 [2019-08-05 11:08:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:03,648 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 11:08:03,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:08:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 11:08:03,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:08:03,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:03,649 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 11:08:03,650 INFO L418 AbstractCegarLoop]: === Iteration 12 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:03,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:03,650 INFO L82 PathProgramCache]: Analyzing trace with hash 885195833, now seen corresponding path program 5 times [2019-08-05 11:08:03,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:03,698 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:08:03,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:03,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:03,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:08:03,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:08:03,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:08:03,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:08:03,934 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 8 states. [2019-08-05 11:08:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:04,055 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:08:04,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:08:04,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 11:08:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:04,056 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:08:04,057 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:08:04,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:08:04,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:08:04,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:08:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:08:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:08:04,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 11:08:04,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:04,061 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:08:04,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:08:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:08:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:08:04,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:04,062 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1] [2019-08-05 11:08:04,062 INFO L418 AbstractCegarLoop]: === Iteration 13 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:04,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:04,063 INFO L82 PathProgramCache]: Analyzing trace with hash 885196141, now seen corresponding path program 6 times [2019-08-05 11:08:04,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:04,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:08:04,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:04,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:04,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:08:04,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:08:04,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:08:04,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:08:04,237 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2019-08-05 11:08:04,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:04,339 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:08:04,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:08:04,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 11:08:04,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:04,341 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:08:04,341 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:08:04,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:08:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:08:04,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-08-05 11:08:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:08:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-08-05 11:08:04,345 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2019-08-05 11:08:04,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:04,345 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-08-05 11:08:04,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:08:04,345 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-08-05 11:08:04,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:08:04,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:04,346 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 11:08:04,346 INFO L418 AbstractCegarLoop]: === Iteration 14 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:04,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:04,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1671276646, now seen corresponding path program 6 times [2019-08-05 11:08:04,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:04,370 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:08:04,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:04,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:04,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:08:04,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:08:04,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:08:04,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:08:04,542 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 9 states. [2019-08-05 11:08:04,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:04,641 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:08:04,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:08:04,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 11:08:04,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:04,643 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:08:04,643 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:08:04,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:08:04,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:08:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:08:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:08:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:08:04,646 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 11:08:04,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:04,646 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:08:04,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:08:04,647 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:08:04,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:08:04,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:04,647 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1] [2019-08-05 11:08:04,648 INFO L418 AbstractCegarLoop]: === Iteration 15 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:04,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:04,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1671276954, now seen corresponding path program 7 times [2019-08-05 11:08:04,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:04,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:08:04,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:04,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:04,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:08:04,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:08:04,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:08:04,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:08:04,811 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2019-08-05 11:08:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:04,898 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:08:04,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:08:04,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 11:08:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:04,899 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:08:04,899 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:08:04,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:08:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:08:04,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-08-05 11:08:04,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:08:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 11:08:04,901 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2019-08-05 11:08:04,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:04,902 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 11:08:04,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:08:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 11:08:04,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:08:04,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:04,902 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 11:08:04,903 INFO L418 AbstractCegarLoop]: === Iteration 16 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:04,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:04,903 INFO L82 PathProgramCache]: Analyzing trace with hash 269978073, now seen corresponding path program 7 times [2019-08-05 11:08:04,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:04,928 WARN L254 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:08:04,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:05,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:05,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:08:05,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:08:05,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:08:05,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:08:05,082 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 10 states. [2019-08-05 11:08:05,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:05,191 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:08:05,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:08:05,192 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 11:08:05,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:05,193 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:08:05,193 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:08:05,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:08:05,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:08:05,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:08:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:08:05,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:08:05,197 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 11:08:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:05,197 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:08:05,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:08:05,198 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:08:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:08:05,198 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:05,198 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1] [2019-08-05 11:08:05,199 INFO L418 AbstractCegarLoop]: === Iteration 17 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:05,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:05,199 INFO L82 PathProgramCache]: Analyzing trace with hash 269978381, now seen corresponding path program 8 times [2019-08-05 11:08:05,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:05,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:08:05,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:05,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:05,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:08:05,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:08:05,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:08:05,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:08:05,424 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2019-08-05 11:08:05,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:05,525 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:08:05,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:08:05,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 11:08:05,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:05,528 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:08:05,528 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:08:05,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:08:05,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:08:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-08-05 11:08:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:08:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-08-05 11:08:05,531 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-08-05 11:08:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:05,531 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-08-05 11:08:05,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:08:05,532 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-08-05 11:08:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:08:05,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:05,532 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 11:08:05,533 INFO L418 AbstractCegarLoop]: === Iteration 18 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:05,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:05,533 INFO L82 PathProgramCache]: Analyzing trace with hash -220604730, now seen corresponding path program 8 times [2019-08-05 11:08:05,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:05,556 WARN L254 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:08:05,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:05,944 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:05,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:05,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:08:05,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:08:05,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:08:05,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:08:05,945 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 11 states. [2019-08-05 11:08:06,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:06,066 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:08:06,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:08:06,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 11:08:06,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:06,067 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:08:06,067 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:08:06,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:08:06,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:08:06,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:08:06,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:08:06,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:08:06,071 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 11:08:06,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:06,072 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:08:06,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:08:06,072 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:08:06,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:08:06,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:06,073 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1] [2019-08-05 11:08:06,073 INFO L418 AbstractCegarLoop]: === Iteration 19 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:06,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:06,073 INFO L82 PathProgramCache]: Analyzing trace with hash -220604422, now seen corresponding path program 9 times [2019-08-05 11:08:06,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:06,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:08:06,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:06,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:06,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:08:06,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:08:06,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:08:06,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:08:06,399 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2019-08-05 11:08:06,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:06,534 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:08:06,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:08:06,536 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 11:08:06,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:06,537 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:08:06,537 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:08:06,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:08:06,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:08:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-08-05 11:08:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:08:06,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 11:08:06,540 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2019-08-05 11:08:06,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:06,540 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 11:08:06,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:08:06,540 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 11:08:06,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:08:06,541 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:06,541 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 11:08:06,541 INFO L418 AbstractCegarLoop]: === Iteration 20 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:06,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:06,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1751197561, now seen corresponding path program 9 times [2019-08-05 11:08:06,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:06,562 WARN L254 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 11:08:06,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:06,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:06,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:08:06,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:08:06,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:08:06,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:08:06,882 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 12 states. [2019-08-05 11:08:07,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:07,031 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:08:07,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:08:07,033 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 11:08:07,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:07,034 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:08:07,034 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:08:07,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:08:07,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:08:07,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:08:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:08:07,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:08:07,037 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 11:08:07,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:07,037 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:08:07,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:08:07,037 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:08:07,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:08:07,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:07,038 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1] [2019-08-05 11:08:07,038 INFO L418 AbstractCegarLoop]: === Iteration 21 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:07,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:07,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1751197869, now seen corresponding path program 10 times [2019-08-05 11:08:07,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:07,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:08:07,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:07,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:07,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:08:07,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:08:07,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:08:07,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:08:07,328 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2019-08-05 11:08:07,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:07,899 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:08:07,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:08:07,901 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 11:08:07,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:07,901 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:08:07,901 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:08:07,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:08:07,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:08:07,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-08-05 11:08:07,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:08:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-08-05 11:08:07,904 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2019-08-05 11:08:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:07,904 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-08-05 11:08:07,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:08:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-08-05 11:08:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:08:07,905 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:07,905 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 11:08:07,905 INFO L418 AbstractCegarLoop]: === Iteration 22 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:07,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:07,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1547440858, now seen corresponding path program 10 times [2019-08-05 11:08:07,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:07,925 WARN L254 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 11:08:07,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:08,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:08,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:08:08,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:08:08,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:08:08,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:08:08,107 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 13 states. [2019-08-05 11:08:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:08,383 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:08:08,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:08:08,385 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 11:08:08,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:08,386 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:08:08,386 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:08:08,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:08:08,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:08:08,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:08:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:08:08,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:08:08,389 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 11:08:08,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:08,389 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:08:08,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:08:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:08:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:08:08,390 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:08,390 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1] [2019-08-05 11:08:08,390 INFO L418 AbstractCegarLoop]: === Iteration 23 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:08,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:08,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1547440550, now seen corresponding path program 11 times [2019-08-05 11:08:08,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:08,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:08:08,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:08,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:08,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:08:08,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:08:08,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:08:08,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:08:08,801 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2019-08-05 11:08:08,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:08,999 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:08:08,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:08:09,000 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 11:08:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:09,000 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:08:09,001 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:08:09,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:08:09,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:08:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-08-05 11:08:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:08:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 11:08:09,003 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2019-08-05 11:08:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:09,004 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 11:08:09,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:08:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 11:08:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:08:09,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:09,005 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 11:08:09,005 INFO L418 AbstractCegarLoop]: === Iteration 24 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:09,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:09,005 INFO L82 PathProgramCache]: Analyzing trace with hash -726016743, now seen corresponding path program 11 times [2019-08-05 11:08:09,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:09,027 WARN L254 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 11:08:09,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:09,290 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:09,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:09,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:08:09,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:08:09,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:08:09,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:08:09,292 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 14 states. [2019-08-05 11:08:09,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:09,520 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:08:09,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:08:09,520 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 11:08:09,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:09,521 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:08:09,521 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:08:09,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:08:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:08:09,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:08:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:08:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:08:09,524 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 11:08:09,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:09,524 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:08:09,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:08:09,525 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:08:09,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:08:09,534 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:09,534 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1] [2019-08-05 11:08:09,534 INFO L418 AbstractCegarLoop]: === Iteration 25 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:09,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:09,534 INFO L82 PathProgramCache]: Analyzing trace with hash -726016435, now seen corresponding path program 12 times [2019-08-05 11:08:09,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:09,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:08:09,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:10,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:10,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:08:10,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:08:10,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:08:10,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:08:10,572 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2019-08-05 11:08:10,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:10,769 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:08:10,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:08:10,770 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 11:08:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:10,771 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:08:10,771 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:08:10,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:08:10,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:08:10,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-08-05 11:08:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:08:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-08-05 11:08:10,774 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2019-08-05 11:08:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:10,774 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-08-05 11:08:10,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:08:10,775 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-08-05 11:08:10,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:08:10,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:10,775 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 11:08:10,775 INFO L418 AbstractCegarLoop]: === Iteration 26 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:10,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:10,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1031672954, now seen corresponding path program 12 times [2019-08-05 11:08:10,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:10,797 WARN L254 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-05 11:08:10,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:11,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:11,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:08:11,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:08:11,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:08:11,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:08:11,118 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 15 states. [2019-08-05 11:08:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:11,360 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:08:11,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:08:11,361 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 11:08:11,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:11,362 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:08:11,362 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:08:11,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:08:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:08:11,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:08:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:08:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:08:11,366 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-08-05 11:08:11,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:11,366 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:08:11,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:08:11,366 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:08:11,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:08:11,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:11,367 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1] [2019-08-05 11:08:11,367 INFO L418 AbstractCegarLoop]: === Iteration 27 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:11,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:11,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1031672646, now seen corresponding path program 13 times [2019-08-05 11:08:11,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:11,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:08:11,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:12,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:12,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:08:12,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:08:12,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:08:12,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:08:12,122 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2019-08-05 11:08:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:12,337 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:08:12,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:08:12,337 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 11:08:12,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:12,338 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:08:12,339 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:08:12,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:08:12,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:08:12,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-08-05 11:08:12,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:08:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-05 11:08:12,342 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2019-08-05 11:08:12,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:12,342 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-05 11:08:12,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:08:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-05 11:08:12,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:08:12,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:12,343 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 11:08:12,344 INFO L418 AbstractCegarLoop]: === Iteration 28 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:12,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:12,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1917080903, now seen corresponding path program 13 times [2019-08-05 11:08:12,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:12,369 WARN L254 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 161 conjunts are in the unsatisfiable core [2019-08-05 11:08:12,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:12,705 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:12,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:12,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:08:12,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:08:12,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:08:12,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:08:12,707 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 16 states. [2019-08-05 11:08:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:12,951 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:08:12,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:08:12,952 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 11:08:12,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:12,952 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:08:12,953 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:08:12,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:08:12,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:08:12,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:08:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:08:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:08:12,956 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-05 11:08:12,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:12,956 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:08:12,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:08:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:08:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:08:12,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:12,957 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1] [2019-08-05 11:08:12,958 INFO L418 AbstractCegarLoop]: === Iteration 29 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:12,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:12,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1917080595, now seen corresponding path program 14 times [2019-08-05 11:08:12,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:12,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:08:12,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:13,193 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:13,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:13,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:08:13,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:08:13,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:08:13,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:08:13,194 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2019-08-05 11:08:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:13,422 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:08:13,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:08:13,423 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 11:08:13,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:13,424 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:08:13,424 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:08:13,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:08:13,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:08:13,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-08-05 11:08:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:08:13,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-08-05 11:08:13,427 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2019-08-05 11:08:13,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:13,427 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-08-05 11:08:13,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:08:13,427 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-08-05 11:08:13,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:08:13,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:13,428 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 11:08:13,428 INFO L418 AbstractCegarLoop]: === Iteration 30 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:13,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:13,428 INFO L82 PathProgramCache]: Analyzing trace with hash 700043750, now seen corresponding path program 14 times [2019-08-05 11:08:13,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:13,453 WARN L254 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 173 conjunts are in the unsatisfiable core [2019-08-05 11:08:13,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:14,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:14,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:08:14,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:08:14,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:08:14,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:08:14,632 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 17 states. [2019-08-05 11:08:14,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:14,901 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:08:14,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:08:14,902 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 11:08:14,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:14,902 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:08:14,902 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:08:14,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:08:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:08:14,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:08:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:08:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:08:14,905 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-08-05 11:08:14,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:14,906 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:08:14,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:08:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:08:14,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:08:14,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:14,906 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1] [2019-08-05 11:08:14,907 INFO L418 AbstractCegarLoop]: === Iteration 31 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:14,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:14,907 INFO L82 PathProgramCache]: Analyzing trace with hash 700044058, now seen corresponding path program 15 times [2019-08-05 11:08:14,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:14,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:08:14,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:15,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:15,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:08:15,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:08:15,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:08:15,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:08:15,530 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 18 states. [2019-08-05 11:08:15,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:15,801 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:08:15,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:08:15,801 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 11:08:15,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:15,802 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:08:15,802 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:08:15,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:08:15,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:08:15,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-08-05 11:08:15,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:08:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-05 11:08:15,805 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2019-08-05 11:08:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:15,805 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-05 11:08:15,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:08:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-05 11:08:15,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:08:15,806 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:15,806 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 11:08:15,806 INFO L418 AbstractCegarLoop]: === Iteration 32 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:15,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:15,807 INFO L82 PathProgramCache]: Analyzing trace with hash 226529369, now seen corresponding path program 15 times [2019-08-05 11:08:15,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:15,835 WARN L254 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 185 conjunts are in the unsatisfiable core [2019-08-05 11:08:15,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:16,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:16,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:08:16,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:08:16,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:08:16,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:08:16,249 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 18 states. [2019-08-05 11:08:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:16,516 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:08:16,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:08:16,517 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 11:08:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:16,517 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:08:16,517 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:08:16,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:08:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:08:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:08:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:08:16,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:08:16,522 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-08-05 11:08:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:16,523 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:08:16,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:08:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:08:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:08:16,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:16,523 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1] [2019-08-05 11:08:16,524 INFO L418 AbstractCegarLoop]: === Iteration 33 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:16,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:16,524 INFO L82 PathProgramCache]: Analyzing trace with hash 226529677, now seen corresponding path program 16 times [2019-08-05 11:08:16,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:16,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:08:16,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:16,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:16,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:08:16,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:08:16,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:08:16,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:08:16,807 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 19 states. [2019-08-05 11:08:17,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:17,101 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:08:17,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:08:17,102 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 11:08:17,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:17,103 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:08:17,103 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:08:17,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:08:17,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:08:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-08-05 11:08:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:08:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-08-05 11:08:17,106 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2019-08-05 11:08:17,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:17,106 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-08-05 11:08:17,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:08:17,106 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-08-05 11:08:17,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:08:17,107 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:17,107 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 11:08:17,107 INFO L418 AbstractCegarLoop]: === Iteration 34 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:17,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:17,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1567514554, now seen corresponding path program 16 times [2019-08-05 11:08:17,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:17,134 WARN L254 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 197 conjunts are in the unsatisfiable core [2019-08-05 11:08:17,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:17,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:17,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:08:17,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:08:17,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:08:17,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:08:17,540 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 19 states. [2019-08-05 11:08:18,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:18,202 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:08:18,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:08:18,202 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 11:08:18,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:18,203 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:08:18,203 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:08:18,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:08:18,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:08:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:08:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:08:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:08:18,206 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-08-05 11:08:18,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:18,206 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:08:18,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:08:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:08:18,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:08:18,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:18,207 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1] [2019-08-05 11:08:18,207 INFO L418 AbstractCegarLoop]: === Iteration 35 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:18,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:18,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1567514246, now seen corresponding path program 17 times [2019-08-05 11:08:18,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:18,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:08:18,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:18,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:18,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:08:18,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:08:18,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:08:18,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:08:18,675 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 20 states. [2019-08-05 11:08:19,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:19,023 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:08:19,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:08:19,024 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 11:08:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:19,024 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:08:19,024 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:08:19,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:08:19,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:08:19,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-08-05 11:08:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:08:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-08-05 11:08:19,027 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2019-08-05 11:08:19,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:19,028 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-08-05 11:08:19,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:08:19,028 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-08-05 11:08:19,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:08:19,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:19,028 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 11:08:19,029 INFO L418 AbstractCegarLoop]: === Iteration 36 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:19,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:19,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1348301319, now seen corresponding path program 17 times [2019-08-05 11:08:19,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:19,061 WARN L254 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 209 conjunts are in the unsatisfiable core [2019-08-05 11:08:19,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:19,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:19,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:08:19,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:08:19,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:08:19,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:08:19,491 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 20 states. [2019-08-05 11:08:19,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:19,882 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:08:19,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:08:19,883 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 11:08:19,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:19,883 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:08:19,884 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:08:19,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:08:19,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:08:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:08:19,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:08:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:08:19,888 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-08-05 11:08:19,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:19,888 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:08:19,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:08:19,888 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:08:19,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:08:19,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:19,889 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1] [2019-08-05 11:08:19,889 INFO L418 AbstractCegarLoop]: === Iteration 37 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:19,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:19,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1348301011, now seen corresponding path program 18 times [2019-08-05 11:08:19,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:19,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:08:19,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:20,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:20,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:08:20,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:08:20,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:08:20,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:08:20,177 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 21 states. [2019-08-05 11:08:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:20,577 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 11:08:20,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:08:20,578 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 11:08:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:20,578 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:08:20,578 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:08:20,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:08:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:08:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-08-05 11:08:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:08:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-08-05 11:08:20,581 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2019-08-05 11:08:20,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:20,582 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-08-05 11:08:20,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:08:20,582 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-08-05 11:08:20,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:08:20,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:20,583 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 11:08:20,583 INFO L418 AbstractCegarLoop]: === Iteration 38 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:20,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:20,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1152341670, now seen corresponding path program 18 times [2019-08-05 11:08:20,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:20,610 WARN L254 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 221 conjunts are in the unsatisfiable core [2019-08-05 11:08:20,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:20,945 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:20,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:20,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:08:20,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:08:20,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:08:20,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:08:20,947 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 21 states. [2019-08-05 11:08:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:21,304 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:08:21,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:08:21,305 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 11:08:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:21,305 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:08:21,306 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:08:21,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:08:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:08:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:08:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:08:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:08:21,308 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-08-05 11:08:21,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:21,309 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:08:21,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:08:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:08:21,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:08:21,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:21,310 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1] [2019-08-05 11:08:21,310 INFO L418 AbstractCegarLoop]: === Iteration 39 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:21,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:21,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1152341978, now seen corresponding path program 19 times [2019-08-05 11:08:21,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:21,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:08:21,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:21,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:21,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:08:21,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:08:21,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:08:21,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:08:21,680 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 22 states. [2019-08-05 11:08:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:22,078 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:08:22,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:08:22,079 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 11:08:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:22,079 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:08:22,079 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:08:22,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:08:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:08:22,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-08-05 11:08:22,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:08:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-05 11:08:22,082 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2019-08-05 11:08:22,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:22,082 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-05 11:08:22,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:08:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-05 11:08:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:08:22,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:22,083 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 11:08:22,083 INFO L418 AbstractCegarLoop]: === Iteration 40 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:22,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:22,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1362863001, now seen corresponding path program 19 times [2019-08-05 11:08:22,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:22,115 WARN L254 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 233 conjunts are in the unsatisfiable core [2019-08-05 11:08:22,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:22,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:22,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:08:22,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:08:22,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:08:22,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:08:22,440 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 22 states. [2019-08-05 11:08:22,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:22,833 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 11:08:22,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:08:22,833 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 11:08:22,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:22,834 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:08:22,834 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:08:22,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:08:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:08:22,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:08:22,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:08:22,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 11:08:22,837 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-08-05 11:08:22,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:22,837 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 11:08:22,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:08:22,837 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 11:08:22,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:08:22,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:22,838 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1] [2019-08-05 11:08:22,838 INFO L418 AbstractCegarLoop]: === Iteration 41 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:22,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:22,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1362863309, now seen corresponding path program 20 times [2019-08-05 11:08:22,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:22,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:08:22,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:23,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:23,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:08:23,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:08:23,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:08:23,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:08:23,180 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 23 states. [2019-08-05 11:08:23,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:23,579 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 11:08:23,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:08:23,580 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 11:08:23,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:23,581 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:08:23,581 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:08:23,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:08:23,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:08:23,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-08-05 11:08:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:08:23,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-08-05 11:08:23,584 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2019-08-05 11:08:23,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:23,584 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-08-05 11:08:23,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:08:23,585 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-08-05 11:08:23,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:08:23,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:23,585 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 11:08:23,585 INFO L418 AbstractCegarLoop]: === Iteration 42 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:23,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:23,586 INFO L82 PathProgramCache]: Analyzing trace with hash -700910330, now seen corresponding path program 20 times [2019-08-05 11:08:23,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:23,631 WARN L254 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 245 conjunts are in the unsatisfiable core [2019-08-05 11:08:23,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:23,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:23,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:08:23,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:08:23,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:08:23,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:08:23,980 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 23 states. [2019-08-05 11:08:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:24,520 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:08:24,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:08:24,521 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 11:08:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:24,522 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:08:24,522 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:08:24,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:08:24,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:08:24,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 11:08:24,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:08:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 11:08:24,524 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-08-05 11:08:24,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:24,525 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 11:08:24,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:08:24,525 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 11:08:24,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:08:24,525 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:24,526 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1] [2019-08-05 11:08:24,526 INFO L418 AbstractCegarLoop]: === Iteration 43 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:24,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:24,526 INFO L82 PathProgramCache]: Analyzing trace with hash -700910022, now seen corresponding path program 21 times [2019-08-05 11:08:24,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:24,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:08:24,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:24,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:24,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:08:24,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:08:24,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:08:24,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:08:24,863 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 24 states. [2019-08-05 11:08:25,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:25,293 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:08:25,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:08:25,294 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 11:08:25,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:25,294 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:08:25,295 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:08:25,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:08:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:08:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-08-05 11:08:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:08:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-08-05 11:08:25,297 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 23 [2019-08-05 11:08:25,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:25,297 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-08-05 11:08:25,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:08:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-08-05 11:08:25,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:08:25,298 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:25,298 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 11:08:25,298 INFO L418 AbstractCegarLoop]: === Iteration 44 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:25,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:25,299 INFO L82 PathProgramCache]: Analyzing trace with hash -253374151, now seen corresponding path program 21 times [2019-08-05 11:08:25,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:25,338 WARN L254 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 257 conjunts are in the unsatisfiable core [2019-08-05 11:08:25,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:25,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:25,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:08:25,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:08:25,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:08:25,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:08:25,735 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 24 states. [2019-08-05 11:08:26,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:26,213 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 11:08:26,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:08:26,213 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 11:08:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:26,214 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:08:26,214 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:08:26,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:08:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:08:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 11:08:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:08:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 11:08:26,216 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-08-05 11:08:26,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:26,216 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 11:08:26,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:08:26,217 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 11:08:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:08:26,217 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:26,217 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1] [2019-08-05 11:08:26,217 INFO L418 AbstractCegarLoop]: === Iteration 45 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:26,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:26,218 INFO L82 PathProgramCache]: Analyzing trace with hash -253373843, now seen corresponding path program 22 times [2019-08-05 11:08:26,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:26,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:08:26,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:26,547 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:26,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:26,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:08:26,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:08:26,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:08:26,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:08:26,549 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 25 states. [2019-08-05 11:08:27,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:27,019 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 11:08:27,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:08:27,020 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 11:08:27,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:27,020 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:08:27,021 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:08:27,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:08:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:08:27,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-08-05 11:08:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:08:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-08-05 11:08:27,023 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2019-08-05 11:08:27,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:27,023 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-08-05 11:08:27,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:08:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-08-05 11:08:27,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:08:27,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:27,024 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 11:08:27,024 INFO L418 AbstractCegarLoop]: === Iteration 46 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:27,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:27,025 INFO L82 PathProgramCache]: Analyzing trace with hash 735345510, now seen corresponding path program 22 times [2019-08-05 11:08:27,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:27,066 WARN L254 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 269 conjunts are in the unsatisfiable core [2019-08-05 11:08:27,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:27,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:27,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:08:27,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:08:27,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:08:27,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:08:27,566 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 25 states. [2019-08-05 11:08:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:28,073 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:08:28,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:08:28,073 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 11:08:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:28,074 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:08:28,074 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:08:28,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:08:28,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:08:28,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 11:08:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:08:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 11:08:28,077 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-08-05 11:08:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:28,077 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 11:08:28,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:08:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 11:08:28,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:08:28,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:28,078 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1] [2019-08-05 11:08:28,078 INFO L418 AbstractCegarLoop]: === Iteration 47 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:28,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:28,078 INFO L82 PathProgramCache]: Analyzing trace with hash 735345818, now seen corresponding path program 23 times [2019-08-05 11:08:28,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:28,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:08:28,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:28,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:28,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:08:28,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:08:28,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:08:28,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:08:28,521 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 26 states. [2019-08-05 11:08:29,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:29,030 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:08:29,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:08:29,031 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 11:08:29,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:29,031 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:08:29,031 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:08:29,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:08:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:08:29,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-08-05 11:08:29,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:08:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-08-05 11:08:29,034 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 25 [2019-08-05 11:08:29,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:29,034 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-08-05 11:08:29,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:08:29,035 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-08-05 11:08:29,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:08:29,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:29,035 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 11:08:29,035 INFO L418 AbstractCegarLoop]: === Iteration 48 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:29,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:29,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1320883929, now seen corresponding path program 23 times [2019-08-05 11:08:29,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:29,068 WARN L254 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 281 conjunts are in the unsatisfiable core [2019-08-05 11:08:29,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:29,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:29,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:08:29,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:08:29,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:08:29,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:08:29,821 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 26 states. [2019-08-05 11:08:30,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:30,370 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 11:08:30,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:08:30,370 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 11:08:30,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:30,371 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:08:30,371 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:08:30,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:08:30,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:08:30,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 11:08:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:08:30,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 11:08:30,374 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-08-05 11:08:30,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:30,374 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 11:08:30,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:08:30,375 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 11:08:30,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:08:30,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:30,375 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1] [2019-08-05 11:08:30,376 INFO L418 AbstractCegarLoop]: === Iteration 49 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:30,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:30,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1320884237, now seen corresponding path program 24 times [2019-08-05 11:08:30,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:30,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:08:30,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:30,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:30,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:08:30,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:08:30,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:08:30,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:08:30,804 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 27 states. [2019-08-05 11:08:31,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:31,351 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 11:08:31,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:08:31,352 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 11:08:31,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:31,352 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:08:31,352 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:08:31,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:08:31,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:08:31,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-08-05 11:08:31,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:08:31,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-08-05 11:08:31,356 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 26 [2019-08-05 11:08:31,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:31,356 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-08-05 11:08:31,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:08:31,356 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-08-05 11:08:31,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:08:31,357 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:31,357 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 11:08:31,357 INFO L418 AbstractCegarLoop]: === Iteration 50 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:31,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:31,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2002261562, now seen corresponding path program 24 times [2019-08-05 11:08:31,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:31,401 WARN L254 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 293 conjunts are in the unsatisfiable core [2019-08-05 11:08:31,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:31,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:31,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:08:31,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:08:31,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:08:31,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:08:31,992 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 27 states. [2019-08-05 11:08:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:32,584 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:08:32,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:08:32,585 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 11:08:32,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:32,586 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:08:32,586 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:08:32,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:08:32,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:08:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 11:08:32,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:08:32,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 11:08:32,588 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-08-05 11:08:32,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:32,589 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 11:08:32,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:08:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 11:08:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:08:32,589 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:32,589 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1] [2019-08-05 11:08:32,590 INFO L418 AbstractCegarLoop]: === Iteration 51 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:32,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:32,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2002261254, now seen corresponding path program 25 times [2019-08-05 11:08:32,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:32,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 11:08:32,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:33,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:33,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:08:33,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:08:33,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:08:33,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:08:33,025 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 28 states. [2019-08-05 11:08:33,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:33,637 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:08:33,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:08:33,637 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-08-05 11:08:33,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:33,638 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:08:33,638 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:08:33,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:08:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:08:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-08-05 11:08:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:08:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-08-05 11:08:33,641 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2019-08-05 11:08:33,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:33,641 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-08-05 11:08:33,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:08:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-08-05 11:08:33,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:08:33,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:33,642 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 11:08:33,642 INFO L418 AbstractCegarLoop]: === Iteration 52 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:33,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:33,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1940556679, now seen corresponding path program 25 times [2019-08-05 11:08:33,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:33,677 WARN L254 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 305 conjunts are in the unsatisfiable core [2019-08-05 11:08:33,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:34,355 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:34,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:34,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:08:34,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:08:34,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:08:34,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:08:34,357 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 28 states. [2019-08-05 11:08:35,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:35,106 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 11:08:35,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:08:35,107 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 11:08:35,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:35,108 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:08:35,108 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:08:35,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:08:35,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:08:35,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 11:08:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:08:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 11:08:35,110 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-08-05 11:08:35,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:35,111 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 11:08:35,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:08:35,111 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 11:08:35,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:08:35,111 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:35,111 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1] [2019-08-05 11:08:35,112 INFO L418 AbstractCegarLoop]: === Iteration 53 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:35,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:35,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1940556371, now seen corresponding path program 26 times [2019-08-05 11:08:35,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:35,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 11:08:35,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:35,943 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:35,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:35,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:08:35,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:08:35,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:08:35,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:08:35,944 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 29 states. [2019-08-05 11:08:36,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:36,601 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 11:08:36,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:08:36,601 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2019-08-05 11:08:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:36,602 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:08:36,602 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:08:36,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:08:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:08:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-08-05 11:08:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:08:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-08-05 11:08:36,605 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 28 [2019-08-05 11:08:36,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:36,605 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-08-05 11:08:36,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:08:36,605 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-08-05 11:08:36,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:08:36,606 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:36,606 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 11:08:36,606 INFO L418 AbstractCegarLoop]: === Iteration 54 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:36,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:36,607 INFO L82 PathProgramCache]: Analyzing trace with hash -27705306, now seen corresponding path program 26 times [2019-08-05 11:08:36,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:36,643 WARN L254 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 317 conjunts are in the unsatisfiable core [2019-08-05 11:08:36,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:37,165 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:37,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:37,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:08:37,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:08:37,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:08:37,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:08:37,166 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 29 states. [2019-08-05 11:08:37,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:37,856 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:08:37,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:08:37,857 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 11:08:37,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:37,857 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:08:37,857 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:08:37,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:08:37,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:08:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:08:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:08:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:08:37,860 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-08-05 11:08:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:37,860 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:08:37,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:08:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:08:37,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:08:37,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:37,861 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1] [2019-08-05 11:08:37,861 INFO L418 AbstractCegarLoop]: === Iteration 55 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:37,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:37,862 INFO L82 PathProgramCache]: Analyzing trace with hash -27704998, now seen corresponding path program 27 times [2019-08-05 11:08:37,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:37,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 11:08:37,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:38,332 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:38,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:38,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:08:38,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:08:38,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:08:38,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:08:38,333 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 30 states. [2019-08-05 11:08:39,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:39,018 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 11:08:39,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:08:39,018 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-08-05 11:08:39,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:39,019 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:08:39,019 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:08:39,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:08:39,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:08:39,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-08-05 11:08:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:08:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-08-05 11:08:39,022 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2019-08-05 11:08:39,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:39,022 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-08-05 11:08:39,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:08:39,022 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-08-05 11:08:39,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:08:39,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:39,022 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 11:08:39,023 INFO L418 AbstractCegarLoop]: === Iteration 56 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:39,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:39,023 INFO L82 PathProgramCache]: Analyzing trace with hash -858854887, now seen corresponding path program 27 times [2019-08-05 11:08:39,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:39,078 WARN L254 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 329 conjunts are in the unsatisfiable core [2019-08-05 11:08:39,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:40,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:40,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:08:40,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:08:40,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:08:40,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:08:40,129 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 30 states. [2019-08-05 11:08:40,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:40,864 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 11:08:40,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:08:40,865 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 11:08:40,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:40,866 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:08:40,866 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:08:40,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:08:40,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:08:40,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 11:08:40,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:08:40,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 11:08:40,868 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-08-05 11:08:40,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:40,869 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 11:08:40,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:08:40,869 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 11:08:40,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:08:40,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:40,869 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1] [2019-08-05 11:08:40,870 INFO L418 AbstractCegarLoop]: === Iteration 57 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:40,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:40,870 INFO L82 PathProgramCache]: Analyzing trace with hash -858854579, now seen corresponding path program 28 times [2019-08-05 11:08:40,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:40,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 11:08:40,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:41,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:41,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:08:41,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:08:41,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:08:41,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:08:41,487 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 31 states. [2019-08-05 11:08:42,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:42,213 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 11:08:42,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:08:42,214 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-08-05 11:08:42,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:42,214 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:08:42,215 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:08:42,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:08:42,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:08:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-08-05 11:08:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:08:42,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-08-05 11:08:42,217 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2019-08-05 11:08:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:42,217 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-08-05 11:08:42,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:08:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-08-05 11:08:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:08:42,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:42,218 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 11:08:42,218 INFO L418 AbstractCegarLoop]: === Iteration 58 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:42,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:42,219 INFO L82 PathProgramCache]: Analyzing trace with hash -854688122, now seen corresponding path program 28 times [2019-08-05 11:08:42,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:42,270 WARN L254 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 341 conjunts are in the unsatisfiable core [2019-08-05 11:08:42,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:42,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:42,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:08:42,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:08:42,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:08:42,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:08:42,809 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 31 states. [2019-08-05 11:08:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:43,595 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 11:08:43,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:08:43,595 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 11:08:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:43,596 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:08:43,596 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:08:43,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:08:43,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:08:43,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 11:08:43,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:08:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 11:08:43,599 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-08-05 11:08:43,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:43,599 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 11:08:43,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:08:43,600 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 11:08:43,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:08:43,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:43,600 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1] [2019-08-05 11:08:43,600 INFO L418 AbstractCegarLoop]: === Iteration 59 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:43,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:43,601 INFO L82 PathProgramCache]: Analyzing trace with hash -854687814, now seen corresponding path program 29 times [2019-08-05 11:08:43,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:43,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 11:08:43,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:44,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:44,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:08:44,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:08:44,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:08:44,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:08:44,844 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 32 states. [2019-08-05 11:08:45,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:45,647 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:08:45,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:08:45,647 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-08-05 11:08:45,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:45,648 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:08:45,648 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:08:45,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:08:45,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:08:45,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-08-05 11:08:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:08:45,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-08-05 11:08:45,650 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2019-08-05 11:08:45,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:45,651 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-08-05 11:08:45,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:08:45,651 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-08-05 11:08:45,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:08:45,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:45,651 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 11:08:45,652 INFO L418 AbstractCegarLoop]: === Iteration 60 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:45,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:45,652 INFO L82 PathProgramCache]: Analyzing trace with hash -725518407, now seen corresponding path program 29 times [2019-08-05 11:08:45,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:45,693 WARN L254 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 353 conjunts are in the unsatisfiable core [2019-08-05 11:08:45,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:46,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:46,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:08:46,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:08:46,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:08:46,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:08:46,224 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 32 states. [2019-08-05 11:08:47,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:47,063 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 11:08:47,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:08:47,063 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 11:08:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:47,064 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:08:47,064 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:08:47,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:08:47,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:08:47,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 11:08:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:08:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 11:08:47,066 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-08-05 11:08:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:47,067 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 11:08:47,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:08:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 11:08:47,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:08:47,067 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:47,067 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1] [2019-08-05 11:08:47,068 INFO L418 AbstractCegarLoop]: === Iteration 61 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:47,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:47,068 INFO L82 PathProgramCache]: Analyzing trace with hash -725518099, now seen corresponding path program 30 times [2019-08-05 11:08:47,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:47,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 11:08:47,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:47,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:47,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:08:47,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:08:47,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:08:47,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:08:47,613 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 33 states. [2019-08-05 11:08:48,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:48,439 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 11:08:48,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:08:48,439 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2019-08-05 11:08:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:48,440 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:08:48,440 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:08:48,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:08:48,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:08:48,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-08-05 11:08:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:08:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-08-05 11:08:48,443 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 32 [2019-08-05 11:08:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:48,443 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-08-05 11:08:48,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:08:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-08-05 11:08:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:08:48,443 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:48,444 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 11:08:48,444 INFO L418 AbstractCegarLoop]: === Iteration 62 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:48,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:48,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1016224538, now seen corresponding path program 30 times [2019-08-05 11:08:48,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:48,489 WARN L254 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 365 conjunts are in the unsatisfiable core [2019-08-05 11:08:48,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:49,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:49,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:08:49,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:08:49,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:08:49,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:08:49,065 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 33 states. [2019-08-05 11:08:50,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:50,075 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:08:50,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:08:50,075 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 11:08:50,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:50,076 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:08:50,076 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:08:50,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:08:50,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:08:50,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 11:08:50,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:08:50,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 11:08:50,078 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-08-05 11:08:50,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:50,079 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 11:08:50,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:08:50,079 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 11:08:50,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:08:50,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:50,079 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1] [2019-08-05 11:08:50,080 INFO L418 AbstractCegarLoop]: === Iteration 63 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:50,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:50,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1016224230, now seen corresponding path program 31 times [2019-08-05 11:08:50,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:50,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 11:08:50,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:50,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:50,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:08:50,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:08:50,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:08:50,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:08:50,699 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 34 states. [2019-08-05 11:08:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:51,576 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:08:51,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:08:51,576 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2019-08-05 11:08:51,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:51,577 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:08:51,577 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:08:51,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:08:51,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:08:51,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-08-05 11:08:51,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:08:51,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-08-05 11:08:51,580 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2019-08-05 11:08:51,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:51,580 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-08-05 11:08:51,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:08:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-08-05 11:08:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:08:51,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:51,581 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 11:08:51,581 INFO L418 AbstractCegarLoop]: === Iteration 64 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:51,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:51,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1438180007, now seen corresponding path program 31 times [2019-08-05 11:08:51,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:51,631 WARN L254 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 377 conjunts are in the unsatisfiable core [2019-08-05 11:08:51,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:52,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:52,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:08:52,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:08:52,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:08:52,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:08:52,288 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 34 states. [2019-08-05 11:08:53,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:53,236 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 11:08:53,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:08:53,237 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 11:08:53,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:53,238 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:08:53,238 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:08:53,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:08:53,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:08:53,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 11:08:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:08:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 11:08:53,240 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-08-05 11:08:53,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:53,241 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 11:08:53,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:08:53,241 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 11:08:53,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:08:53,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:53,242 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1] [2019-08-05 11:08:53,242 INFO L418 AbstractCegarLoop]: === Iteration 65 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:53,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:53,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1438179699, now seen corresponding path program 32 times [2019-08-05 11:08:53,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:53,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-05 11:08:53,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:53,840 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:53,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:53,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:08:53,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:08:53,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:08:53,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:08:53,841 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 35 states. [2019-08-05 11:08:54,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:54,809 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 11:08:54,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:08:54,810 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2019-08-05 11:08:54,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:54,810 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:08:54,810 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:08:54,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:08:54,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:08:54,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-08-05 11:08:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:08:54,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-08-05 11:08:54,812 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 34 [2019-08-05 11:08:54,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:54,812 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-08-05 11:08:54,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:08:54,812 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-08-05 11:08:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:08:54,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:54,813 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 11:08:54,813 INFO L418 AbstractCegarLoop]: === Iteration 66 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:54,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:54,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1633897658, now seen corresponding path program 32 times [2019-08-05 11:08:54,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:54,880 WARN L254 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 389 conjunts are in the unsatisfiable core [2019-08-05 11:08:54,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:55,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:55,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:08:55,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:08:55,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:08:55,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:08:55,810 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 35 states. [2019-08-05 11:08:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:56,814 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:08:56,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:08:56,814 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 11:08:56,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:56,815 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:08:56,815 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:08:56,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:08:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:08:56,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 11:08:56,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:08:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 11:08:56,817 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-08-05 11:08:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:56,818 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 11:08:56,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:08:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 11:08:56,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:08:56,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:56,818 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1] [2019-08-05 11:08:56,819 INFO L418 AbstractCegarLoop]: === Iteration 67 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:56,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:56,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1633897350, now seen corresponding path program 33 times [2019-08-05 11:08:56,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:56,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 11:08:56,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:57,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:57,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:08:57,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:08:57,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:08:57,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:08:57,528 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 36 states. [2019-08-05 11:08:58,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:58,507 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 11:08:58,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:08:58,507 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-08-05 11:08:58,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:58,508 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:08:58,508 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:08:58,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:08:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:08:58,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-08-05 11:08:58,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:08:58,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-08-05 11:08:58,510 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 35 [2019-08-05 11:08:58,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:58,511 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-08-05 11:08:58,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:08:58,511 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-08-05 11:08:58,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:08:58,511 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:58,512 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 11:08:58,512 INFO L418 AbstractCegarLoop]: === Iteration 68 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:58,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:58,513 INFO L82 PathProgramCache]: Analyzing trace with hash 888789753, now seen corresponding path program 33 times [2019-08-05 11:08:58,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:58,586 WARN L254 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 401 conjunts are in the unsatisfiable core [2019-08-05 11:08:58,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:08:59,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:59,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:08:59,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:08:59,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:08:59,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:08:59,491 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 36 states. [2019-08-05 11:09:00,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:00,702 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 11:09:00,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:09:00,702 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 11:09:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:00,703 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:09:00,703 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:09:00,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:09:00,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:09:00,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 11:09:00,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:09:00,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 11:09:00,706 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-08-05 11:09:00,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:00,706 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 11:09:00,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:09:00,706 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 11:09:00,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:09:00,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:00,707 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1] [2019-08-05 11:09:00,707 INFO L418 AbstractCegarLoop]: === Iteration 69 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:00,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:00,707 INFO L82 PathProgramCache]: Analyzing trace with hash 888790061, now seen corresponding path program 34 times [2019-08-05 11:09:00,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:00,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 11:09:00,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:01,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:01,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:09:01,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:09:01,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:09:01,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:09:01,545 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 37 states. [2019-08-05 11:09:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:02,594 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 11:09:02,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:09:02,594 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-08-05 11:09:02,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:02,595 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:09:02,595 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:09:02,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:09:02,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:09:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-08-05 11:09:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:09:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-08-05 11:09:02,597 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 36 [2019-08-05 11:09:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:02,597 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-08-05 11:09:02,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:09:02,597 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-08-05 11:09:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:09:02,598 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:02,598 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 11:09:02,598 INFO L418 AbstractCegarLoop]: === Iteration 70 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:02,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:02,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1782688166, now seen corresponding path program 34 times [2019-08-05 11:09:02,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:02,660 WARN L254 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 413 conjunts are in the unsatisfiable core [2019-08-05 11:09:02,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:03,467 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:03,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:03,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:09:03,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:09:03,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:09:03,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:09:03,468 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 37 states. [2019-08-05 11:09:04,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:04,593 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 11:09:04,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:09:04,594 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 11:09:04,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:04,595 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:09:04,595 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:09:04,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:09:04,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:09:04,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 11:09:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:09:04,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 11:09:04,597 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-08-05 11:09:04,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:04,598 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 11:09:04,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:09:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 11:09:04,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:09:04,598 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:04,599 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1] [2019-08-05 11:09:04,599 INFO L418 AbstractCegarLoop]: === Iteration 71 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:04,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:04,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1782688474, now seen corresponding path program 35 times [2019-08-05 11:09:04,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:04,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 145 conjunts are in the unsatisfiable core [2019-08-05 11:09:04,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:05,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:05,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:09:05,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:09:05,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:09:05,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:09:05,715 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 38 states. [2019-08-05 11:09:06,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:06,852 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:09:06,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:09:06,852 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-08-05 11:09:06,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:06,853 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:09:06,853 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:09:06,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:09:06,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:09:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-08-05 11:09:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:09:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-08-05 11:09:06,855 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 37 [2019-08-05 11:09:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:06,856 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-08-05 11:09:06,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:09:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-08-05 11:09:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:09:06,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:06,857 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 11:09:06,857 INFO L418 AbstractCegarLoop]: === Iteration 72 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:06,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:06,857 INFO L82 PathProgramCache]: Analyzing trace with hash -571232103, now seen corresponding path program 35 times [2019-08-05 11:09:06,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:06,923 WARN L254 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 425 conjunts are in the unsatisfiable core [2019-08-05 11:09:06,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:07,690 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:07,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:07,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:09:07,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:09:07,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:09:07,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:09:07,691 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 38 states. [2019-08-05 11:09:08,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:08,882 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 11:09:08,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:09:08,882 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 11:09:08,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:08,883 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:09:08,883 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:09:08,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:09:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:09:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 11:09:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:09:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 11:09:08,885 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-08-05 11:09:08,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:08,886 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 11:09:08,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:09:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 11:09:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:09:08,886 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:08,887 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1] [2019-08-05 11:09:08,887 INFO L418 AbstractCegarLoop]: === Iteration 73 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:08,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:08,887 INFO L82 PathProgramCache]: Analyzing trace with hash -571231795, now seen corresponding path program 36 times [2019-08-05 11:09:08,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:08,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-05 11:09:08,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:09,619 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:09,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:09,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:09:09,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:09:09,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:09:09,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:09:09,620 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 39 states. [2019-08-05 11:09:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:10,956 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 11:09:10,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:09:10,956 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-08-05 11:09:10,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:10,957 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:09:10,957 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:09:10,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:09:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:09:10,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-08-05 11:09:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:09:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-08-05 11:09:10,960 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 38 [2019-08-05 11:09:10,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:10,961 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-08-05 11:09:10,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:09:10,961 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-08-05 11:09:10,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:09:10,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:10,961 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 11:09:10,962 INFO L418 AbstractCegarLoop]: === Iteration 74 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:10,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:10,962 INFO L82 PathProgramCache]: Analyzing trace with hash -528316410, now seen corresponding path program 36 times [2019-08-05 11:09:10,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:11,033 WARN L254 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 437 conjunts are in the unsatisfiable core [2019-08-05 11:09:11,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:12,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:12,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:09:12,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:09:12,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:09:12,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:09:12,037 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 39 states. [2019-08-05 11:09:13,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:13,330 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:09:13,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:09:13,331 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 11:09:13,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:13,332 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:09:13,332 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:09:13,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:09:13,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:09:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 11:09:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:09:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 11:09:13,334 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-08-05 11:09:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:13,335 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 11:09:13,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:09:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 11:09:13,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:09:13,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:13,335 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1] [2019-08-05 11:09:13,336 INFO L418 AbstractCegarLoop]: === Iteration 75 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:13,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:13,336 INFO L82 PathProgramCache]: Analyzing trace with hash -528316102, now seen corresponding path program 37 times [2019-08-05 11:09:13,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:13,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 11:09:13,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:14,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:14,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:09:14,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:09:14,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:09:14,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:09:14,116 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 40 states. [2019-08-05 11:09:15,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:15,425 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:09:15,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:09:15,426 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2019-08-05 11:09:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:15,427 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:09:15,427 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:09:15,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:09:15,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:09:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-08-05 11:09:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:09:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-08-05 11:09:15,430 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 39 [2019-08-05 11:09:15,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:15,430 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-08-05 11:09:15,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:09:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-08-05 11:09:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:15,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:15,431 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 11:09:15,431 INFO L418 AbstractCegarLoop]: === Iteration 76 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:15,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:15,431 INFO L82 PathProgramCache]: Analyzing trace with hash 802070073, now seen corresponding path program 37 times [2019-08-05 11:09:15,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:15,500 WARN L254 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 449 conjunts are in the unsatisfiable core [2019-08-05 11:09:15,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:16,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:16,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:09:16,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:09:16,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:09:16,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:09:16,951 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 40 states. [2019-08-05 11:09:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:18,296 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 11:09:18,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:09:18,296 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 11:09:18,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:18,297 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:09:18,297 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:09:18,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:09:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:09:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 11:09:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:09:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 11:09:18,299 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-08-05 11:09:18,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:18,300 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 11:09:18,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:09:18,300 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 11:09:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:09:18,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:18,301 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1] [2019-08-05 11:09:18,301 INFO L418 AbstractCegarLoop]: === Iteration 77 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:18,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash 802070381, now seen corresponding path program 38 times [2019-08-05 11:09:18,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:18,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 157 conjunts are in the unsatisfiable core [2019-08-05 11:09:18,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:19,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:19,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:09:19,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:09:19,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:09:19,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:09:19,186 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 41 states. [2019-08-05 11:09:20,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:20,549 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 11:09:20,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:09:20,550 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-08-05 11:09:20,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:20,550 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:09:20,550 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:09:20,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:09:20,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:09:20,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-08-05 11:09:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:09:20,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-08-05 11:09:20,552 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 40 [2019-08-05 11:09:20,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:20,552 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-08-05 11:09:20,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:09:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-08-05 11:09:20,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:09:20,552 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:20,552 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 11:09:20,553 INFO L418 AbstractCegarLoop]: === Iteration 78 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:20,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:20,553 INFO L82 PathProgramCache]: Analyzing trace with hash -905621914, now seen corresponding path program 38 times [2019-08-05 11:09:20,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:20,623 WARN L254 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 461 conjunts are in the unsatisfiable core [2019-08-05 11:09:20,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:21,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:21,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:09:21,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:09:21,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:09:21,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:09:21,604 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 41 states. [2019-08-05 11:09:22,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:22,991 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:09:22,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:09:22,992 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 11:09:22,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:22,992 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:09:22,993 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:09:22,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:09:22,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:09:22,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 11:09:22,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:09:22,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 11:09:22,995 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-08-05 11:09:22,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:22,996 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 11:09:22,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:09:22,996 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 11:09:22,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:09:22,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:22,996 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1] [2019-08-05 11:09:22,997 INFO L418 AbstractCegarLoop]: === Iteration 79 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:22,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:22,997 INFO L82 PathProgramCache]: Analyzing trace with hash -905621606, now seen corresponding path program 39 times [2019-08-05 11:09:22,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:23,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 161 conjunts are in the unsatisfiable core [2019-08-05 11:09:23,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:23,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:23,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:09:23,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:09:23,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:09:23,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:09:23,869 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 42 states. [2019-08-05 11:09:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:25,210 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 11:09:25,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:09:25,210 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2019-08-05 11:09:25,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:25,211 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:09:25,211 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:09:25,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:09:25,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:09:25,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-08-05 11:09:25,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:09:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-08-05 11:09:25,213 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 41 [2019-08-05 11:09:25,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:25,214 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-08-05 11:09:25,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:09:25,214 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-08-05 11:09:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:09:25,214 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:25,214 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 11:09:25,214 INFO L418 AbstractCegarLoop]: === Iteration 80 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:25,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:25,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1990501337, now seen corresponding path program 39 times [2019-08-05 11:09:25,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:25,288 WARN L254 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 473 conjunts are in the unsatisfiable core [2019-08-05 11:09:25,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:26,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:26,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:09:26,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:09:26,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:09:26,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:09:26,409 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 42 states. [2019-08-05 11:09:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:27,864 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 11:09:27,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:09:27,864 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 11:09:27,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:27,865 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:09:27,865 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:09:27,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:09:27,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:09:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 11:09:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:09:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 11:09:27,867 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-08-05 11:09:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:27,867 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 11:09:27,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:09:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 11:09:27,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:09:27,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:27,868 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1] [2019-08-05 11:09:27,868 INFO L418 AbstractCegarLoop]: === Iteration 81 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:27,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:27,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1990501645, now seen corresponding path program 40 times [2019-08-05 11:09:27,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:27,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-05 11:09:27,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:28,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:28,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:09:28,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:09:28,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:09:28,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:09:28,734 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 43 states. [2019-08-05 11:09:30,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:30,135 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 11:09:30,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:09:30,135 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2019-08-05 11:09:30,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:30,136 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:09:30,136 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:09:30,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:09:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:09:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-08-05 11:09:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:09:30,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-08-05 11:09:30,139 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 42 [2019-08-05 11:09:30,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:30,139 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-08-05 11:09:30,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:09:30,139 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-08-05 11:09:30,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:09:30,139 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:30,139 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 11:09:30,139 INFO L418 AbstractCegarLoop]: === Iteration 82 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:30,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:30,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1576008902, now seen corresponding path program 40 times [2019-08-05 11:09:30,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:30,230 WARN L254 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 485 conjunts are in the unsatisfiable core [2019-08-05 11:09:30,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:31,577 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:31,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:31,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:09:31,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:09:31,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:09:31,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:09:31,578 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 43 states. [2019-08-05 11:09:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:33,101 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 11:09:33,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:09:33,102 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 11:09:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:33,102 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:09:33,103 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:09:33,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:09:33,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:09:33,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:09:33,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:09:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 11:09:33,105 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-08-05 11:09:33,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:33,105 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 11:09:33,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:09:33,105 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 11:09:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:09:33,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:33,106 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1] [2019-08-05 11:09:33,106 INFO L418 AbstractCegarLoop]: === Iteration 83 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:33,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:33,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1576009210, now seen corresponding path program 41 times [2019-08-05 11:09:33,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:33,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 169 conjunts are in the unsatisfiable core [2019-08-05 11:09:33,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:36,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:36,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:09:36,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:09:36,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:09:36,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:09:36,703 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 44 states. [2019-08-05 11:09:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:38,210 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:09:38,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:09:38,210 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2019-08-05 11:09:38,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:38,211 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:09:38,211 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:09:38,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:09:38,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:09:38,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-08-05 11:09:38,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:09:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-08-05 11:09:38,213 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 43 [2019-08-05 11:09:38,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:38,214 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-08-05 11:09:38,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:09:38,214 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-08-05 11:09:38,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:09:38,215 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:38,215 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 11:09:38,216 INFO L418 AbstractCegarLoop]: === Iteration 84 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:38,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:38,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1611645305, now seen corresponding path program 41 times [2019-08-05 11:09:38,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:38,309 WARN L254 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 497 conjunts are in the unsatisfiable core [2019-08-05 11:09:38,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:39,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:39,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:09:39,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:09:39,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:09:39,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:09:39,275 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 44 states. [2019-08-05 11:09:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:40,910 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 11:09:40,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:09:40,911 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 11:09:40,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:40,911 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:09:40,911 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:09:40,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:09:40,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:09:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 11:09:40,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:09:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 11:09:40,913 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-08-05 11:09:40,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:40,913 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 11:09:40,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:09:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 11:09:40,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:09:40,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:40,913 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1] [2019-08-05 11:09:40,914 INFO L418 AbstractCegarLoop]: === Iteration 85 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:40,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:40,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1611645613, now seen corresponding path program 42 times [2019-08-05 11:09:40,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:40,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 173 conjunts are in the unsatisfiable core [2019-08-05 11:09:40,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:42,140 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:42,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:42,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:09:42,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:09:42,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:09:42,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:09:42,141 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 45 states. [2019-08-05 11:09:43,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:43,683 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 11:09:43,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:09:43,683 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2019-08-05 11:09:43,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:43,684 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:09:43,684 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:09:43,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:09:43,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:09:43,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-08-05 11:09:43,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:09:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-08-05 11:09:43,687 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 44 [2019-08-05 11:09:43,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:43,687 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-08-05 11:09:43,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:09:43,688 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-08-05 11:09:43,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:09:43,688 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:43,688 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 11:09:43,689 INFO L418 AbstractCegarLoop]: === Iteration 86 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:43,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:43,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1578593498, now seen corresponding path program 42 times [2019-08-05 11:09:43,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:43,778 WARN L254 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 509 conjunts are in the unsatisfiable core [2019-08-05 11:09:43,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:44,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:44,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:09:44,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:09:44,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:09:44,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:09:44,801 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 45 states. [2019-08-05 11:09:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:46,586 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:09:46,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:09:46,586 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 11:09:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:46,587 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:09:46,587 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:09:46,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:09:46,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:09:46,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 11:09:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:09:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 11:09:46,588 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-08-05 11:09:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:46,589 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 11:09:46,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:09:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 11:09:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:09:46,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:46,590 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1] [2019-08-05 11:09:46,591 INFO L418 AbstractCegarLoop]: === Iteration 87 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:46,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:46,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1578593190, now seen corresponding path program 43 times [2019-08-05 11:09:46,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:46,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 177 conjunts are in the unsatisfiable core [2019-08-05 11:09:46,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:47,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:47,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:09:47,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:09:47,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:09:47,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:09:47,593 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 46 states. [2019-08-05 11:09:49,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:49,201 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:09:49,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:09:49,202 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2019-08-05 11:09:49,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:49,203 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:09:49,203 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:09:49,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:09:49,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:09:49,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-08-05 11:09:49,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:09:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-08-05 11:09:49,205 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 45 [2019-08-05 11:09:49,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:49,205 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-08-05 11:09:49,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:09:49,205 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-08-05 11:09:49,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:09:49,206 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:49,206 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 11:09:49,206 INFO L418 AbstractCegarLoop]: === Iteration 88 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:49,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:49,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1691748583, now seen corresponding path program 43 times [2019-08-05 11:09:49,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:49,310 WARN L254 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 521 conjunts are in the unsatisfiable core [2019-08-05 11:09:49,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:50,367 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:50,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:50,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:09:50,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:09:50,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:09:50,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:09:50,368 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 46 states. [2019-08-05 11:09:52,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:52,195 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 11:09:52,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:09:52,196 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 11:09:52,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:52,196 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:09:52,197 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:09:52,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:09:52,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:09:52,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 11:09:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:09:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 11:09:52,199 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-08-05 11:09:52,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:52,199 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 11:09:52,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:09:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 11:09:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:09:52,200 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:52,200 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1] [2019-08-05 11:09:52,200 INFO L418 AbstractCegarLoop]: === Iteration 89 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:52,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:52,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1691748275, now seen corresponding path program 44 times [2019-08-05 11:09:52,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:52,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 181 conjunts are in the unsatisfiable core [2019-08-05 11:09:52,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:53,261 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:53,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:53,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:09:53,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:09:53,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:09:53,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:09:53,262 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 47 states. [2019-08-05 11:09:54,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:54,950 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 11:09:54,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:09:54,950 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2019-08-05 11:09:54,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:54,951 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:09:54,951 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:09:54,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:09:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:09:54,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-08-05 11:09:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:09:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-08-05 11:09:54,954 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 46 [2019-08-05 11:09:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:54,954 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-08-05 11:09:54,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:09:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-08-05 11:09:54,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:54,955 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:54,955 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 11:09:54,955 INFO L418 AbstractCegarLoop]: === Iteration 90 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:54,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:54,955 INFO L82 PathProgramCache]: Analyzing trace with hash -904588922, now seen corresponding path program 44 times [2019-08-05 11:09:54,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:55,053 WARN L254 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 533 conjunts are in the unsatisfiable core [2019-08-05 11:09:55,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:56,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:56,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:09:56,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:09:56,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:09:56,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:09:56,154 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 47 states. [2019-08-05 11:09:58,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:58,051 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:09:58,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:09:58,052 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 11:09:58,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:58,052 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:09:58,053 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:09:58,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:09:58,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:09:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 11:09:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:09:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 11:09:58,055 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-08-05 11:09:58,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:58,055 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 11:09:58,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:09:58,055 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 11:09:58,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:09:58,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:58,056 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1] [2019-08-05 11:09:58,056 INFO L418 AbstractCegarLoop]: === Iteration 91 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:58,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:58,057 INFO L82 PathProgramCache]: Analyzing trace with hash -904588614, now seen corresponding path program 45 times [2019-08-05 11:09:58,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:58,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 185 conjunts are in the unsatisfiable core [2019-08-05 11:09:58,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:09:59,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:59,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:09:59,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:09:59,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:09:59,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:09:59,478 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 48 states. [2019-08-05 11:10:01,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:01,223 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 11:10:01,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:10:01,223 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2019-08-05 11:10:01,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:01,224 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:10:01,224 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:10:01,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:10:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:10:01,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-08-05 11:10:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:10:01,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-08-05 11:10:01,228 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 47 [2019-08-05 11:10:01,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:01,228 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-08-05 11:10:01,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:10:01,228 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-08-05 11:10:01,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:10:01,228 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:01,229 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 11:10:01,229 INFO L418 AbstractCegarLoop]: === Iteration 92 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:01,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:01,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2022524089, now seen corresponding path program 45 times [2019-08-05 11:10:01,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:01,355 WARN L254 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 545 conjunts are in the unsatisfiable core [2019-08-05 11:10:01,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:02,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:02,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:10:02,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:10:02,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:10:02,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:10:02,843 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 48 states. [2019-08-05 11:10:04,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:04,737 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 11:10:04,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:10:04,737 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 11:10:04,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:04,738 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:10:04,738 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:10:04,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:10:04,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:10:04,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 11:10:04,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:10:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 11:10:04,741 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-08-05 11:10:04,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:04,741 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 11:10:04,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:10:04,742 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 11:10:04,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:10:04,742 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:04,742 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1] [2019-08-05 11:10:04,742 INFO L418 AbstractCegarLoop]: === Iteration 93 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:04,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:04,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2022524397, now seen corresponding path program 46 times [2019-08-05 11:10:04,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:04,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 189 conjunts are in the unsatisfiable core [2019-08-05 11:10:04,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:05,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:05,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:05,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:10:05,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:10:05,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:10:05,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:10:05,885 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 49 states. [2019-08-05 11:10:07,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:07,843 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 11:10:07,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:10:07,843 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2019-08-05 11:10:07,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:07,844 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:10:07,844 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:10:07,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:10:07,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:10:07,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-08-05 11:10:07,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:10:07,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-08-05 11:10:07,847 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 48 [2019-08-05 11:10:07,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:07,847 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-08-05 11:10:07,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:10:07,847 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-08-05 11:10:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:10:07,848 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:07,848 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 11:10:07,848 INFO L418 AbstractCegarLoop]: === Iteration 94 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:07,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:07,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1726253082, now seen corresponding path program 46 times [2019-08-05 11:10:07,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:07,964 WARN L254 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 557 conjunts are in the unsatisfiable core [2019-08-05 11:10:07,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:09,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:09,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:10:09,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:10:09,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:10:09,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:10:09,361 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 49 states. [2019-08-05 11:10:11,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:11,334 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 11:10:11,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:10:11,335 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 11:10:11,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:11,336 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:10:11,336 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:10:11,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:10:11,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:10:11,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 11:10:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:10:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 11:10:11,339 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-08-05 11:10:11,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:11,339 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 11:10:11,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:10:11,340 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 11:10:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:10:11,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:11,340 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1] [2019-08-05 11:10:11,341 INFO L418 AbstractCegarLoop]: === Iteration 95 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:11,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:11,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1726252774, now seen corresponding path program 47 times [2019-08-05 11:10:11,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:11,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 193 conjunts are in the unsatisfiable core [2019-08-05 11:10:11,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:12,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:12,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:10:12,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:10:12,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:10:12,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:10:12,781 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 50 states. [2019-08-05 11:10:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:15,441 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:10:15,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:10:15,442 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2019-08-05 11:10:15,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:15,443 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:10:15,443 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:10:15,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:10:15,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:10:15,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-08-05 11:10:15,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:10:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-08-05 11:10:15,446 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 49 [2019-08-05 11:10:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:15,446 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-08-05 11:10:15,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:10:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-08-05 11:10:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:10:15,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:15,447 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 11:10:15,447 INFO L418 AbstractCegarLoop]: === Iteration 96 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:15,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:15,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1974228391, now seen corresponding path program 47 times [2019-08-05 11:10:15,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:15,653 WARN L254 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 569 conjunts are in the unsatisfiable core [2019-08-05 11:10:15,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:17,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:17,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:17,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:10:17,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:10:17,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:10:17,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:10:17,402 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 50 states. [2019-08-05 11:10:19,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:19,462 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 11:10:19,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:10:19,462 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 11:10:19,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:19,463 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:10:19,463 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:10:19,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:10:19,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:10:19,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 11:10:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:10:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 11:10:19,465 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-08-05 11:10:19,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:19,466 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 11:10:19,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:10:19,466 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 11:10:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:10:19,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:19,466 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1] [2019-08-05 11:10:19,466 INFO L418 AbstractCegarLoop]: === Iteration 97 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:19,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:19,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1974228083, now seen corresponding path program 48 times [2019-08-05 11:10:19,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:19,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 197 conjunts are in the unsatisfiable core [2019-08-05 11:10:19,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:20,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:20,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:10:20,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:10:20,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:10:20,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:10:20,733 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 51 states. [2019-08-05 11:10:22,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:22,872 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 11:10:22,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:10:22,873 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2019-08-05 11:10:22,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:22,873 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:10:22,874 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:10:22,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:10:22,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:10:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-08-05 11:10:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:10:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-08-05 11:10:22,876 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 50 [2019-08-05 11:10:22,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:22,877 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-08-05 11:10:22,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:10:22,877 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-08-05 11:10:22,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:10:22,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:22,878 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 11:10:22,878 INFO L418 AbstractCegarLoop]: === Iteration 98 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:22,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:22,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1071528378, now seen corresponding path program 48 times [2019-08-05 11:10:22,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:23,019 WARN L254 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 581 conjunts are in the unsatisfiable core [2019-08-05 11:10:23,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:24,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:24,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:10:24,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:10:24,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:10:24,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:10:24,330 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 51 states. [2019-08-05 11:10:26,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:26,540 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:10:26,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:10:26,541 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 11:10:26,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:26,541 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:10:26,542 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:10:26,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:10:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:10:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 11:10:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:10:26,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 11:10:26,544 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-08-05 11:10:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:26,544 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 11:10:26,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:10:26,544 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 11:10:26,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:10:26,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:26,544 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1] [2019-08-05 11:10:26,544 INFO L418 AbstractCegarLoop]: === Iteration 99 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:26,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:26,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1071528070, now seen corresponding path program 49 times [2019-08-05 11:10:26,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:26,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 201 conjunts are in the unsatisfiable core [2019-08-05 11:10:26,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:28,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:28,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:10:28,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:10:28,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:10:28,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:10:28,015 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 52 states. [2019-08-05 11:10:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:30,079 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:10:30,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:10:30,079 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-08-05 11:10:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:30,080 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:10:30,080 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:10:30,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:10:30,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:10:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-08-05 11:10:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:10:30,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-08-05 11:10:30,083 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 51 [2019-08-05 11:10:30,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:30,084 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-08-05 11:10:30,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:10:30,084 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-08-05 11:10:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:10:30,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:30,084 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 11:10:30,085 INFO L418 AbstractCegarLoop]: === Iteration 100 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:30,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:30,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1142368249, now seen corresponding path program 49 times [2019-08-05 11:10:30,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:30,228 WARN L254 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 593 conjunts are in the unsatisfiable core [2019-08-05 11:10:30,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:31,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:31,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:31,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:10:31,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:10:31,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:10:31,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:10:31,575 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 52 states. [2019-08-05 11:10:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:33,835 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 11:10:33,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:10:33,835 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 11:10:33,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:33,836 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:10:33,836 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:10:33,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:10:33,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:10:33,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 11:10:33,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:10:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 11:10:33,839 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-08-05 11:10:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:33,839 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 11:10:33,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:10:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 11:10:33,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:10:33,840 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:33,840 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1] [2019-08-05 11:10:33,840 INFO L418 AbstractCegarLoop]: === Iteration 101 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:33,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:33,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1142368557, now seen corresponding path program 50 times [2019-08-05 11:10:33,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:33,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 205 conjunts are in the unsatisfiable core [2019-08-05 11:10:33,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:35,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:35,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:35,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:10:35,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:10:35,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:10:35,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:10:35,232 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 53 states. [2019-08-05 11:10:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:37,526 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 11:10:37,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:10:37,527 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-08-05 11:10:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:37,527 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:10:37,527 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:10:37,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:10:37,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:10:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-08-05 11:10:37,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:10:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-08-05 11:10:37,529 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 52 [2019-08-05 11:10:37,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:37,530 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-08-05 11:10:37,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:10:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-08-05 11:10:37,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:10:37,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:37,531 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 11:10:37,531 INFO L418 AbstractCegarLoop]: === Iteration 102 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:37,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:37,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1053686950, now seen corresponding path program 50 times [2019-08-05 11:10:37,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:37,681 WARN L254 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 605 conjunts are in the unsatisfiable core [2019-08-05 11:10:37,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:39,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:39,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:10:39,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:10:39,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:10:39,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:10:39,082 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 53 states. [2019-08-05 11:10:41,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:41,434 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:10:41,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:10:41,435 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 11:10:41,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:41,436 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:10:41,436 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:10:41,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:10:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:10:41,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 11:10:41,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:10:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 11:10:41,438 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-08-05 11:10:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:41,439 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 11:10:41,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:10:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 11:10:41,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:10:41,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:41,440 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1] [2019-08-05 11:10:41,440 INFO L418 AbstractCegarLoop]: === Iteration 103 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:41,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:41,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1053687258, now seen corresponding path program 51 times [2019-08-05 11:10:41,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:41,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 209 conjunts are in the unsatisfiable core [2019-08-05 11:10:41,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:43,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:43,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:10:43,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:10:43,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:10:43,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:10:43,017 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 54 states. [2019-08-05 11:10:45,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:45,247 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 11:10:45,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:10:45,247 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2019-08-05 11:10:45,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:45,248 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:10:45,248 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:10:45,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:10:45,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:10:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-08-05 11:10:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:10:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-08-05 11:10:45,250 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 53 [2019-08-05 11:10:45,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:45,251 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-08-05 11:10:45,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:10:45,251 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-08-05 11:10:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:45,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:45,252 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 11:10:45,252 INFO L418 AbstractCegarLoop]: === Iteration 104 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:45,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:45,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1695433319, now seen corresponding path program 51 times [2019-08-05 11:10:45,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:45,427 WARN L254 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 617 conjunts are in the unsatisfiable core [2019-08-05 11:10:45,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:46,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:46,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:10:46,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:10:46,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:10:46,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:10:46,876 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 54 states. [2019-08-05 11:10:49,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:49,414 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 11:10:49,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:10:49,414 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 11:10:49,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:49,415 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:10:49,415 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:10:49,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:10:49,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:10:49,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 11:10:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:10:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 11:10:49,417 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-08-05 11:10:49,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:49,418 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 11:10:49,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:10:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 11:10:49,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:10:49,418 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:49,418 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1] [2019-08-05 11:10:49,419 INFO L418 AbstractCegarLoop]: === Iteration 105 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:49,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:49,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1695433011, now seen corresponding path program 52 times [2019-08-05 11:10:49,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:49,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 213 conjunts are in the unsatisfiable core [2019-08-05 11:10:49,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:50,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:50,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:10:50,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:10:50,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:10:50,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:10:50,845 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 55 states. [2019-08-05 11:10:53,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:53,294 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 11:10:53,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:10:53,295 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2019-08-05 11:10:53,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:53,295 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:10:53,295 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:10:53,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:10:53,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:10:53,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-08-05 11:10:53,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:10:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2019-08-05 11:10:53,298 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 54 [2019-08-05 11:10:53,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:53,298 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2019-08-05 11:10:53,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:10:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2019-08-05 11:10:53,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:10:53,298 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:53,298 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 11:10:53,299 INFO L418 AbstractCegarLoop]: === Iteration 106 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:53,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:53,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1018815738, now seen corresponding path program 52 times [2019-08-05 11:10:53,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:53,445 WARN L254 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 629 conjunts are in the unsatisfiable core [2019-08-05 11:10:53,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:54,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:54,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:54,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:10:54,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:10:54,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:10:54,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:10:54,979 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 55 states. [2019-08-05 11:10:57,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:10:57,481 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 11:10:57,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:10:57,481 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 11:10:57,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:10:57,482 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:10:57,482 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:10:57,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:10:57,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:10:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 11:10:57,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:10:57,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 11:10:57,485 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-08-05 11:10:57,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:10:57,485 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 11:10:57,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:10:57,485 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 11:10:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:10:57,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:10:57,486 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1] [2019-08-05 11:10:57,486 INFO L418 AbstractCegarLoop]: === Iteration 107 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:10:57,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:10:57,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1018815430, now seen corresponding path program 53 times [2019-08-05 11:10:57,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:10:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:10:57,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 217 conjunts are in the unsatisfiable core [2019-08-05 11:10:57,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:10:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:10:59,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:10:59,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:10:59,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:10:59,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:10:59,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:10:59,227 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 56 states. [2019-08-05 11:11:01,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:01,617 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:11:01,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:11:01,618 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2019-08-05 11:11:01,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:01,619 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:11:01,619 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:11:01,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:11:01,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:11:01,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-08-05 11:11:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:11:01,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-08-05 11:11:01,622 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 55 [2019-08-05 11:11:01,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:01,622 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-08-05 11:11:01,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:11:01,623 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-08-05 11:11:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:11:01,623 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:01,623 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 11:11:01,623 INFO L418 AbstractCegarLoop]: === Iteration 108 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:01,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:01,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1518507207, now seen corresponding path program 53 times [2019-08-05 11:11:01,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:01,815 WARN L254 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 641 conjunts are in the unsatisfiable core [2019-08-05 11:11:01,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:03,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:03,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:03,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:11:03,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:11:03,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:11:03,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:11:03,681 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 56 states. [2019-08-05 11:11:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:06,284 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 11:11:06,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:11:06,284 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 11:11:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:06,285 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:11:06,285 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:11:06,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:11:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:11:06,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 11:11:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:11:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 11:11:06,288 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-08-05 11:11:06,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:06,288 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 11:11:06,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:11:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 11:11:06,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:11:06,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:06,289 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1] [2019-08-05 11:11:06,289 INFO L418 AbstractCegarLoop]: === Iteration 109 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:06,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:06,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1518506899, now seen corresponding path program 54 times [2019-08-05 11:11:06,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:06,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 221 conjunts are in the unsatisfiable core [2019-08-05 11:11:06,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:07,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:07,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:11:07,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:11:07,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:11:07,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:11:07,796 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 57 states. [2019-08-05 11:11:10,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:10,374 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 11:11:10,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:11:10,375 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-08-05 11:11:10,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:10,375 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:11:10,376 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:11:10,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:11:10,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:11:10,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-08-05 11:11:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:11:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-08-05 11:11:10,378 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 56 [2019-08-05 11:11:10,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:10,378 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-08-05 11:11:10,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:11:10,378 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-08-05 11:11:10,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:11:10,379 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:10,379 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 11:11:10,379 INFO L418 AbstractCegarLoop]: === Iteration 110 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:10,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:10,379 INFO L82 PathProgramCache]: Analyzing trace with hash 170926438, now seen corresponding path program 54 times [2019-08-05 11:11:10,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:10,533 WARN L254 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 653 conjunts are in the unsatisfiable core [2019-08-05 11:11:10,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:12,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:12,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:11:12,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:11:12,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:11:12,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:11:12,117 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 57 states. [2019-08-05 11:11:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:14,905 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:11:14,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:11:14,905 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 11:11:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:14,906 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:11:14,906 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:11:14,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:11:14,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:11:14,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 11:11:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:11:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 11:11:14,907 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-08-05 11:11:14,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:14,908 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 11:11:14,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:11:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 11:11:14,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:11:14,908 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:14,908 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1] [2019-08-05 11:11:14,908 INFO L418 AbstractCegarLoop]: === Iteration 111 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:14,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:14,909 INFO L82 PathProgramCache]: Analyzing trace with hash 170926746, now seen corresponding path program 55 times [2019-08-05 11:11:14,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:14,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 225 conjunts are in the unsatisfiable core [2019-08-05 11:11:14,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:16,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:16,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:11:16,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:11:16,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:11:16,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:11:16,533 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 58 states. [2019-08-05 11:11:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:19,202 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:11:19,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:11:19,203 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2019-08-05 11:11:19,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:19,203 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:11:19,204 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:11:19,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:11:19,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:11:19,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-08-05 11:11:19,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:11:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-08-05 11:11:19,206 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 57 [2019-08-05 11:11:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:19,207 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-08-05 11:11:19,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:11:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-08-05 11:11:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:11:19,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:19,207 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 11:11:19,208 INFO L418 AbstractCegarLoop]: === Iteration 112 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:19,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:19,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1003761881, now seen corresponding path program 55 times [2019-08-05 11:11:19,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:19,380 WARN L254 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 665 conjunts are in the unsatisfiable core [2019-08-05 11:11:19,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:21,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:21,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:21,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:11:21,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:11:21,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:11:21,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:11:21,089 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 58 states. [2019-08-05 11:11:23,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:23,974 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 11:11:23,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:11:23,975 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 11:11:23,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:23,975 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:11:23,976 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:11:23,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:11:23,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:11:23,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 11:11:23,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:11:23,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 11:11:23,978 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-08-05 11:11:23,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:23,979 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 11:11:23,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:11:23,979 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 11:11:23,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:11:23,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:23,979 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1] [2019-08-05 11:11:23,979 INFO L418 AbstractCegarLoop]: === Iteration 113 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:23,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:23,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1003762189, now seen corresponding path program 56 times [2019-08-05 11:11:23,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:24,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 229 conjunts are in the unsatisfiable core [2019-08-05 11:11:24,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:25,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:25,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:11:25,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:11:25,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:11:25,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:11:25,641 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 59 states. [2019-08-05 11:11:28,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:28,288 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 11:11:28,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:11:28,289 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2019-08-05 11:11:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:28,290 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:11:28,290 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:11:28,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:11:28,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:11:28,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-08-05 11:11:28,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:11:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-08-05 11:11:28,292 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 58 [2019-08-05 11:11:28,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:28,292 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-08-05 11:11:28,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:11:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-08-05 11:11:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:11:28,293 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:28,293 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 11:11:28,293 INFO L418 AbstractCegarLoop]: === Iteration 114 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:28,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:28,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1051856838, now seen corresponding path program 56 times [2019-08-05 11:11:28,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:28,536 WARN L254 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 677 conjunts are in the unsatisfiable core [2019-08-05 11:11:28,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:30,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:30,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:11:30,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:11:30,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:11:30,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:11:30,323 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 59 states. [2019-08-05 11:11:33,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:33,222 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:11:33,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:11:33,223 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 11:11:33,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:33,223 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:11:33,223 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:11:33,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:11:33,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:11:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 11:11:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:11:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 11:11:33,228 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-08-05 11:11:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:33,228 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 11:11:33,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:11:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 11:11:33,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:11:33,228 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:33,228 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1] [2019-08-05 11:11:33,229 INFO L418 AbstractCegarLoop]: === Iteration 115 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:33,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:33,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1051857146, now seen corresponding path program 57 times [2019-08-05 11:11:33,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:33,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 233 conjunts are in the unsatisfiable core [2019-08-05 11:11:33,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:35,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:35,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:11:35,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:11:35,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:11:35,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:11:35,509 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 60 states. [2019-08-05 11:11:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:38,267 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 11:11:38,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:11:38,267 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2019-08-05 11:11:38,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:38,268 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:11:38,268 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:11:38,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:11:38,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:11:38,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-08-05 11:11:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:11:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-08-05 11:11:38,271 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 59 [2019-08-05 11:11:38,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:38,271 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-08-05 11:11:38,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:11:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-08-05 11:11:38,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:11:38,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:38,272 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 11:11:38,272 INFO L418 AbstractCegarLoop]: === Iteration 116 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:38,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:38,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1752166791, now seen corresponding path program 57 times [2019-08-05 11:11:38,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:38,470 WARN L254 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 689 conjunts are in the unsatisfiable core [2019-08-05 11:11:38,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:40,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:40,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:11:40,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:11:40,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:11:40,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:11:40,545 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 60 states. [2019-08-05 11:11:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:43,526 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 11:11:43,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:11:43,526 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 11:11:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:43,527 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:11:43,527 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:11:43,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:11:43,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:11:43,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 11:11:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:11:43,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 11:11:43,530 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-08-05 11:11:43,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:43,531 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 11:11:43,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:11:43,531 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 11:11:43,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:11:43,531 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:43,531 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1] [2019-08-05 11:11:43,532 INFO L418 AbstractCegarLoop]: === Iteration 117 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:43,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:43,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1752166483, now seen corresponding path program 58 times [2019-08-05 11:11:43,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:43,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 237 conjunts are in the unsatisfiable core [2019-08-05 11:11:43,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:45,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:45,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:45,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:11:45,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:11:45,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:11:45,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:11:45,537 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 61 states. [2019-08-05 11:11:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:48,382 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 11:11:48,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:11:48,383 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2019-08-05 11:11:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:48,383 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:11:48,384 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:11:48,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:11:48,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:11:48,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-08-05 11:11:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:11:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-08-05 11:11:48,386 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 60 [2019-08-05 11:11:48,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:48,386 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-08-05 11:11:48,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:11:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-08-05 11:11:48,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:48,387 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:48,387 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 11:11:48,388 INFO L418 AbstractCegarLoop]: === Iteration 118 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:48,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:48,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1517413926, now seen corresponding path program 58 times [2019-08-05 11:11:48,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:48,609 WARN L254 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 701 conjunts are in the unsatisfiable core [2019-08-05 11:11:48,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:50,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:50,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:11:50,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:11:50,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:11:50,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:11:50,689 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 61 states. [2019-08-05 11:11:53,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:53,778 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 11:11:53,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:11:53,779 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 11:11:53,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:53,779 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:11:53,780 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:11:53,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:11:53,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:11:53,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 11:11:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:11:53,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 11:11:53,782 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-08-05 11:11:53,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:53,783 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 11:11:53,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:11:53,783 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 11:11:53,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:11:53,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:53,784 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1] [2019-08-05 11:11:53,784 INFO L418 AbstractCegarLoop]: === Iteration 119 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:53,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:53,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1517414234, now seen corresponding path program 59 times [2019-08-05 11:11:53,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:53,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 241 conjunts are in the unsatisfiable core [2019-08-05 11:11:53,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:11:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:11:55,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:11:55,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:11:55,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:11:55,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:11:55,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:11:55,885 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 62 states. [2019-08-05 11:11:58,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:11:58,812 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 11:11:58,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:11:58,813 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2019-08-05 11:11:58,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:11:58,813 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:11:58,813 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:11:58,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:11:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:11:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-08-05 11:11:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:11:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-08-05 11:11:58,816 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 61 [2019-08-05 11:11:58,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:11:58,816 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-08-05 11:11:58,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:11:58,816 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-08-05 11:11:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:11:58,816 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:11:58,816 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 11:11:58,817 INFO L418 AbstractCegarLoop]: === Iteration 120 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:11:58,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:11:58,817 INFO L82 PathProgramCache]: Analyzing trace with hash -204798951, now seen corresponding path program 59 times [2019-08-05 11:11:58,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:11:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:11:59,038 WARN L254 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 713 conjunts are in the unsatisfiable core [2019-08-05 11:11:59,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:01,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:01,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:12:01,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:12:01,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:12:01,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:12:01,136 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 62 states. [2019-08-05 11:12:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:04,407 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 11:12:04,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:12:04,407 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 11:12:04,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:04,407 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:12:04,408 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:12:04,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:12:04,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:12:04,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 11:12:04,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:12:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 11:12:04,409 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-08-05 11:12:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:04,409 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 11:12:04,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:12:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 11:12:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:12:04,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:04,410 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1] [2019-08-05 11:12:04,410 INFO L418 AbstractCegarLoop]: === Iteration 121 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:04,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:04,411 INFO L82 PathProgramCache]: Analyzing trace with hash -204798643, now seen corresponding path program 60 times [2019-08-05 11:12:04,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:04,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 245 conjunts are in the unsatisfiable core [2019-08-05 11:12:04,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:06,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:06,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:06,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:12:06,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:12:06,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:12:06,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:12:06,271 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 63 states. [2019-08-05 11:12:09,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:09,320 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 11:12:09,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:12:09,321 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2019-08-05 11:12:09,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:09,321 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:12:09,321 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:12:09,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:12:09,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:12:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-08-05 11:12:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:12:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2019-08-05 11:12:09,323 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 62 [2019-08-05 11:12:09,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:09,324 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2019-08-05 11:12:09,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:12:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2019-08-05 11:12:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:12:09,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:09,324 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 11:12:09,325 INFO L418 AbstractCegarLoop]: === Iteration 122 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:09,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:09,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2053790586, now seen corresponding path program 60 times [2019-08-05 11:12:09,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Received shutdown request... [2019-08-05 11:12:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-08-05 11:12:09,562 INFO L285 seRefinementStrategy]: Strategy FixedRefinementStrategy was unsuccessful and could not determine trace feasibility. [2019-08-05 11:12:09,563 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:12:09,596 WARN L226 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-08-05 11:12:09,596 INFO L202 PluginConnector]: Adding new model Eiger.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:12:09 BoogieIcfgContainer [2019-08-05 11:12:09,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:12:09,599 INFO L168 Benchmark]: Toolchain (without parser) took 249496.12 ms. Allocated memory was 136.8 MB in the beginning and 289.4 MB in the end (delta: 152.6 MB). Free memory was 109.4 MB in the beginning and 218.1 MB in the end (delta: -108.7 MB). Peak memory consumption was 243.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:12:09,599 INFO L168 Benchmark]: Boogie PL CUP Parser took 1.42 ms. Allocated memory is still 136.8 MB. Free memory was 110.6 MB in the beginning and 110.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 11:12:09,600 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.90 ms. Allocated memory is still 136.8 MB. Free memory was 109.4 MB in the beginning and 107.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:12:09,600 INFO L168 Benchmark]: Boogie Preprocessor took 26.03 ms. Allocated memory is still 136.8 MB. Free memory was 106.8 MB in the beginning and 105.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:12:09,601 INFO L168 Benchmark]: RCFGBuilder took 522.32 ms. Allocated memory is still 136.8 MB. Free memory was 105.7 MB in the beginning and 91.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:12:09,601 INFO L168 Benchmark]: TraceAbstraction took 248886.46 ms. Allocated memory was 136.8 MB in the beginning and 289.4 MB in the end (delta: 152.6 MB). Free memory was 91.0 MB in the beginning and 218.1 MB in the end (delta: -127.1 MB). Peak memory consumption was 225.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:12:09,604 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 1.42 ms. Allocated memory is still 136.8 MB. Free memory was 110.6 MB in the beginning and 110.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.90 ms. Allocated memory is still 136.8 MB. Free memory was 109.4 MB in the beginning and 107.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.03 ms. Allocated memory is still 136.8 MB. Free memory was 106.8 MB in the beginning and 105.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 522.32 ms. Allocated memory is still 136.8 MB. Free memory was 105.7 MB in the beginning and 91.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248886.46 ms. Allocated memory was 136.8 MB in the beginning and 289.4 MB in the end (delta: 152.6 MB). Free memory was 91.0 MB in the beginning and 218.1 MB in the end (delta: -127.1 MB). Peak memory consumption was 225.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 30]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L21] decreases := 0; [L22] increases := 0; [L23] c := a; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L47] increases := increases + 1; [L48] res := x + 3; [L38] decreases := decreases + 1; [L39] res := x - 1; [L38] decreases := decreases + 1; [L39] res := x - 1; [L29] assert increases + increases == decreases; [L30] assert c == a + increases; - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 10 locations, 2 error locations. UNKNOWN Result, 248.8s OverallTime, 122 OverallIterations, 60 TraceHistogramMax, 138.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 304 SDtfs, 123 SDslu, 0 SDs, 0 SdLazy, 166411 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 115.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3781 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3721 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 101.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 121 MinimizatonAttempts, 122 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 103.9s InterpolantComputationTime, 3965 NumberOfCodeBlocks, 3965 NumberOfCodeBlocksAsserted, 122 NumberOfCheckSat, 3781 ConstructedInterpolants, 0 QuantifiedInterpolants, 1236703 SizeOfPredicates, 7080 NumberOfNonLiveVariables, 51609 ConjunctsInSsa, 29165 ConjunctsInUnsatCore, 121 InterpolantComputations, 2 PerfectInterpolantSequences, 0/73810 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Completed graceful shutdown