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/toy/SimultaneousDecrement.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:43:33,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:43:33,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:43:33,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:43:33,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:43:33,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:43:33,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:43:33,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:43:33,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:43:33,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:43:33,972 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:43:33,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:43:33,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:43:33,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:43:33,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:43:33,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:43:33,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:43:33,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:43:33,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:43:33,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:43:33,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:43:33,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:43:33,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:43:33,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:43:33,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:43:33,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:43:33,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:43:33,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:43:33,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:43:33,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:43:33,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:43:33,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:43:33,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:43:33,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:43:33,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:43:33,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:43:33,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:43:33,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:43:33,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:43:33,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:43:33,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:43:34,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:43:34,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:43:34,042 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:43:34,044 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:43:34,044 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:43:34,045 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/SimultaneousDecrement.bpl [2019-08-05 10:43:34,045 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/SimultaneousDecrement.bpl' [2019-08-05 10:43:34,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:43:34,083 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:43:34,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:43:34,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:43:34,084 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:43:34,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "SimultaneousDecrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... [2019-08-05 10:43:34,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "SimultaneousDecrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... [2019-08-05 10:43:34,122 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:43:34,122 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:43:34,122 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:43:34,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:43:34,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:43:34,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:43:34,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:43:34,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "SimultaneousDecrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... [2019-08-05 10:43:34,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "SimultaneousDecrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... [2019-08-05 10:43:34,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "SimultaneousDecrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... [2019-08-05 10:43:34,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "SimultaneousDecrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... [2019-08-05 10:43:34,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "SimultaneousDecrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... [2019-08-05 10:43:34,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "SimultaneousDecrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... [2019-08-05 10:43:34,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "SimultaneousDecrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... [2019-08-05 10:43:34,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:43:34,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:43:34,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:43:34,150 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:43:34,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "SimultaneousDecrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:43:34,225 INFO L124 BoogieDeclarations]: Specification and implementation of procedure SimultaneousDecrement given in one single declaration [2019-08-05 10:43:34,225 INFO L130 BoogieDeclarations]: Found specification of procedure SimultaneousDecrement [2019-08-05 10:43:34,226 INFO L138 BoogieDeclarations]: Found implementation of procedure SimultaneousDecrement [2019-08-05 10:43:34,409 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:43:34,409 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:43:34,411 INFO L202 PluginConnector]: Adding new model SimultaneousDecrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:43:34 BoogieIcfgContainer [2019-08-05 10:43:34,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:43:34,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:43:34,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:43:34,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:43:34,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SimultaneousDecrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:34" (1/2) ... [2019-08-05 10:43:34,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d0da19 and model type SimultaneousDecrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:43:34, skipping insertion in model container [2019-08-05 10:43:34,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SimultaneousDecrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:43:34" (2/2) ... [2019-08-05 10:43:34,424 INFO L109 eAbstractionObserver]: Analyzing ICFG SimultaneousDecrement.bpl [2019-08-05 10:43:34,434 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:43:34,442 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:43:34,461 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:43:34,493 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:43:34,494 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:43:34,495 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:43:34,495 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:43:34,495 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:43:34,495 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:43:34,496 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:43:34,496 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:43:34,496 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:43:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 10:43:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:43:34,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:34,524 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:43:34,527 INFO L418 AbstractCegarLoop]: === Iteration 1 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:34,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:34,533 INFO L82 PathProgramCache]: Analyzing trace with hash 929576, now seen corresponding path program 1 times [2019-08-05 10:43:34,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:34,620 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:43:34,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:34,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:43:34,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:43:34,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:43:34,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:43:34,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:43:34,872 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 5 states. [2019-08-05 10:43:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:35,094 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:43:35,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:43:35,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 10:43:35,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:35,107 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:43:35,107 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:43:35,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:35,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:43:35,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:43:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:43:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:43:35,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:43:35,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:35,143 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:43:35,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:43:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:43:35,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:43:35,144 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:35,144 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:43:35,145 INFO L418 AbstractCegarLoop]: === Iteration 2 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:35,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:35,145 INFO L82 PathProgramCache]: Analyzing trace with hash 28754370, now seen corresponding path program 1 times [2019-08-05 10:43:35,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:35,156 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:43:35,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:35,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:35,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:35,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:43:35,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:43:35,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:43:35,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:43:35,343 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-05 10:43:35,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:35,648 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:43:35,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:43:35,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 10:43:35,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:35,649 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:43:35,649 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:43:35,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:35,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:43:35,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:43:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:43:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:43:35,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:43:35,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:35,663 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:43:35,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:43:35,663 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:43:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:43:35,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:35,666 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:43:35,667 INFO L418 AbstractCegarLoop]: === Iteration 3 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:35,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:35,667 INFO L82 PathProgramCache]: Analyzing trace with hash 891322984, now seen corresponding path program 2 times [2019-08-05 10:43:35,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:35,691 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:43:35,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:35,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:35,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:43:35,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:43:35,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:43:35,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:35,833 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-05 10:43:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:36,043 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:43:36,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:43:36,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:43:36,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:36,044 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:43:36,045 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:43:36,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:36,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:43:36,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:43:36,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:43:36,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:43:36,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:43:36,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:36,049 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:43:36,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:43:36,049 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:43:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:43:36,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:36,050 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2019-08-05 10:43:36,050 INFO L418 AbstractCegarLoop]: === Iteration 4 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:36,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:36,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146242, now seen corresponding path program 3 times [2019-08-05 10:43:36,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:36,071 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:43:36,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:36,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:36,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:43:36,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:43:36,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:43:36,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:43:36,228 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-08-05 10:43:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:36,433 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:43:36,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:43:36,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:43:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:36,435 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:43:36,435 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:43:36,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:43:36,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:43:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:43:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:43:36,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:43:36,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:36,440 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:43:36,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:43:36,440 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:43:36,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:43:36,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:36,441 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2019-08-05 10:43:36,441 INFO L418 AbstractCegarLoop]: === Iteration 5 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:36,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:36,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1860896168, now seen corresponding path program 4 times [2019-08-05 10:43:36,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:36,480 WARN L254 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:43:36,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:36,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:36,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:43:36,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:43:36,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:43:36,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:43:36,753 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-08-05 10:43:36,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:36,938 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:43:36,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:43:36,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:43:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:36,941 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:43:36,941 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:43:36,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:36,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:43:36,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:43:36,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:43:36,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:43:36,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:43:36,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:36,944 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:43:36,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:43:36,945 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:43:36,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:43:36,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:36,945 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2019-08-05 10:43:36,946 INFO L418 AbstractCegarLoop]: === Iteration 6 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:36,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:36,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1853143874, now seen corresponding path program 5 times [2019-08-05 10:43:36,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:36,963 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:43:36,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:37,164 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:37,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:37,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:43:37,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:43:37,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:43:37,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:43:37,167 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-08-05 10:43:37,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:37,308 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:43:37,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:43:37,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:43:37,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:37,310 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:43:37,310 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:43:37,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:37,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:43:37,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:43:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:43:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:43:37,313 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:43:37,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:37,314 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:43:37,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:43:37,314 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:43:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:43:37,315 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:37,315 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2019-08-05 10:43:37,315 INFO L418 AbstractCegarLoop]: === Iteration 7 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:37,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:37,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1612822760, now seen corresponding path program 6 times [2019-08-05 10:43:37,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:37,336 WARN L254 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:43:37,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:37,599 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 10:43:37,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:37,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:43:37,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:43:37,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:43:37,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:43:37,601 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-08-05 10:43:37,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:37,747 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:43:37,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:43:37,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:43:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:37,749 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:43:37,749 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:43:37,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:37,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:43:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:43:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:43:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:43:37,753 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:43:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:37,753 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:43:37,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:43:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:43:37,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:43:37,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:37,754 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2019-08-05 10:43:37,754 INFO L418 AbstractCegarLoop]: === Iteration 8 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:37,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:37,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1542164478, now seen corresponding path program 7 times [2019-08-05 10:43:37,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:37,773 WARN L254 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:43:37,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:37,957 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 10:43:37,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:37,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:43:37,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:43:37,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:43:37,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:43:37,959 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-08-05 10:43:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:38,120 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:43:38,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:43:38,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:43:38,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:38,122 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:43:38,122 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:43:38,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:38,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:43:38,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:43:38,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:43:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:43:38,127 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:43:38,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:38,127 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:43:38,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:43:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:43:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:43:38,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:38,128 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2019-08-05 10:43:38,128 INFO L418 AbstractCegarLoop]: === Iteration 9 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:38,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:38,129 INFO L82 PathProgramCache]: Analyzing trace with hash -562521048, now seen corresponding path program 8 times [2019-08-05 10:43:38,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:38,146 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:43:38,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:38,407 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 10:43:38,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:38,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:43:38,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:43:38,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:43:38,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:43:38,409 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2019-08-05 10:43:38,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:38,639 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:43:38,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:43:38,640 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:43:38,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:38,640 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:43:38,641 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:43:38,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:38,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:43:38,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:43:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:43:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:43:38,644 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:43:38,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:38,644 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:43:38,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:43:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:43:38,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:43:38,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:38,645 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1] [2019-08-05 10:43:38,646 INFO L418 AbstractCegarLoop]: === Iteration 10 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:38,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:38,646 INFO L82 PathProgramCache]: Analyzing trace with hash -258345790, now seen corresponding path program 9 times [2019-08-05 10:43:38,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:38,664 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:43:38,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:38,896 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 10:43:38,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:38,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:43:38,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:43:38,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:43:38,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:43:38,898 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2019-08-05 10:43:39,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:39,106 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:43:39,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:43:39,106 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:43:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:39,107 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:43:39,108 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:43:39,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:39,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:43:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:43:39,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:43:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:43:39,111 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:43:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:39,111 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:43:39,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:43:39,112 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:43:39,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:43:39,112 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:39,112 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2019-08-05 10:43:39,112 INFO L418 AbstractCegarLoop]: === Iteration 11 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:39,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:39,113 INFO L82 PathProgramCache]: Analyzing trace with hash 581152616, now seen corresponding path program 10 times [2019-08-05 10:43:39,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:39,131 WARN L254 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:43:39,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:39,428 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 10:43:39,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:39,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:43:39,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:43:39,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:43:39,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:43:39,430 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2019-08-05 10:43:39,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:39,660 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:43:39,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:43:39,662 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:43:39,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:39,663 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:43:39,663 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:43:39,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:43:39,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:43:39,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:43:39,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:43:39,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:43:39,666 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:43:39,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:39,666 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:43:39,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:43:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:43:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:43:39,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:39,668 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1] [2019-08-05 10:43:39,668 INFO L418 AbstractCegarLoop]: === Iteration 12 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:39,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:39,669 INFO L82 PathProgramCache]: Analyzing trace with hash 835799426, now seen corresponding path program 11 times [2019-08-05 10:43:39,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:39,686 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:43:39,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:39,925 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 10:43:39,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:39,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:43:39,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:43:39,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:43:39,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:43:39,927 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2019-08-05 10:43:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:40,236 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:43:40,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:43:40,236 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:43:40,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:40,237 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:43:40,238 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:43:40,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:43:40,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:43:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:43:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:43:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:43:40,241 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:43:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:40,241 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:43:40,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:43:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:43:40,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:43:40,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:40,242 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1] [2019-08-05 10:43:40,243 INFO L418 AbstractCegarLoop]: === Iteration 13 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:40,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:40,243 INFO L82 PathProgramCache]: Analyzing trace with hash 139915944, now seen corresponding path program 12 times [2019-08-05 10:43:40,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:40,263 WARN L254 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:43:40,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:40,888 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 10:43:40,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:40,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:43:40,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:43:40,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:43:40,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:43:40,889 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2019-08-05 10:43:41,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:41,389 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:43:41,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:43:41,390 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:43:41,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:41,391 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:43:41,391 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:43:41,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:43:41,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:43:41,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:43:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:43:41,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:43:41,395 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:43:41,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:41,395 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:43:41,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:43:41,395 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:43:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:43:41,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:41,396 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1] [2019-08-05 10:43:41,396 INFO L418 AbstractCegarLoop]: === Iteration 14 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:41,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:41,397 INFO L82 PathProgramCache]: Analyzing trace with hash 42364482, now seen corresponding path program 13 times [2019-08-05 10:43:41,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:41,414 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:43:41,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:42,090 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 10:43:42,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:42,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:43:42,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:43:42,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:43:42,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:43:42,092 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2019-08-05 10:43:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:42,520 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:43:42,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:43:42,520 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:43:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:42,521 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:43:42,521 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:43:42,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:43:42,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:43:42,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:43:42,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:43:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:43:42,525 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:43:42,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:42,525 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:43:42,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:43:42,526 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:43:42,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:43:42,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:42,526 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1] [2019-08-05 10:43:42,527 INFO L418 AbstractCegarLoop]: === Iteration 15 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:42,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:42,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1313236456, now seen corresponding path program 14 times [2019-08-05 10:43:42,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:42,546 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:43:42,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:42,972 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 10:43:42,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:42,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:43:42,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:43:42,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:43:42,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:43:42,974 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2019-08-05 10:43:43,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:43,278 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:43:43,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:43:43,279 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:43:43,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:43,280 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:43:43,280 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:43:43,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:43:43,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:43:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:43:43,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:43:43,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:43:43,284 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:43:43,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:43,285 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:43:43,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:43:43,285 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:43:43,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:43:43,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:43,286 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1] [2019-08-05 10:43:43,286 INFO L418 AbstractCegarLoop]: === Iteration 16 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:43,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:43,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2055561986, now seen corresponding path program 15 times [2019-08-05 10:43:43,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:43,304 WARN L254 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:43:43,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:43,845 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 10:43:43,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:43,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:43:43,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:43:43,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:43:43,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:43:43,847 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2019-08-05 10:43:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:44,196 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:43:44,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:43:44,197 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:43:44,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:44,197 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:43:44,198 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:43:44,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:43:44,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:43:44,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:43:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:43:44,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:43:44,201 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:43:44,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:44,201 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:43:44,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:43:44,202 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:43:44,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:43:44,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:44,202 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1] [2019-08-05 10:43:44,203 INFO L418 AbstractCegarLoop]: === Iteration 17 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:44,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:44,203 INFO L82 PathProgramCache]: Analyzing trace with hash -702150360, now seen corresponding path program 16 times [2019-08-05 10:43:44,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:44,224 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:43:44,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:44,571 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 10:43:44,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:44,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:43:44,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:43:44,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:43:44,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:43:44,573 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2019-08-05 10:43:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:44,971 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:43:44,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:43:44,972 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:43:44,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:44,972 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:43:44,973 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:43:44,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:43:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:43:44,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:43:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:43:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:43:44,977 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:43:44,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:44,977 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:43:44,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:43:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:43:44,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:43:44,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:44,978 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1] [2019-08-05 10:43:44,979 INFO L418 AbstractCegarLoop]: === Iteration 18 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:44,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:44,979 INFO L82 PathProgramCache]: Analyzing trace with hash -291887166, now seen corresponding path program 17 times [2019-08-05 10:43:44,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:44,995 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:43:44,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:45,302 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 10:43:45,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:45,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:43:45,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:43:45,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:43:45,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:43:45,304 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2019-08-05 10:43:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:45,788 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:43:45,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:43:45,789 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:43:45,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:45,790 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:43:45,790 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:43:45,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:43:45,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:43:45,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:43:45,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:43:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:43:45,794 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:43:45,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:45,795 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:43:45,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:43:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:43:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:43:45,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:45,796 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1] [2019-08-05 10:43:45,796 INFO L418 AbstractCegarLoop]: === Iteration 19 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:45,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:45,796 INFO L82 PathProgramCache]: Analyzing trace with hash -458630040, now seen corresponding path program 18 times [2019-08-05 10:43:45,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:45,811 WARN L254 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:43:45,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:46,287 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 10:43:46,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:46,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:43:46,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:43:46,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:43:46,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:43:46,289 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2019-08-05 10:43:46,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:46,775 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:43:46,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:43:46,776 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:43:46,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:46,777 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:43:46,777 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:43:46,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:43:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:43:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:43:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:43:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:43:46,781 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:43:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:46,781 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:43:46,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:43:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:43:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:43:46,782 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:46,782 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1] [2019-08-05 10:43:46,783 INFO L418 AbstractCegarLoop]: === Iteration 20 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:46,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:46,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1332691838, now seen corresponding path program 19 times [2019-08-05 10:43:46,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:46,798 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:43:46,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:47,292 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 10:43:47,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:47,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:43:47,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:43:47,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:43:47,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:43:47,294 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2019-08-05 10:43:47,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:47,752 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:43:47,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:43:47,753 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:43:47,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:47,754 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:43:47,754 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:43:47,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:43:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:43:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:43:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:43:47,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:43:47,757 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:43:47,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:47,758 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:43:47,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:43:47,758 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:43:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:43:47,759 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:47,759 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1] [2019-08-05 10:43:47,759 INFO L418 AbstractCegarLoop]: === Iteration 21 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:47,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:47,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1636163496, now seen corresponding path program 20 times [2019-08-05 10:43:47,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:47,778 WARN L254 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:43:47,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:48,187 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 10:43:48,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:48,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:43:48,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:43:48,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:43:48,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:43:48,189 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2019-08-05 10:43:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:49,072 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:43:49,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:43:49,072 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:43:49,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:49,073 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:43:49,073 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:43:49,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:43:49,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:43:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:43:49,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:43:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:43:49,077 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:43:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:49,077 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:43:49,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:43:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:43:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:43:49,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:49,078 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1] [2019-08-05 10:43:49,078 INFO L418 AbstractCegarLoop]: === Iteration 22 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:49,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:49,079 INFO L82 PathProgramCache]: Analyzing trace with hash -818601662, now seen corresponding path program 21 times [2019-08-05 10:43:49,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:49,094 WARN L254 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:43:49,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:49,747 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 10:43:49,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:49,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:43:49,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:43:49,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:43:49,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:43:49,749 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2019-08-05 10:43:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:50,332 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:43:50,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:43:50,336 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:43:50,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:50,336 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:43:50,336 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:43:50,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=697, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:43:50,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:43:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:43:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:43:50,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:43:50,339 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:43:50,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:50,339 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:43:50,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:43:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:43:50,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:43:50,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:50,341 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1] [2019-08-05 10:43:50,341 INFO L418 AbstractCegarLoop]: === Iteration 23 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:50,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:50,342 INFO L82 PathProgramCache]: Analyzing trace with hash 393089768, now seen corresponding path program 22 times [2019-08-05 10:43:50,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:50,360 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:43:50,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:50,895 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 10:43:50,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:50,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:43:50,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:43:50,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:43:50,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:43:50,897 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2019-08-05 10:43:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:51,555 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:43:51,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:43:51,555 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 10:43:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:51,556 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:43:51,556 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:43:51,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=751, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:43:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:43:51,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:43:51,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:43:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:43:51,560 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:43:51,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:51,560 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:43:51,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:43:51,561 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:43:51,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:43:51,561 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:51,561 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1] [2019-08-05 10:43:51,562 INFO L418 AbstractCegarLoop]: === Iteration 24 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:51,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:51,562 INFO L82 PathProgramCache]: Analyzing trace with hash -699181566, now seen corresponding path program 23 times [2019-08-05 10:43:51,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:51,578 WARN L254 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:43:51,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:52,369 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 10:43:52,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:52,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:43:52,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:43:52,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:43:52,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:43:52,370 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2019-08-05 10:43:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:53,074 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:43:53,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:43:53,074 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-08-05 10:43:53,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:53,075 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:43:53,075 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:43:53,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=63, Invalid=807, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:43:53,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:43:53,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:43:53,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:43:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:43:53,080 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:43:53,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:53,080 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:43:53,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:43:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:43:53,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:43:53,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:53,081 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1] [2019-08-05 10:43:53,081 INFO L418 AbstractCegarLoop]: === Iteration 25 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:53,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:53,082 INFO L82 PathProgramCache]: Analyzing trace with hash -199854552, now seen corresponding path program 24 times [2019-08-05 10:43:53,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:53,097 WARN L254 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:43:53,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:54,102 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 10:43:54,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:54,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:43:54,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:43:54,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:43:54,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:43:54,104 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2019-08-05 10:43:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:54,757 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:43:54,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:43:54,758 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2019-08-05 10:43:54,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:54,758 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:43:54,758 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:43:54,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=65, Invalid=865, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:43:54,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:43:54,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:43:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:43:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:43:54,762 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:43:54,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:54,762 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:43:54,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:43:54,763 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:43:54,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:43:54,763 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:54,763 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1] [2019-08-05 10:43:54,764 INFO L418 AbstractCegarLoop]: === Iteration 26 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:54,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:54,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1900586302, now seen corresponding path program 25 times [2019-08-05 10:43:54,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:54,779 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:43:54,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:55,308 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 10:43:55,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:55,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:43:55,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:43:55,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:43:55,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:43:55,310 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2019-08-05 10:43:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:56,000 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:43:56,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:43:56,001 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-08-05 10:43:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:56,001 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:43:56,001 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:43:56,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=925, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:43:56,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:43:56,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:43:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:43:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:43:56,005 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:43:56,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:56,005 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:43:56,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:43:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:43:56,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:43:56,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:56,006 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1] [2019-08-05 10:43:56,007 INFO L418 AbstractCegarLoop]: === Iteration 27 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:56,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:56,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1211304296, now seen corresponding path program 26 times [2019-08-05 10:43:56,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:56,023 WARN L254 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:43:56,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:56,744 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 10:43:56,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:56,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:43:56,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:43:56,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:43:56,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:43:56,745 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2019-08-05 10:43:57,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:57,511 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:43:57,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:43:57,512 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-08-05 10:43:57,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:57,513 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:43:57,513 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:43:57,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=987, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:43:57,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:43:57,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:43:57,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:43:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:43:57,518 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:43:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:57,518 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:43:57,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:43:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:43:57,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:43:57,519 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:57,519 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1] [2019-08-05 10:43:57,519 INFO L418 AbstractCegarLoop]: === Iteration 28 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:57,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:57,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1104334974, now seen corresponding path program 27 times [2019-08-05 10:43:57,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:57,535 WARN L254 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:43:57,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:00,647 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 10:44:00,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:00,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:44:00,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:44:00,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:44:00,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:44:00,649 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2019-08-05 10:44:01,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:01,423 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:44:01,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:44:01,424 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-08-05 10:44:01,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:01,425 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:44:01,425 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:44:01,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=71, Invalid=1051, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:44:01,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:44:01,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:44:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:44:01,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:44:01,429 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:44:01,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:01,429 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:44:01,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:44:01,429 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:44:01,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:44:01,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:01,430 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1] [2019-08-05 10:44:01,430 INFO L418 AbstractCegarLoop]: === Iteration 29 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:01,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:01,431 INFO L82 PathProgramCache]: Analyzing trace with hash 125291688, now seen corresponding path program 28 times [2019-08-05 10:44:01,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:01,449 WARN L254 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 10:44:01,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:02,287 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 10:44:02,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:02,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:44:02,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:44:02,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:44:02,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:44:02,288 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2019-08-05 10:44:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:03,126 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:44:03,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:44:03,127 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2019-08-05 10:44:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:03,128 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:44:03,128 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:44:03,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=1117, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:44:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:44:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:44:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:44:03,132 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:44:03,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:03,132 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:44:03,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:44:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:44:03,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:44:03,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:03,133 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1] [2019-08-05 10:44:03,134 INFO L418 AbstractCegarLoop]: === Iteration 30 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:03,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:03,134 INFO L82 PathProgramCache]: Analyzing trace with hash -410987454, now seen corresponding path program 29 times [2019-08-05 10:44:03,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:03,149 WARN L254 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 10:44:03,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:04,100 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 10:44:04,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:04,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:44:04,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:44:04,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:44:04,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:44:04,102 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2019-08-05 10:44:05,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:05,056 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:44:05,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:44:05,056 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2019-08-05 10:44:05,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:05,057 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:44:05,057 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:44:05,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=1185, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:44:05,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:44:05,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:44:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:44:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:44:05,061 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:44:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:05,061 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:44:05,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:44:05,062 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:44:05,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:44:05,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:05,062 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1] [2019-08-05 10:44:05,062 INFO L418 AbstractCegarLoop]: === Iteration 31 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:05,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:05,063 INFO L82 PathProgramCache]: Analyzing trace with hash 144228328, now seen corresponding path program 30 times [2019-08-05 10:44:05,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:05,078 WARN L254 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 10:44:05,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:05,882 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 10:44:05,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:05,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:44:05,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:44:05,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:44:05,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:44:05,884 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2019-08-05 10:44:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:06,808 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:44:06,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:44:06,809 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2019-08-05 10:44:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:06,810 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:44:06,810 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:44:06,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=1255, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:44:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:44:06,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:44:06,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:44:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:44:06,814 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:44:06,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:06,814 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:44:06,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:44:06,814 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:44:06,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:44:06,815 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:06,815 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1] [2019-08-05 10:44:06,815 INFO L418 AbstractCegarLoop]: === Iteration 32 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:06,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:06,816 INFO L82 PathProgramCache]: Analyzing trace with hash 176048386, now seen corresponding path program 31 times [2019-08-05 10:44:06,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:06,833 WARN L254 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-05 10:44:06,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:07,585 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 10:44:07,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:07,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:44:07,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:44:07,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:44:07,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:44:07,586 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2019-08-05 10:44:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:08,567 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:44:08,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:44:08,568 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-08-05 10:44:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:08,568 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:44:08,569 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:44:08,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=1327, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:44:08,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:44:08,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:44:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:44:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:44:08,573 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:44:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:08,573 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:44:08,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:44:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:44:08,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:44:08,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:08,574 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1] [2019-08-05 10:44:08,574 INFO L418 AbstractCegarLoop]: === Iteration 33 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:08,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:08,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1162470184, now seen corresponding path program 32 times [2019-08-05 10:44:08,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:08,592 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 10:44:08,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:09,704 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 10:44:09,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:09,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:44:09,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:44:09,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:44:09,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:44:09,706 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2019-08-05 10:44:10,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:10,731 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:44:10,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:44:10,731 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-08-05 10:44:10,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:10,732 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:10,732 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:44:10,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=1401, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:44:10,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:44:10,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:44:10,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:44:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:44:10,735 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:44:10,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:10,736 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:44:10,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:44:10,736 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:44:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:44:10,736 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:10,736 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1] [2019-08-05 10:44:10,737 INFO L418 AbstractCegarLoop]: === Iteration 34 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:10,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:10,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1676774850, now seen corresponding path program 33 times [2019-08-05 10:44:10,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:10,754 WARN L254 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 10:44:10,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:11,670 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 10:44:11,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:11,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:44:11,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:44:11,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:44:11,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:44:11,672 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2019-08-05 10:44:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:12,775 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:44:12,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:44:12,776 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-08-05 10:44:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:12,776 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:44:12,777 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:12,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=1477, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:44:12,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:44:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:44:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:44:12,780 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:44:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:12,780 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:44:12,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:44:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:44:12,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:44:12,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:12,781 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1] [2019-08-05 10:44:12,781 INFO L418 AbstractCegarLoop]: === Iteration 35 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:12,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:12,781 INFO L82 PathProgramCache]: Analyzing trace with hash 440350312, now seen corresponding path program 34 times [2019-08-05 10:44:12,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:12,799 WARN L254 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 145 conjunts are in the unsatisfiable core [2019-08-05 10:44:12,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:14,021 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 10:44:14,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:14,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:44:14,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:44:14,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:44:14,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:44:14,023 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2019-08-05 10:44:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:15,281 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:44:15,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:44:15,282 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-08-05 10:44:15,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:15,282 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:44:15,282 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:44:15,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=85, Invalid=1555, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:44:15,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:44:15,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:44:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:44:15,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:44:15,286 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:44:15,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:15,286 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:44:15,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:44:15,286 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:44:15,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:44:15,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:15,287 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1] [2019-08-05 10:44:15,287 INFO L418 AbstractCegarLoop]: === Iteration 36 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:15,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:15,287 INFO L82 PathProgramCache]: Analyzing trace with hash 765895298, now seen corresponding path program 35 times [2019-08-05 10:44:15,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:15,307 WARN L254 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-05 10:44:15,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:16,165 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 10:44:16,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:16,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:44:16,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:44:16,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:44:16,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:44:16,166 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2019-08-05 10:44:17,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:17,394 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:44:17,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:44:17,395 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2019-08-05 10:44:17,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:17,395 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:17,396 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:44:17,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=1635, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:44:17,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:44:17,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:44:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:44:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:44:17,399 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:44:17,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:17,399 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:44:17,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:44:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:44:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:44:17,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:17,400 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1] [2019-08-05 10:44:17,400 INFO L418 AbstractCegarLoop]: === Iteration 37 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:17,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:17,400 INFO L82 PathProgramCache]: Analyzing trace with hash -2027112024, now seen corresponding path program 36 times [2019-08-05 10:44:17,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:17,420 WARN L254 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 10:44:17,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:18,342 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 10:44:18,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:18,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:44:18,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:44:18,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:44:18,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:44:18,344 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2019-08-05 10:44:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:19,773 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:44:19,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:44:19,774 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-08-05 10:44:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:19,775 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:44:19,775 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:19,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=1717, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:44:19,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:19,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:44:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:44:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:44:19,778 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:44:19,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:19,779 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:44:19,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:44:19,779 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:44:19,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:44:19,779 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:19,780 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1] [2019-08-05 10:44:19,780 INFO L418 AbstractCegarLoop]: === Iteration 38 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:19,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:19,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1583974210, now seen corresponding path program 37 times [2019-08-05 10:44:19,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:19,801 WARN L254 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 157 conjunts are in the unsatisfiable core [2019-08-05 10:44:19,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:20,761 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 10:44:20,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:20,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:44:20,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:44:20,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:44:20,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:44:20,763 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2019-08-05 10:44:22,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:22,116 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:44:22,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:44:22,117 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2019-08-05 10:44:22,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:22,118 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:44:22,118 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:44:22,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=1801, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:44:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:44:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:44:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:44:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:44:22,122 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:44:22,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:22,122 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:44:22,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:44:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:44:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:44:22,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:22,123 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1] [2019-08-05 10:44:22,123 INFO L418 AbstractCegarLoop]: === Iteration 39 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:22,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:22,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1858497768, now seen corresponding path program 38 times [2019-08-05 10:44:22,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:22,146 WARN L254 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 161 conjunts are in the unsatisfiable core [2019-08-05 10:44:22,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:23,189 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 10:44:23,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:23,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:44:23,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:44:23,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:44:23,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:44:23,190 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2019-08-05 10:44:24,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:24,703 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:44:24,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:44:24,704 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2019-08-05 10:44:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:24,705 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:24,705 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:44:24,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=1887, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:44:24,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:44:24,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:44:24,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:44:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:44:24,708 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:44:24,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:24,708 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:44:24,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:44:24,708 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:44:24,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:44:24,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:24,709 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1] [2019-08-05 10:44:24,709 INFO L418 AbstractCegarLoop]: === Iteration 40 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:24,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:24,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1778793474, now seen corresponding path program 39 times [2019-08-05 10:44:24,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:24,733 WARN L254 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-05 10:44:24,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:25,791 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 10:44:25,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:25,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:44:25,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:44:25,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:44:25,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:44:25,793 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2019-08-05 10:44:27,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:27,256 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:44:27,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:44:27,256 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2019-08-05 10:44:27,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:27,257 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:44:27,257 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:27,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=95, Invalid=1975, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:44:27,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:27,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:44:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:44:27,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:44:27,261 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:44:27,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:27,261 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:44:27,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:44:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:44:27,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:44:27,262 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:27,262 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1] [2019-08-05 10:44:27,262 INFO L418 AbstractCegarLoop]: === Iteration 41 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:27,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:27,262 INFO L82 PathProgramCache]: Analyzing trace with hash -692039640, now seen corresponding path program 40 times [2019-08-05 10:44:27,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:27,289 WARN L254 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 169 conjunts are in the unsatisfiable core [2019-08-05 10:44:27,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:28,426 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 10:44:28,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:28,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:44:28,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:44:28,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:44:28,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:44:28,427 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2019-08-05 10:44:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:30,144 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:44:30,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:44:30,150 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2019-08-05 10:44:30,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:30,151 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:44:30,151 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:44:30,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=97, Invalid=2065, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:44:30,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:44:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:44:30,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:44:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:44:30,153 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:44:30,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:30,153 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:44:30,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:44:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:44:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:44:30,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:30,154 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1] [2019-08-05 10:44:30,154 INFO L418 AbstractCegarLoop]: === Iteration 42 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:30,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:30,154 INFO L82 PathProgramCache]: Analyzing trace with hash 21545154, now seen corresponding path program 41 times [2019-08-05 10:44:30,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:30,179 WARN L254 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 173 conjunts are in the unsatisfiable core [2019-08-05 10:44:30,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:31,440 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 10:44:31,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:31,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:44:31,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:44:31,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:44:31,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:44:31,441 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2019-08-05 10:44:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:33,056 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:44:33,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:44:33,056 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2019-08-05 10:44:33,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:33,057 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:33,057 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:44:33,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=99, Invalid=2157, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:44:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:44:33,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:44:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:44:33,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:44:33,058 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:44:33,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:33,058 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:44:33,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:44:33,058 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:44:33,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:44:33,059 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:33,059 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1] [2019-08-05 10:44:33,059 INFO L418 AbstractCegarLoop]: === Iteration 43 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:33,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:33,059 INFO L82 PathProgramCache]: Analyzing trace with hash 667837288, now seen corresponding path program 42 times [2019-08-05 10:44:33,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:33,082 WARN L254 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 177 conjunts are in the unsatisfiable core [2019-08-05 10:44:33,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:34,247 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 10:44:34,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:34,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:44:34,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:44:34,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:44:34,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:44:34,249 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2019-08-05 10:44:36,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:36,105 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:44:36,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:44:36,106 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2019-08-05 10:44:36,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:36,107 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:44:36,107 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:36,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=101, Invalid=2251, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:44:36,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:36,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:44:36,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:44:36,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:44:36,110 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:44:36,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:36,110 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:44:36,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:44:36,111 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:44:36,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:44:36,111 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:36,111 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1] [2019-08-05 10:44:36,111 INFO L418 AbstractCegarLoop]: === Iteration 44 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:36,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:36,112 INFO L82 PathProgramCache]: Analyzing trace with hash -771943038, now seen corresponding path program 43 times [2019-08-05 10:44:36,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:36,130 WARN L254 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 181 conjunts are in the unsatisfiable core [2019-08-05 10:44:36,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:37,382 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 10:44:37,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:37,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:44:37,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:44:37,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:44:37,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:44:37,383 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2019-08-05 10:44:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:39,153 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:44:39,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:44:39,153 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2019-08-05 10:44:39,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:39,154 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:44:39,154 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:44:39,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=2347, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:44:39,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:44:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:44:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:44:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:44:39,157 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:44:39,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:39,157 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:44:39,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:44:39,157 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:44:39,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:44:39,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:39,158 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1] [2019-08-05 10:44:39,158 INFO L418 AbstractCegarLoop]: === Iteration 45 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:39,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:39,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1839507112, now seen corresponding path program 44 times [2019-08-05 10:44:39,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:39,185 WARN L254 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 185 conjunts are in the unsatisfiable core [2019-08-05 10:44:39,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:40,753 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 10:44:40,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:40,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:44:40,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:44:40,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:44:40,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:44:40,755 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2019-08-05 10:44:42,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:42,568 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:44:42,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:44:42,568 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2019-08-05 10:44:42,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:42,569 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:44:42,569 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:44:42,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=105, Invalid=2445, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:44:42,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:44:42,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:44:42,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:44:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:44:42,572 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:44:42,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:42,572 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:44:42,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:44:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:44:42,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:44:42,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:42,573 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1] [2019-08-05 10:44:42,574 INFO L418 AbstractCegarLoop]: === Iteration 46 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:42,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:42,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1190083138, now seen corresponding path program 45 times [2019-08-05 10:44:42,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:42,603 WARN L254 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 189 conjunts are in the unsatisfiable core [2019-08-05 10:44:42,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:44,050 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 10:44:44,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:44,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:44:44,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:44:44,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:44:44,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:44:44,052 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2019-08-05 10:44:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:46,109 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:44:46,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:44:46,110 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2019-08-05 10:44:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:46,111 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:44:46,111 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:44:46,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=107, Invalid=2545, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:44:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:44:46,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:44:46,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:44:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:44:46,114 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:44:46,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:46,114 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:44:46,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:44:46,115 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:44:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:44:46,115 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:46,115 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1] [2019-08-05 10:44:46,116 INFO L418 AbstractCegarLoop]: === Iteration 47 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:46,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:46,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1762190872, now seen corresponding path program 46 times [2019-08-05 10:44:46,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:46,145 WARN L254 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 193 conjunts are in the unsatisfiable core [2019-08-05 10:44:46,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:47,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:47,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:44:47,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:44:47,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:44:47,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:44:47,645 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2019-08-05 10:44:49,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:49,604 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:44:49,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:44:49,605 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2019-08-05 10:44:49,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:49,605 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:44:49,606 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:44:49,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=109, Invalid=2647, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:44:49,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:44:49,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:44:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:44:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:44:49,609 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:44:49,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:49,610 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:44:49,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:44:49,610 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:44:49,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:44:49,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:49,610 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1] [2019-08-05 10:44:49,611 INFO L418 AbstractCegarLoop]: === Iteration 48 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:49,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:49,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1206595330, now seen corresponding path program 47 times [2019-08-05 10:44:49,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:49,631 WARN L254 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 197 conjunts are in the unsatisfiable core [2019-08-05 10:44:49,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:51,325 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 10:44:51,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:51,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:44:51,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:44:51,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:44:51,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:44:51,327 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2019-08-05 10:44:53,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:53,403 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:44:53,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:44:53,403 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-08-05 10:44:53,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:53,404 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:44:53,404 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:44:53,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=111, Invalid=2751, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:44:53,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:44:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:44:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:44:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:44:53,408 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:44:53,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:53,408 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:44:53,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:44:53,408 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:44:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:44:53,409 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:53,409 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1] [2019-08-05 10:44:53,409 INFO L418 AbstractCegarLoop]: === Iteration 49 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:53,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:53,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1250312920, now seen corresponding path program 48 times [2019-08-05 10:44:53,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:53,434 WARN L254 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 201 conjunts are in the unsatisfiable core [2019-08-05 10:44:53,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:55,294 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 10:44:55,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:55,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:44:55,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:44:55,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:44:55,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:44:55,296 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2019-08-05 10:44:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:57,540 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:44:57,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:44:57,541 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-08-05 10:44:57,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:57,541 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:44:57,541 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:44:57,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=113, Invalid=2857, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:44:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:44:57,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:44:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:44:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:44:57,544 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:44:57,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:57,545 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:44:57,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:44:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:44:57,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:44:57,546 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:57,546 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1] [2019-08-05 10:44:57,546 INFO L418 AbstractCegarLoop]: === Iteration 50 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:57,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:57,546 INFO L82 PathProgramCache]: Analyzing trace with hash -105057342, now seen corresponding path program 49 times [2019-08-05 10:44:57,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:57,578 WARN L254 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 205 conjunts are in the unsatisfiable core [2019-08-05 10:44:57,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:59,230 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 10:44:59,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:59,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:44:59,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:44:59,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:44:59,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:44:59,231 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2019-08-05 10:45:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:01,678 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:45:01,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:45:01,679 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2019-08-05 10:45:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:01,679 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:45:01,680 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:45:01,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=115, Invalid=2965, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:45:01,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:45:01,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:45:01,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:45:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:45:01,683 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:45:01,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:01,683 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:45:01,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:45:01,683 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:45:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:45:01,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:01,684 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1] [2019-08-05 10:45:01,684 INFO L418 AbstractCegarLoop]: === Iteration 51 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:01,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:01,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1038127208, now seen corresponding path program 50 times [2019-08-05 10:45:01,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:01,719 WARN L254 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 209 conjunts are in the unsatisfiable core [2019-08-05 10:45:01,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:03,320 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 10:45:03,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:03,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:45:03,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:45:03,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:45:03,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:45:03,322 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2019-08-05 10:45:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:05,883 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:45:05,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:45:05,883 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2019-08-05 10:45:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:05,885 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:05,885 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:45:05,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=117, Invalid=3075, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:45:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:45:05,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:45:05,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:45:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:45:05,888 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:45:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:05,888 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:45:05,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:45:05,888 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:45:05,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:45:05,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:05,888 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1] [2019-08-05 10:45:05,889 INFO L418 AbstractCegarLoop]: === Iteration 52 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:05,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:05,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2117109890, now seen corresponding path program 51 times [2019-08-05 10:45:05,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:05,925 WARN L254 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 213 conjunts are in the unsatisfiable core [2019-08-05 10:45:05,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:07,728 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 10:45:07,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:07,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:45:07,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:45:07,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:45:07,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:45:07,730 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2019-08-05 10:45:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:10,130 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:45:10,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:45:10,130 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2019-08-05 10:45:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:10,131 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:45:10,131 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:10,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=119, Invalid=3187, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:45:10,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:10,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:45:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:45:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:45:10,134 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:45:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:10,134 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:45:10,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:45:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:45:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:45:10,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:10,135 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1] [2019-08-05 10:45:10,135 INFO L418 AbstractCegarLoop]: === Iteration 53 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:10,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:10,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1205834664, now seen corresponding path program 52 times [2019-08-05 10:45:10,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:10,164 WARN L254 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 217 conjunts are in the unsatisfiable core [2019-08-05 10:45:10,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:12,185 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 10:45:12,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:12,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:45:12,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:45:12,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:45:12,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:45:12,187 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2019-08-05 10:45:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:14,692 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:45:14,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:45:14,692 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-08-05 10:45:14,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:14,693 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:45:14,694 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:45:14,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=121, Invalid=3301, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:45:14,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:45:14,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:45:14,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:45:14,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:45:14,696 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:45:14,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:14,696 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:45:14,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:45:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:45:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:45:14,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:14,697 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1, 1] [2019-08-05 10:45:14,697 INFO L418 AbstractCegarLoop]: === Iteration 54 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:14,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:14,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1273893566, now seen corresponding path program 53 times [2019-08-05 10:45:14,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:14,734 WARN L254 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 221 conjunts are in the unsatisfiable core [2019-08-05 10:45:14,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:16,805 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 10:45:16,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:16,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:45:16,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:45:16,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:45:16,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:45:16,806 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2019-08-05 10:45:19,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:19,385 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:45:19,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:45:19,386 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2019-08-05 10:45:19,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:19,386 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:19,387 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:45:19,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=123, Invalid=3417, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:45:19,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:45:19,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:45:19,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:45:19,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:45:19,389 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:45:19,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:19,390 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:45:19,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:45:19,390 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:45:19,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:45:19,390 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:19,390 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1, 1] [2019-08-05 10:45:19,390 INFO L418 AbstractCegarLoop]: === Iteration 55 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:19,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:19,391 INFO L82 PathProgramCache]: Analyzing trace with hash -836057368, now seen corresponding path program 54 times [2019-08-05 10:45:19,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:19,423 WARN L254 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 225 conjunts are in the unsatisfiable core [2019-08-05 10:45:19,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:21,551 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 10:45:21,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:21,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:45:21,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:45:21,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:45:21,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:45:21,552 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2019-08-05 10:45:24,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:24,206 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:45:24,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:45:24,206 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2019-08-05 10:45:24,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:24,207 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:45:24,207 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:24,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=125, Invalid=3535, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:45:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:24,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:45:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:45:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:45:24,210 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:45:24,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:24,210 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:45:24,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:45:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:45:24,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:45:24,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:24,211 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1, 1] [2019-08-05 10:45:24,212 INFO L418 AbstractCegarLoop]: === Iteration 56 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:24,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:24,212 INFO L82 PathProgramCache]: Analyzing trace with hash -148037118, now seen corresponding path program 55 times [2019-08-05 10:45:24,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:24,245 WARN L254 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 229 conjunts are in the unsatisfiable core [2019-08-05 10:45:24,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:26,288 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 10:45:26,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:26,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:45:26,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:45:26,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:45:26,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:45:26,289 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2019-08-05 10:45:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:29,048 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:45:29,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:45:29,049 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2019-08-05 10:45:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:29,049 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:45:29,049 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:45:29,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=127, Invalid=3655, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:45:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:45:29,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:45:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:45:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:45:29,052 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:45:29,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:29,053 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:45:29,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:45:29,053 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:45:29,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:45:29,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:29,054 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1, 1] [2019-08-05 10:45:29,054 INFO L418 AbstractCegarLoop]: === Iteration 57 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:29,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:29,054 INFO L82 PathProgramCache]: Analyzing trace with hash -294245848, now seen corresponding path program 56 times [2019-08-05 10:45:29,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:29,096 WARN L254 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 233 conjunts are in the unsatisfiable core [2019-08-05 10:45:29,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:31,375 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 10:45:31,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:31,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:45:31,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:45:31,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:45:31,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:45:31,376 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2019-08-05 10:45:34,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:34,231 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:45:34,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:45:34,232 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2019-08-05 10:45:34,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:34,233 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:45:34,233 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:45:34,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=129, Invalid=3777, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:45:34,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:45:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:45:34,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:45:34,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:45:34,236 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:45:34,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:34,236 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:45:34,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:45:34,237 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:45:34,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:45:34,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:34,237 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1, 1] [2019-08-05 10:45:34,237 INFO L418 AbstractCegarLoop]: === Iteration 58 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:34,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:34,238 INFO L82 PathProgramCache]: Analyzing trace with hash -531749182, now seen corresponding path program 57 times [2019-08-05 10:45:34,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:34,285 WARN L254 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 237 conjunts are in the unsatisfiable core [2019-08-05 10:45:34,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:36,593 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 10:45:36,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:36,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:45:36,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:45:36,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:45:36,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:45:36,594 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2019-08-05 10:45:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:39,530 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:45:39,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:45:39,531 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2019-08-05 10:45:39,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:39,531 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:45:39,532 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:45:39,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=131, Invalid=3901, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:45:39,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:45:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:45:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:45:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:45:39,534 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:45:39,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:39,535 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:45:39,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:45:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:45:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:45:39,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:39,536 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1, 1] [2019-08-05 10:45:39,536 INFO L418 AbstractCegarLoop]: === Iteration 59 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:39,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:39,536 INFO L82 PathProgramCache]: Analyzing trace with hash 695582056, now seen corresponding path program 58 times [2019-08-05 10:45:39,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:39,576 WARN L254 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 241 conjunts are in the unsatisfiable core [2019-08-05 10:45:39,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:42,089 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 10:45:42,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:42,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:45:42,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:45:42,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:45:42,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:45:42,090 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2019-08-05 10:45:45,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:45,125 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:45:45,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:45:45,125 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2019-08-05 10:45:45,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:45,126 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:45:45,126 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:45:45,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=133, Invalid=4027, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:45:45,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:45:45,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:45:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:45:45,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:45:45,129 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:45:45,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:45,129 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:45:45,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:45:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:45:45,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:45:45,129 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:45,130 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1, 1] [2019-08-05 10:45:45,130 INFO L418 AbstractCegarLoop]: === Iteration 60 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:45,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:45,130 INFO L82 PathProgramCache]: Analyzing trace with hash 88144770, now seen corresponding path program 59 times [2019-08-05 10:45:45,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:45,162 WARN L254 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 245 conjunts are in the unsatisfiable core [2019-08-05 10:45:45,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:47,644 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 10:45:47,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:47,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:45:47,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:45:47,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:45:47,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:45:47,646 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2019-08-05 10:45:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:50,768 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:45:50,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:45:50,769 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2019-08-05 10:45:50,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:50,770 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:45:50,770 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:45:50,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=135, Invalid=4155, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:45:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:45:50,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:45:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:45:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:45:50,772 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:45:50,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:50,773 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:45:50,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:45:50,773 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:45:50,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:45:50,773 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:50,773 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1, 1] [2019-08-05 10:45:50,774 INFO L418 AbstractCegarLoop]: === Iteration 61 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:50,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:50,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1562541912, now seen corresponding path program 60 times [2019-08-05 10:45:50,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:50,830 WARN L254 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 249 conjunts are in the unsatisfiable core [2019-08-05 10:45:50,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:54,152 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 10:45:54,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:54,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:45:54,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:45:54,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:45:54,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:45:54,153 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2019-08-05 10:45:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:57,545 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:45:57,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:45:57,546 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2019-08-05 10:45:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:57,547 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:45:57,547 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:45:57,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=137, Invalid=4285, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:45:57,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:45:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:45:57,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:45:57,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:45:57,550 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:45:57,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:57,550 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:45:57,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:45:57,551 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:45:57,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:45:57,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:57,551 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1, 1] [2019-08-05 10:45:57,551 INFO L418 AbstractCegarLoop]: === Iteration 62 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:57,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:57,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1194221502, now seen corresponding path program 61 times [2019-08-05 10:45:57,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:57,593 WARN L254 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 253 conjunts are in the unsatisfiable core [2019-08-05 10:45:57,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:59,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:59,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:45:59,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:45:59,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:45:59,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:45:59,829 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2019-08-05 10:46:03,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:03,235 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:46:03,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:46:03,236 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2019-08-05 10:46:03,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:03,236 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:46:03,236 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:46:03,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=139, Invalid=4417, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:46:03,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:46:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:46:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:46:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:46:03,239 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:46:03,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:03,239 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:46:03,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:46:03,240 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:46:03,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:46:03,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:03,240 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1, 1] [2019-08-05 10:46:03,240 INFO L418 AbstractCegarLoop]: === Iteration 63 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:03,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:03,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1633776616, now seen corresponding path program 62 times [2019-08-05 10:46:03,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:03,274 WARN L254 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 257 conjunts are in the unsatisfiable core [2019-08-05 10:46:03,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:05,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:05,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:46:05,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:46:05,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:46:05,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:46:05,617 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2019-08-05 10:46:09,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:09,170 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:46:09,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:46:09,170 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2019-08-05 10:46:09,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:09,171 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:46:09,171 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:46:09,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=141, Invalid=4551, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:46:09,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:46:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:46:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:46:09,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:46:09,174 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:46:09,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:09,174 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:46:09,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:46:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:46:09,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:46:09,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:09,175 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1, 1] [2019-08-05 10:46:09,175 INFO L418 AbstractCegarLoop]: === Iteration 64 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:09,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:09,176 INFO L82 PathProgramCache]: Analyzing trace with hash -892594942, now seen corresponding path program 63 times [2019-08-05 10:46:09,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:09,217 WARN L254 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 261 conjunts are in the unsatisfiable core [2019-08-05 10:46:09,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:11,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:11,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:46:11,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:46:11,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:46:11,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:46:11,569 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2019-08-05 10:46:15,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:15,275 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:46:15,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:46:15,276 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2019-08-05 10:46:15,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:15,277 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:46:15,277 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:46:15,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=143, Invalid=4687, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:46:15,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:46:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:46:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:46:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:46:15,280 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:46:15,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:15,280 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:46:15,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:46:15,280 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:46:15,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:46:15,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:15,281 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1, 1] [2019-08-05 10:46:15,281 INFO L418 AbstractCegarLoop]: === Iteration 65 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:15,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:15,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1900701912, now seen corresponding path program 64 times [2019-08-05 10:46:15,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:15,335 WARN L254 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 265 conjunts are in the unsatisfiable core [2019-08-05 10:46:15,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:18,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:18,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:46:18,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:46:18,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:46:18,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:46:18,032 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2019-08-05 10:46:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:21,678 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:46:21,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:46:21,679 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2019-08-05 10:46:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:21,680 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:46:21,680 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:46:21,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=145, Invalid=4825, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:46:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:46:21,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:46:21,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:46:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:46:21,683 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:46:21,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:21,683 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:46:21,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:46:21,683 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:46:21,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:46:21,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:21,684 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1, 1] [2019-08-05 10:46:21,684 INFO L418 AbstractCegarLoop]: === Iteration 66 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:21,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:21,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1207720386, now seen corresponding path program 65 times [2019-08-05 10:46:21,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:21,720 WARN L254 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 269 conjunts are in the unsatisfiable core [2019-08-05 10:46:21,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:24,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:24,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:46:24,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:46:24,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:46:24,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:46:24,484 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2019-08-05 10:46:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:28,354 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:46:28,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:46:28,355 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2019-08-05 10:46:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:28,355 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:46:28,356 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:46:28,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=147, Invalid=4965, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:46:28,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:46:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:46:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:46:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:46:28,358 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:46:28,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:28,359 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:46:28,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:46:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:46:28,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:46:28,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:28,360 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1, 1] [2019-08-05 10:46:28,360 INFO L418 AbstractCegarLoop]: === Iteration 67 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:28,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:28,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1215436184, now seen corresponding path program 66 times [2019-08-05 10:46:28,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:28,398 WARN L254 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 273 conjunts are in the unsatisfiable core [2019-08-05 10:46:28,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:31,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:31,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:31,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:46:31,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:46:31,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:46:31,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:46:31,150 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2019-08-05 10:46:35,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:35,154 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:46:35,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:46:35,155 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2019-08-05 10:46:35,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:35,156 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:46:35,156 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:46:35,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=149, Invalid=5107, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:46:35,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:46:35,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:46:35,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:46:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:46:35,159 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:46:35,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:35,159 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:46:35,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:46:35,159 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:46:35,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:46:35,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:35,160 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1, 1] [2019-08-05 10:46:35,160 INFO L418 AbstractCegarLoop]: === Iteration 68 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:35,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:35,160 INFO L82 PathProgramCache]: Analyzing trace with hash 976121474, now seen corresponding path program 67 times [2019-08-05 10:46:35,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:35,198 WARN L254 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 277 conjunts are in the unsatisfiable core [2019-08-05 10:46:35,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:38,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:38,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:46:38,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:46:38,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:46:38,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:46:38,193 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2019-08-05 10:46:42,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:42,210 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:46:42,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:46:42,211 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2019-08-05 10:46:42,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:42,212 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:46:42,212 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:46:42,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=151, Invalid=5251, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:46:42,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:46:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:46:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:46:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:46:42,215 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:46:42,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:42,215 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:46:42,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:46:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:46:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:46:42,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:42,216 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1, 1] [2019-08-05 10:46:42,216 INFO L418 AbstractCegarLoop]: === Iteration 69 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:42,216 INFO L82 PathProgramCache]: Analyzing trace with hash 194932136, now seen corresponding path program 68 times [2019-08-05 10:46:42,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:42,292 WARN L254 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 281 conjunts are in the unsatisfiable core [2019-08-05 10:46:42,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:47,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:47,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:46:47,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:46:47,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:46:47,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:46:47,036 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2019-08-05 10:46:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:51,275 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:46:51,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:46:51,276 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2019-08-05 10:46:51,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:51,277 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:46:51,277 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:46:51,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=153, Invalid=5397, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:46:51,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:46:51,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:46:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:46:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:46:51,281 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:46:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:51,281 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:46:51,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:46:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:46:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:46:51,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:51,282 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1, 1] [2019-08-05 10:46:51,282 INFO L418 AbstractCegarLoop]: === Iteration 70 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:51,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:51,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1747866434, now seen corresponding path program 69 times [2019-08-05 10:46:51,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:51,358 WARN L254 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 285 conjunts are in the unsatisfiable core [2019-08-05 10:46:51,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:54,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:54,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:46:54,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:46:54,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:46:54,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:46:54,596 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2019-08-05 10:46:58,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:58,932 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:46:58,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:46:58,932 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2019-08-05 10:46:58,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:58,933 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:46:58,933 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:46:58,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=155, Invalid=5545, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:46:58,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:46:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:46:58,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:46:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:46:58,936 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:46:58,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:58,937 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:46:58,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:46:58,937 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:46:58,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:46:58,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:58,938 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1, 1] [2019-08-05 10:46:58,938 INFO L418 AbstractCegarLoop]: === Iteration 71 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:58,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:58,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1650777880, now seen corresponding path program 70 times [2019-08-05 10:46:58,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:59,009 WARN L254 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 289 conjunts are in the unsatisfiable core [2019-08-05 10:46:59,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:02,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:02,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:47:02,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:47:02,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:47:02,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:47:02,162 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2019-08-05 10:47:06,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:06,589 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:47:06,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:47:06,590 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2019-08-05 10:47:06,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:06,591 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:47:06,591 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:47:06,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=157, Invalid=5695, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:47:06,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:47:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:47:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:47:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:47:06,594 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:47:06,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:06,595 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:47:06,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:47:06,595 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:47:06,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:47:06,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:06,596 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1, 1] [2019-08-05 10:47:06,596 INFO L418 AbstractCegarLoop]: === Iteration 72 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:06,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:06,596 INFO L82 PathProgramCache]: Analyzing trace with hash 365430786, now seen corresponding path program 71 times [2019-08-05 10:47:06,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:06,667 WARN L254 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 293 conjunts are in the unsatisfiable core [2019-08-05 10:47:06,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:09,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:09,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:47:09,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:47:09,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:47:09,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:47:09,784 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2019-08-05 10:47:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:14,369 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:47:14,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:47:14,370 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2019-08-05 10:47:14,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:14,371 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:47:14,371 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:47:14,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=159, Invalid=5847, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:47:14,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:47:14,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:47:14,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:47:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:47:14,374 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:47:14,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:14,375 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:47:14,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:47:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:47:14,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:47:14,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:14,376 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1, 1] [2019-08-05 10:47:14,376 INFO L418 AbstractCegarLoop]: === Iteration 73 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:14,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:14,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1556610008, now seen corresponding path program 72 times [2019-08-05 10:47:14,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:14,440 WARN L254 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 297 conjunts are in the unsatisfiable core [2019-08-05 10:47:14,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:18,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:18,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:18,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:47:18,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:47:18,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:47:18,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:47:18,870 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2019-08-05 10:47:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:23,415 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:47:23,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:47:23,415 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2019-08-05 10:47:23,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:23,416 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:47:23,416 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:47:23,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=161, Invalid=6001, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:47:23,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:47:23,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:47:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:47:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:47:23,419 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:47:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:23,419 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:47:23,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:47:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:47:23,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:47:23,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:23,420 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1, 1] [2019-08-05 10:47:23,420 INFO L418 AbstractCegarLoop]: === Iteration 74 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:23,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:23,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1010332478, now seen corresponding path program 73 times [2019-08-05 10:47:23,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:23,468 WARN L254 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 301 conjunts are in the unsatisfiable core [2019-08-05 10:47:23,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:27,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:27,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:47:27,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:47:27,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:47:27,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:47:27,095 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2019-08-05 10:47:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:31,969 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:47:31,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:47:31,970 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2019-08-05 10:47:31,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:31,970 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:47:31,971 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:47:31,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=163, Invalid=6157, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:47:31,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:47:31,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:47:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:47:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:47:31,974 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:47:31,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:31,974 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:47:31,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:47:31,974 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:47:31,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:47:31,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:31,974 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1, 1] [2019-08-05 10:47:31,975 INFO L418 AbstractCegarLoop]: === Iteration 75 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:31,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:31,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1255598232, now seen corresponding path program 74 times [2019-08-05 10:47:31,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:32,028 WARN L254 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 305 conjunts are in the unsatisfiable core [2019-08-05 10:47:32,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:37,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:37,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:37,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:47:37,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:47:37,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:47:37,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:47:37,754 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2019-08-05 10:47:42,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:42,732 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:47:42,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:47:42,733 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2019-08-05 10:47:42,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:42,734 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:47:42,734 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:47:42,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=165, Invalid=6315, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:47:42,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:47:42,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:47:42,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:47:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:47:42,737 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:47:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:42,737 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:47:42,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:47:42,737 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:47:42,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:47:42,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:42,738 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1, 1] [2019-08-05 10:47:42,738 INFO L418 AbstractCegarLoop]: === Iteration 76 === [SimultaneousDecrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:42,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:42,738 INFO L82 PathProgramCache]: Analyzing trace with hash -268902014, now seen corresponding path program 75 times [2019-08-05 10:47:42,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:42,792 WARN L254 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 309 conjunts are in the unsatisfiable core [2019-08-05 10:47:42,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:47:44,158 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:47:44,159 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:47:44,162 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:47:44,163 INFO L202 PluginConnector]: Adding new model SimultaneousDecrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:47:44 BoogieIcfgContainer [2019-08-05 10:47:44,163 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:47:44,165 INFO L168 Benchmark]: Toolchain (without parser) took 250082.16 ms. Allocated memory was 134.7 MB in the beginning and 190.8 MB in the end (delta: 56.1 MB). Free memory was 112.3 MB in the beginning and 109.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 59.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:44,166 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 134.7 MB. Free memory was 113.4 MB in the beginning and 113.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:47:44,166 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.65 ms. Allocated memory is still 134.7 MB. Free memory was 112.1 MB in the beginning and 110.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:44,167 INFO L168 Benchmark]: Boogie Preprocessor took 24.47 ms. Allocated memory is still 134.7 MB. Free memory was 110.3 MB in the beginning and 109.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:44,168 INFO L168 Benchmark]: RCFGBuilder took 261.04 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 100.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:44,168 INFO L168 Benchmark]: TraceAbstraction took 249747.80 ms. Allocated memory was 134.7 MB in the beginning and 190.8 MB in the end (delta: 56.1 MB). Free memory was 100.0 MB in the beginning and 109.0 MB in the end (delta: -8.9 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:47:44,172 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 134.7 MB. Free memory was 113.4 MB in the beginning and 113.2 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 40.65 ms. Allocated memory is still 134.7 MB. Free memory was 112.1 MB in the beginning and 110.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.47 ms. Allocated memory is still 134.7 MB. Free memory was 110.3 MB in the beginning and 109.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 261.04 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 100.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 249747.80 ms. Allocated memory was 134.7 MB in the beginning and 190.8 MB in the end (delta: 56.1 MB). Free memory was 100.0 MB in the beginning and 109.0 MB in the end (delta: -8.9 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 25]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 25). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 75,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 249.6s OverallTime, 76 OverallIterations, 75 TraceHistogramMax, 134.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 152 SDtfs, 234 SDslu, 155 SDs, 0 SdLazy, 161157 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 109.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3150 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 113.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 75 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 111.3s InterpolantComputationTime, 3075 NumberOfCodeBlocks, 3075 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 3000 ConstructedInterpolants, 0 QuantifiedInterpolants, 1664644 SizeOfPredicates, 225 NumberOfNonLiveVariables, 14700 ConjunctsInSsa, 11775 ConjunctsInUnsatCore, 75 InterpolantComputations, 1 PerfectInterpolantSequences, 0/70300 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown