java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/random/RanFile094.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:03:06,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:03:06,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:03:06,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:03:06,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:03:06,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:03:06,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:03:06,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:03:06,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:03:06,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:03:06,157 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:03:06,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:03:06,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:03:06,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:03:06,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:03:06,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:03:06,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:03:06,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:03:06,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:03:06,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:03:06,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:03:06,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:03:06,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:03:06,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:03:06,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:03:06,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:03:06,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:03:06,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:03:06,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:03:06,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:03:06,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:03:06,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:03:06,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:03:06,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:03:06,184 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:03:06,184 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:03:06,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:03:06,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:03:06,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:03:06,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:03:06,187 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:03:06,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:03:06,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:03:06,231 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:03:06,233 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:03:06,233 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:03:06,234 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile094.bpl [2019-08-05 10:03:06,234 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/random/RanFile094.bpl' [2019-08-05 10:03:06,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:03:06,294 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:03:06,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:03:06,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:03:06,295 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:03:06,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "RanFile094.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... [2019-08-05 10:03:06,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "RanFile094.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... [2019-08-05 10:03:06,331 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:03:06,331 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:03:06,331 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:03:06,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:03:06,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:03:06,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:03:06,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:03:06,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "RanFile094.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... [2019-08-05 10:03:06,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "RanFile094.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... [2019-08-05 10:03:06,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "RanFile094.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... [2019-08-05 10:03:06,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "RanFile094.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... [2019-08-05 10:03:06,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "RanFile094.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... [2019-08-05 10:03:06,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "RanFile094.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... [2019-08-05 10:03:06,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "RanFile094.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... [2019-08-05 10:03:06,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:03:06,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:03:06,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:03:06,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:03:06,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "RanFile094.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:03:06,497 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:03:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:03:06,498 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:03:08,754 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:03:08,754 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:03:08,755 INFO L202 PluginConnector]: Adding new model RanFile094.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:03:08 BoogieIcfgContainer [2019-08-05 10:03:08,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:03:08,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:03:08,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:03:08,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:03:08,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile094.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:03:06" (1/2) ... [2019-08-05 10:03:08,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181da050 and model type RanFile094.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:03:08, skipping insertion in model container [2019-08-05 10:03:08,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "RanFile094.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:03:08" (2/2) ... [2019-08-05 10:03:08,763 INFO L109 eAbstractionObserver]: Analyzing ICFG RanFile094.bpl [2019-08-05 10:03:08,773 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:03:08,782 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 10:03:08,798 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 10:03:08,820 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:03:08,821 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:03:08,821 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:03:08,821 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:03:08,821 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:03:08,821 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:03:08,822 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:03:08,822 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:03:08,822 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:03:08,836 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-08-05 10:03:08,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:03:08,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:08,848 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:08,851 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:08,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:08,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1244622753, now seen corresponding path program 1 times [2019-08-05 10:03:08,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:08,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:03:08,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:09,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:09,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:09,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:09,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:03:09,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:03:09,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:03:09,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:03:09,311 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 5 states. [2019-08-05 10:03:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:10,433 INFO L93 Difference]: Finished difference Result 74 states and 124 transitions. [2019-08-05 10:03:10,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:03:10,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-08-05 10:03:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:10,449 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:03:10,449 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:03:10,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:03:10,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:03:10,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2019-08-05 10:03:10,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:03:10,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2019-08-05 10:03:10,498 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 25 [2019-08-05 10:03:10,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:10,499 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2019-08-05 10:03:10,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:03:10,499 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2019-08-05 10:03:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:03:10,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:10,501 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:10,502 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:10,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:10,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1611402292, now seen corresponding path program 1 times [2019-08-05 10:03:10,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:10,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:03:10,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:10,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:10,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:10,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:03:10,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:03:10,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:03:10,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:03:10,610 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2019-08-05 10:03:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:10,782 INFO L93 Difference]: Finished difference Result 53 states and 94 transitions. [2019-08-05 10:03:10,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:03:10,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-08-05 10:03:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:10,785 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:03:10,785 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:03:10,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:03:10,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:03:10,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:03:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:03:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 92 transitions. [2019-08-05 10:03:10,795 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 92 transitions. Word has length 26 [2019-08-05 10:03:10,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:10,796 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 92 transitions. [2019-08-05 10:03:10,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:03:10,796 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 92 transitions. [2019-08-05 10:03:10,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:03:10,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:10,797 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:10,798 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:10,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:10,798 INFO L82 PathProgramCache]: Analyzing trace with hash -306855373, now seen corresponding path program 1 times [2019-08-05 10:03:10,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:10,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:03:10,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:10,908 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:11,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:11,069 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:11,070 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:11,073 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:11,076 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:11,079 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:11,557 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-08-05 10:03:11,561 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 10:03:12,103 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2019-08-05 10:03:12,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:03:12,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-08-05 10:03:12,437 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:03:12,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:12,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:12,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-08-05 10:03:12,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:03:12,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:03:12,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:03:12,530 INFO L87 Difference]: Start difference. First operand 52 states and 92 transitions. Second operand 11 states. [2019-08-05 10:03:16,145 WARN L188 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 121 DAG size of output: 121 [2019-08-05 10:03:17,138 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 86 [2019-08-05 10:03:17,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:17,866 INFO L93 Difference]: Finished difference Result 90 states and 156 transitions. [2019-08-05 10:03:17,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:03:17,866 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-08-05 10:03:17,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:17,867 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:03:17,868 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:03:17,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:03:17,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:03:17,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2019-08-05 10:03:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:03:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 121 transitions. [2019-08-05 10:03:17,877 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 121 transitions. Word has length 26 [2019-08-05 10:03:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:17,878 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 121 transitions. [2019-08-05 10:03:17,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:03:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 121 transitions. [2019-08-05 10:03:17,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:03:17,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:17,879 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:17,879 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:17,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:17,880 INFO L82 PathProgramCache]: Analyzing trace with hash -306842043, now seen corresponding path program 1 times [2019-08-05 10:03:17,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:17,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:03:17,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:17,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:17,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:03:17,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:03:17,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:03:17,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:03:17,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:03:17,958 INFO L87 Difference]: Start difference. First operand 68 states and 121 transitions. Second operand 3 states. [2019-08-05 10:03:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:03:18,121 INFO L93 Difference]: Finished difference Result 86 states and 148 transitions. [2019-08-05 10:03:18,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:03:18,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-08-05 10:03:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:03:18,124 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:03:18,124 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:03:18,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:03:18,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:03:18,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2019-08-05 10:03:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:03:18,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 132 transitions. [2019-08-05 10:03:18,132 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 132 transitions. Word has length 26 [2019-08-05 10:03:18,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:03:18,133 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 132 transitions. [2019-08-05 10:03:18,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:03:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 132 transitions. [2019-08-05 10:03:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:03:18,134 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:03:18,134 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:03:18,135 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:03:18,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:03:18,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1392409413, now seen corresponding path program 1 times [2019-08-05 10:03:18,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:03:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:03:18,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:03:18,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:03:18,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:18,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:18,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:20,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:20,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:20,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:26,179 WARN L188 SmtUtils]: Spent 5.38 s on a formula simplification that was a NOOP. DAG size: 65 [2019-08-05 10:03:26,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:03:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:03:30,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:03:30,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:03:30,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:03:30,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:03:30,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=104, Unknown=2, NotChecked=0, Total=132 [2019-08-05 10:03:30,676 INFO L87 Difference]: Start difference. First operand 74 states and 132 transitions. Second operand 12 states. [2019-08-05 10:04:21,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:21,163 INFO L93 Difference]: Finished difference Result 109 states and 188 transitions. [2019-08-05 10:04:21,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:04:21,164 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-08-05 10:04:21,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:21,165 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:04:21,165 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:04:21,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=30, Invalid=123, Unknown=3, NotChecked=0, Total=156 [2019-08-05 10:04:21,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:04:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2019-08-05 10:04:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:04:21,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 171 transitions. [2019-08-05 10:04:21,174 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 171 transitions. Word has length 27 [2019-08-05 10:04:21,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:21,175 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 171 transitions. [2019-08-05 10:04:21,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:04:21,175 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 171 transitions. [2019-08-05 10:04:21,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:04:21,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:21,177 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:21,177 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:21,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:21,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1379772175, now seen corresponding path program 1 times [2019-08-05 10:04:21,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:21,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:04:21,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:21,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:21,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:21,480 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2019-08-05 10:04:21,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:21,611 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:04:21,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:21,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:04:21,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:04:21,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:04:21,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:04:21,613 INFO L87 Difference]: Start difference. First operand 97 states and 171 transitions. Second operand 6 states. [2019-08-05 10:04:22,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:22,335 INFO L93 Difference]: Finished difference Result 110 states and 193 transitions. [2019-08-05 10:04:22,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:04:22,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-08-05 10:04:22,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:22,337 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:04:22,338 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:04:22,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:22,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:04:22,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-08-05 10:04:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:04:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 186 transitions. [2019-08-05 10:04:22,348 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 186 transitions. Word has length 27 [2019-08-05 10:04:22,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:22,348 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 186 transitions. [2019-08-05 10:04:22,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:04:22,348 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 186 transitions. [2019-08-05 10:04:22,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:04:22,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:22,350 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:22,350 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:22,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:22,351 INFO L82 PathProgramCache]: Analyzing trace with hash -924623002, now seen corresponding path program 1 times [2019-08-05 10:04:22,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:22,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:04:22,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:22,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:22,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:22,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:22,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:22,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:22,401 INFO L87 Difference]: Start difference. First operand 106 states and 186 transitions. Second operand 3 states. [2019-08-05 10:04:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:22,501 INFO L93 Difference]: Finished difference Result 108 states and 188 transitions. [2019-08-05 10:04:22,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:22,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:04:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:22,504 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:04:22,504 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:04:22,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:22,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:04:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:04:22,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:04:22,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 182 transitions. [2019-08-05 10:04:22,512 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 182 transitions. Word has length 27 [2019-08-05 10:04:22,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:22,513 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 182 transitions. [2019-08-05 10:04:22,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:22,513 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 182 transitions. [2019-08-05 10:04:22,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:04:22,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:22,515 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:22,515 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:22,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:22,515 INFO L82 PathProgramCache]: Analyzing trace with hash 265376562, now seen corresponding path program 1 times [2019-08-05 10:04:22,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:22,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:04:22,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:22,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:22,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:22,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:22,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:22,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:22,576 INFO L87 Difference]: Start difference. First operand 105 states and 182 transitions. Second operand 3 states. [2019-08-05 10:04:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:22,730 INFO L93 Difference]: Finished difference Result 130 states and 222 transitions. [2019-08-05 10:04:22,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:22,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:04:22,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:22,733 INFO L225 Difference]: With dead ends: 130 [2019-08-05 10:04:22,733 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:04:22,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:04:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 112. [2019-08-05 10:04:22,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:04:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 193 transitions. [2019-08-05 10:04:22,739 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 193 transitions. Word has length 27 [2019-08-05 10:04:22,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:22,740 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 193 transitions. [2019-08-05 10:04:22,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 193 transitions. [2019-08-05 10:04:22,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:04:22,741 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:22,742 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:22,742 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:22,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:22,742 INFO L82 PathProgramCache]: Analyzing trace with hash 265389892, now seen corresponding path program 1 times [2019-08-05 10:04:22,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:22,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:04:22,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:22,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:22,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:22,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:22,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:22,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:22,802 INFO L87 Difference]: Start difference. First operand 112 states and 193 transitions. Second operand 3 states. [2019-08-05 10:04:22,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:22,920 INFO L93 Difference]: Finished difference Result 138 states and 232 transitions. [2019-08-05 10:04:22,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:22,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:04:22,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:22,923 INFO L225 Difference]: With dead ends: 138 [2019-08-05 10:04:22,923 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:04:22,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:22,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:04:22,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 115. [2019-08-05 10:04:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:04:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 198 transitions. [2019-08-05 10:04:22,929 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 198 transitions. Word has length 27 [2019-08-05 10:04:22,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:22,929 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 198 transitions. [2019-08-05 10:04:22,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 198 transitions. [2019-08-05 10:04:22,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:04:22,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:22,931 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:22,932 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:22,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:22,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1997862413, now seen corresponding path program 1 times [2019-08-05 10:04:22,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:22,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:04:22,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:23,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:23,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:23,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:23,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:23,227 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:23,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:23,294 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:04:23,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:23,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:04:23,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:04:23,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:04:23,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:23,296 INFO L87 Difference]: Start difference. First operand 115 states and 198 transitions. Second operand 10 states. [2019-08-05 10:04:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:25,576 INFO L93 Difference]: Finished difference Result 358 states and 589 transitions. [2019-08-05 10:04:25,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:04:25,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-08-05 10:04:25,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:25,579 INFO L225 Difference]: With dead ends: 358 [2019-08-05 10:04:25,580 INFO L226 Difference]: Without dead ends: 339 [2019-08-05 10:04:25,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:04:25,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-08-05 10:04:25,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 203. [2019-08-05 10:04:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-08-05 10:04:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 352 transitions. [2019-08-05 10:04:25,591 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 352 transitions. Word has length 27 [2019-08-05 10:04:25,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:25,591 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 352 transitions. [2019-08-05 10:04:25,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:04:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 352 transitions. [2019-08-05 10:04:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:04:25,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:25,596 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:25,597 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:25,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:25,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1245389759, now seen corresponding path program 1 times [2019-08-05 10:04:25,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:25,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:04:25,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:25,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:25,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:25,759 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:04:25,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:25,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 10:04:25,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:04:25,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:04:25,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:25,761 INFO L87 Difference]: Start difference. First operand 203 states and 352 transitions. Second operand 8 states. [2019-08-05 10:04:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:26,747 INFO L93 Difference]: Finished difference Result 256 states and 436 transitions. [2019-08-05 10:04:26,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:04:26,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-08-05 10:04:26,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:26,750 INFO L225 Difference]: With dead ends: 256 [2019-08-05 10:04:26,750 INFO L226 Difference]: Without dead ends: 252 [2019-08-05 10:04:26,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:04:26,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-08-05 10:04:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 204. [2019-08-05 10:04:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-08-05 10:04:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 353 transitions. [2019-08-05 10:04:26,758 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 353 transitions. Word has length 27 [2019-08-05 10:04:26,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:26,758 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 353 transitions. [2019-08-05 10:04:26,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:04:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 353 transitions. [2019-08-05 10:04:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:26,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:26,760 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:26,760 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:26,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1777594307, now seen corresponding path program 1 times [2019-08-05 10:04:26,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:26,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:04:26,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:26,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:26,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:26,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:04:26,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:04:26,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:04:26,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:04:26,807 INFO L87 Difference]: Start difference. First operand 204 states and 353 transitions. Second operand 4 states. [2019-08-05 10:04:27,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:27,004 INFO L93 Difference]: Finished difference Result 236 states and 400 transitions. [2019-08-05 10:04:27,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:04:27,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-08-05 10:04:27,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:27,007 INFO L225 Difference]: With dead ends: 236 [2019-08-05 10:04:27,007 INFO L226 Difference]: Without dead ends: 236 [2019-08-05 10:04:27,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:04:27,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-08-05 10:04:27,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 204. [2019-08-05 10:04:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-08-05 10:04:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 349 transitions. [2019-08-05 10:04:27,014 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 349 transitions. Word has length 28 [2019-08-05 10:04:27,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:27,015 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 349 transitions. [2019-08-05 10:04:27,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:04:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 349 transitions. [2019-08-05 10:04:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:27,016 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:27,016 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:27,016 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:27,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:27,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1114705772, now seen corresponding path program 1 times [2019-08-05 10:04:27,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:27,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:04:27,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:27,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:27,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:27,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:27,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:27,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:27,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:27,058 INFO L87 Difference]: Start difference. First operand 204 states and 349 transitions. Second operand 3 states. [2019-08-05 10:04:27,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:27,137 INFO L93 Difference]: Finished difference Result 206 states and 351 transitions. [2019-08-05 10:04:27,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:27,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-08-05 10:04:27,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:27,140 INFO L225 Difference]: With dead ends: 206 [2019-08-05 10:04:27,140 INFO L226 Difference]: Without dead ends: 204 [2019-08-05 10:04:27,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:27,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-08-05 10:04:27,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 197. [2019-08-05 10:04:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-08-05 10:04:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 333 transitions. [2019-08-05 10:04:27,146 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 333 transitions. Word has length 28 [2019-08-05 10:04:27,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:27,146 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 333 transitions. [2019-08-05 10:04:27,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 333 transitions. [2019-08-05 10:04:27,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:27,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:27,148 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:27,148 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:27,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:27,148 INFO L82 PathProgramCache]: Analyzing trace with hash 310615989, now seen corresponding path program 1 times [2019-08-05 10:04:27,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:27,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:04:27,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:27,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:27,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:27,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:27,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:27,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:27,219 INFO L87 Difference]: Start difference. First operand 197 states and 333 transitions. Second operand 3 states. [2019-08-05 10:04:27,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:27,490 INFO L93 Difference]: Finished difference Result 207 states and 349 transitions. [2019-08-05 10:04:27,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:27,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-08-05 10:04:27,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:27,492 INFO L225 Difference]: With dead ends: 207 [2019-08-05 10:04:27,492 INFO L226 Difference]: Without dead ends: 207 [2019-08-05 10:04:27,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-08-05 10:04:27,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2019-08-05 10:04:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-08-05 10:04:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 335 transitions. [2019-08-05 10:04:27,498 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 335 transitions. Word has length 28 [2019-08-05 10:04:27,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:27,498 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 335 transitions. [2019-08-05 10:04:27,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:27,498 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 335 transitions. [2019-08-05 10:04:27,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:27,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:27,499 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:27,500 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:27,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:27,500 INFO L82 PathProgramCache]: Analyzing trace with hash 302567245, now seen corresponding path program 1 times [2019-08-05 10:04:27,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:27,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:04:27,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:27,547 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:04:27,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:27,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:27,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:27,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:27,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:27,549 INFO L87 Difference]: Start difference. First operand 199 states and 335 transitions. Second operand 3 states. [2019-08-05 10:04:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:27,670 INFO L93 Difference]: Finished difference Result 200 states and 336 transitions. [2019-08-05 10:04:27,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:27,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-08-05 10:04:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:27,673 INFO L225 Difference]: With dead ends: 200 [2019-08-05 10:04:27,673 INFO L226 Difference]: Without dead ends: 200 [2019-08-05 10:04:27,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-08-05 10:04:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 190. [2019-08-05 10:04:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-08-05 10:04:27,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 318 transitions. [2019-08-05 10:04:27,679 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 318 transitions. Word has length 28 [2019-08-05 10:04:27,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:27,679 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 318 transitions. [2019-08-05 10:04:27,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 318 transitions. [2019-08-05 10:04:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:27,680 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:27,680 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:27,681 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:27,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:27,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1147600519, now seen corresponding path program 1 times [2019-08-05 10:04:27,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:27,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:04:27,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:27,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:27,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:04:27,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:04:27,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:04:27,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:04:27,823 INFO L87 Difference]: Start difference. First operand 190 states and 318 transitions. Second operand 4 states. [2019-08-05 10:04:28,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:28,065 INFO L93 Difference]: Finished difference Result 251 states and 415 transitions. [2019-08-05 10:04:28,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:28,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-08-05 10:04:28,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:28,068 INFO L225 Difference]: With dead ends: 251 [2019-08-05 10:04:28,068 INFO L226 Difference]: Without dead ends: 247 [2019-08-05 10:04:28,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:28,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-08-05 10:04:28,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 190. [2019-08-05 10:04:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-08-05 10:04:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 318 transitions. [2019-08-05 10:04:28,074 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 318 transitions. Word has length 28 [2019-08-05 10:04:28,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:28,074 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 318 transitions. [2019-08-05 10:04:28,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:04:28,075 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 318 transitions. [2019-08-05 10:04:28,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:28,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:28,075 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:28,076 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:28,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:28,076 INFO L82 PathProgramCache]: Analyzing trace with hash 429669747, now seen corresponding path program 2 times [2019-08-05 10:04:28,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:28,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:04:28,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:28,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:28,207 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:28,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:28,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:28,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:28,210 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:28,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:28,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:28,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:28,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:28,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:04:28,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:04:28,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:04:28,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:28,337 INFO L87 Difference]: Start difference. First operand 190 states and 318 transitions. Second operand 8 states. [2019-08-05 10:04:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:29,835 INFO L93 Difference]: Finished difference Result 335 states and 557 transitions. [2019-08-05 10:04:29,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:04:29,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-08-05 10:04:29,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:29,839 INFO L225 Difference]: With dead ends: 335 [2019-08-05 10:04:29,839 INFO L226 Difference]: Without dead ends: 323 [2019-08-05 10:04:29,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:04:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-08-05 10:04:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 250. [2019-08-05 10:04:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-08-05 10:04:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 422 transitions. [2019-08-05 10:04:29,846 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 422 transitions. Word has length 28 [2019-08-05 10:04:29,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:29,846 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 422 transitions. [2019-08-05 10:04:29,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:04:29,846 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 422 transitions. [2019-08-05 10:04:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:04:29,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:29,847 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:29,848 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:29,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:29,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1422146047, now seen corresponding path program 1 times [2019-08-05 10:04:29,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:29,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:04:29,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:29,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:30,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:30,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:30,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:30,128 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:30,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:30,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:30,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:30,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:30,636 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 52 [2019-08-05 10:04:30,638 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:04:30,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:30,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:30,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-08-05 10:04:30,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:04:30,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:04:30,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:30,649 INFO L87 Difference]: Start difference. First operand 250 states and 422 transitions. Second operand 10 states. [2019-08-05 10:04:33,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:33,627 INFO L93 Difference]: Finished difference Result 295 states and 489 transitions. [2019-08-05 10:04:33,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:04:33,627 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-08-05 10:04:33,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:33,629 INFO L225 Difference]: With dead ends: 295 [2019-08-05 10:04:33,629 INFO L226 Difference]: Without dead ends: 295 [2019-08-05 10:04:33,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:04:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-08-05 10:04:33,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 244. [2019-08-05 10:04:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-08-05 10:04:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 412 transitions. [2019-08-05 10:04:33,636 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 412 transitions. Word has length 28 [2019-08-05 10:04:33,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:33,636 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 412 transitions. [2019-08-05 10:04:33,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:04:33,637 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 412 transitions. [2019-08-05 10:04:33,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:33,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:33,638 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:33,638 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:33,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:33,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1048724554, now seen corresponding path program 1 times [2019-08-05 10:04:33,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:33,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:04:33,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:33,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:33,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:04:33,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:04:33,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:04:33,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:33,677 INFO L87 Difference]: Start difference. First operand 244 states and 412 transitions. Second operand 3 states. [2019-08-05 10:04:33,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:33,783 INFO L93 Difference]: Finished difference Result 243 states and 401 transitions. [2019-08-05 10:04:33,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:04:33,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-08-05 10:04:33,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:33,786 INFO L225 Difference]: With dead ends: 243 [2019-08-05 10:04:33,786 INFO L226 Difference]: Without dead ends: 237 [2019-08-05 10:04:33,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:04:33,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-05 10:04:33,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 222. [2019-08-05 10:04:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-08-05 10:04:33,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 370 transitions. [2019-08-05 10:04:33,792 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 370 transitions. Word has length 29 [2019-08-05 10:04:33,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:33,792 INFO L475 AbstractCegarLoop]: Abstraction has 222 states and 370 transitions. [2019-08-05 10:04:33,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:04:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 370 transitions. [2019-08-05 10:04:33,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:33,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:33,793 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:33,794 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:33,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:33,794 INFO L82 PathProgramCache]: Analyzing trace with hash -516259181, now seen corresponding path program 1 times [2019-08-05 10:04:33,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:33,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:04:33,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:33,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:33,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,308 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-08-05 10:04:34,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:04:34,370 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:34,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:36,043 WARN L188 SmtUtils]: Spent 740.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 10:04:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:36,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:36,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:04:36,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:04:36,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:04:36,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:36,051 INFO L87 Difference]: Start difference. First operand 222 states and 370 transitions. Second operand 11 states. [2019-08-05 10:04:37,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:37,876 INFO L93 Difference]: Finished difference Result 240 states and 392 transitions. [2019-08-05 10:04:37,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:04:37,876 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-08-05 10:04:37,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:37,877 INFO L225 Difference]: With dead ends: 240 [2019-08-05 10:04:37,877 INFO L226 Difference]: Without dead ends: 234 [2019-08-05 10:04:37,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:04:37,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-08-05 10:04:37,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-08-05 10:04:37,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-08-05 10:04:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 383 transitions. [2019-08-05 10:04:37,882 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 383 transitions. Word has length 29 [2019-08-05 10:04:37,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:37,882 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 383 transitions. [2019-08-05 10:04:37,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:04:37,882 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 383 transitions. [2019-08-05 10:04:37,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:37,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:37,883 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:37,884 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:37,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:37,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1549616299, now seen corresponding path program 2 times [2019-08-05 10:04:37,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:37,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:04:37,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:38,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:38,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:04:38,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:04:38,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:04:38,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:04:38,012 INFO L87 Difference]: Start difference. First operand 233 states and 383 transitions. Second operand 4 states. [2019-08-05 10:04:38,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:38,874 INFO L93 Difference]: Finished difference Result 249 states and 402 transitions. [2019-08-05 10:04:38,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:38,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-08-05 10:04:38,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:38,876 INFO L225 Difference]: With dead ends: 249 [2019-08-05 10:04:38,877 INFO L226 Difference]: Without dead ends: 231 [2019-08-05 10:04:38,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-08-05 10:04:38,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 227. [2019-08-05 10:04:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-08-05 10:04:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 370 transitions. [2019-08-05 10:04:38,881 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 370 transitions. Word has length 29 [2019-08-05 10:04:38,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:38,882 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 370 transitions. [2019-08-05 10:04:38,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:04:38,882 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 370 transitions. [2019-08-05 10:04:38,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:04:38,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:38,883 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:38,883 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:38,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:38,884 INFO L82 PathProgramCache]: Analyzing trace with hash 510236826, now seen corresponding path program 1 times [2019-08-05 10:04:38,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:38,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:04:38,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:04:38,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:38,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:04:38,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:04:38,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:04:38,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:04:38,914 INFO L87 Difference]: Start difference. First operand 227 states and 370 transitions. Second operand 4 states. [2019-08-05 10:04:39,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:39,122 INFO L93 Difference]: Finished difference Result 287 states and 468 transitions. [2019-08-05 10:04:39,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:39,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-08-05 10:04:39,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:39,130 INFO L225 Difference]: With dead ends: 287 [2019-08-05 10:04:39,130 INFO L226 Difference]: Without dead ends: 285 [2019-08-05 10:04:39,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-08-05 10:04:39,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-08-05 10:04:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-08-05 10:04:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 384 transitions. [2019-08-05 10:04:39,134 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 384 transitions. Word has length 29 [2019-08-05 10:04:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:39,134 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 384 transitions. [2019-08-05 10:04:39,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:04:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 384 transitions. [2019-08-05 10:04:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:39,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:39,135 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:39,135 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:39,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:39,135 INFO L82 PathProgramCache]: Analyzing trace with hash -886365735, now seen corresponding path program 1 times [2019-08-05 10:04:39,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:39,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:04:39,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:39,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:39,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:41,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:41,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:41,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:41,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:41,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-08-05 10:04:41,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:04:41,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:04:41,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:41,291 INFO L87 Difference]: Start difference. First operand 234 states and 384 transitions. Second operand 10 states. [2019-08-05 10:04:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:42,031 INFO L93 Difference]: Finished difference Result 265 states and 428 transitions. [2019-08-05 10:04:42,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:04:42,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-08-05 10:04:42,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:42,033 INFO L225 Difference]: With dead ends: 265 [2019-08-05 10:04:42,033 INFO L226 Difference]: Without dead ends: 264 [2019-08-05 10:04:42,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:04:42,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-08-05 10:04:42,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 251. [2019-08-05 10:04:42,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-08-05 10:04:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 408 transitions. [2019-08-05 10:04:42,038 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 408 transitions. Word has length 30 [2019-08-05 10:04:42,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:42,039 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 408 transitions. [2019-08-05 10:04:42,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:04:42,039 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 408 transitions. [2019-08-05 10:04:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:04:42,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:42,040 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:42,040 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:42,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:42,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1556785767, now seen corresponding path program 1 times [2019-08-05 10:04:42,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:42,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:04:42,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:42,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:42,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:42,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:04:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:42,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:42,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:04:42,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:42,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:42,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:42,167 INFO L87 Difference]: Start difference. First operand 251 states and 408 transitions. Second operand 5 states. [2019-08-05 10:04:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:42,654 INFO L93 Difference]: Finished difference Result 121 states and 193 transitions. [2019-08-05 10:04:42,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:42,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-08-05 10:04:42,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:42,655 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:04:42,656 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:04:42,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:04:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2019-08-05 10:04:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:04:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 184 transitions. [2019-08-05 10:04:42,659 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 184 transitions. Word has length 30 [2019-08-05 10:04:42,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:42,659 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 184 transitions. [2019-08-05 10:04:42,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 184 transitions. [2019-08-05 10:04:42,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:04:42,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:42,660 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:42,661 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:42,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:42,661 INFO L82 PathProgramCache]: Analyzing trace with hash 715409170, now seen corresponding path program 1 times [2019-08-05 10:04:42,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:42,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:04:42,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:04:42,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:42,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:04:42,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:04:42,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:04:42,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:04:42,781 INFO L87 Difference]: Start difference. First operand 115 states and 184 transitions. Second operand 8 states. [2019-08-05 10:04:43,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:43,187 INFO L93 Difference]: Finished difference Result 90 states and 140 transitions. [2019-08-05 10:04:43,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:04:43,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-08-05 10:04:43,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:43,188 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:04:43,188 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:04:43,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:04:43,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:04:43,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:04:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:04:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 127 transitions. [2019-08-05 10:04:43,192 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 127 transitions. Word has length 32 [2019-08-05 10:04:43,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:43,193 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 127 transitions. [2019-08-05 10:04:43,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:04:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 127 transitions. [2019-08-05 10:04:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:04:43,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:43,194 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:43,194 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:43,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:43,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1911000855, now seen corresponding path program 1 times [2019-08-05 10:04:43,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:43,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:04:43,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:43,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:43,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:04:43,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:04:43,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:43,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:43,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:43,246 INFO L87 Difference]: Start difference. First operand 79 states and 127 transitions. Second operand 5 states. [2019-08-05 10:04:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:43,398 INFO L93 Difference]: Finished difference Result 83 states and 133 transitions. [2019-08-05 10:04:43,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:04:43,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-08-05 10:04:43,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:43,400 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:04:43,400 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:04:43,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:43,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:04:43,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:04:43,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:04:43,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2019-08-05 10:04:43,402 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 35 [2019-08-05 10:04:43,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:43,402 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2019-08-05 10:04:43,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:43,403 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2019-08-05 10:04:43,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:04:43,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:43,403 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:43,404 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:43,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:43,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1018271660, now seen corresponding path program 2 times [2019-08-05 10:04:43,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:43,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:04:43,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:43,989 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 16 [2019-08-05 10:04:44,344 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-08-05 10:04:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:45,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:45,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:04:45,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:04:45,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:04:45,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:04:45,202 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand 17 states. [2019-08-05 10:04:46,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:46,092 INFO L93 Difference]: Finished difference Result 97 states and 151 transitions. [2019-08-05 10:04:46,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:04:46,092 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2019-08-05 10:04:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:46,093 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:04:46,093 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:04:46,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:04:46,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:04:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2019-08-05 10:04:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:04:46,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 135 transitions. [2019-08-05 10:04:46,097 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 135 transitions. Word has length 38 [2019-08-05 10:04:46,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:46,097 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 135 transitions. [2019-08-05 10:04:46,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:04:46,097 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 135 transitions. [2019-08-05 10:04:46,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:04:46,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:46,098 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:46,098 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:46,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:46,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1190172946, now seen corresponding path program 3 times [2019-08-05 10:04:46,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:46,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:04:46,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:04:46,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:46,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:04:46,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:04:46,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:04:46,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:04:46,142 INFO L87 Difference]: Start difference. First operand 84 states and 135 transitions. Second operand 5 states. [2019-08-05 10:04:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:46,330 INFO L93 Difference]: Finished difference Result 104 states and 163 transitions. [2019-08-05 10:04:46,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:04:46,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-08-05 10:04:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:46,331 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:04:46,331 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:04:46,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:04:46,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:04:46,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2019-08-05 10:04:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:04:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 135 transitions. [2019-08-05 10:04:46,334 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 135 transitions. Word has length 39 [2019-08-05 10:04:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:46,334 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 135 transitions. [2019-08-05 10:04:46,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:04:46,335 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 135 transitions. [2019-08-05 10:04:46,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:04:46,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:46,335 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:46,335 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:46,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:46,336 INFO L82 PathProgramCache]: Analyzing trace with hash -591570517, now seen corresponding path program 4 times [2019-08-05 10:04:46,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:46,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:04:46,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:04:46,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:46,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:04:46,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:04:46,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:04:46,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:04:46,733 INFO L87 Difference]: Start difference. First operand 85 states and 135 transitions. Second operand 19 states. [2019-08-05 10:04:47,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:47,925 INFO L93 Difference]: Finished difference Result 101 states and 155 transitions. [2019-08-05 10:04:47,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:04:47,925 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2019-08-05 10:04:47,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:47,926 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:04:47,926 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:04:47,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:04:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:04:47,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2019-08-05 10:04:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:04:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 141 transitions. [2019-08-05 10:04:47,930 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 141 transitions. Word has length 42 [2019-08-05 10:04:47,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:47,930 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 141 transitions. [2019-08-05 10:04:47,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:04:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 141 transitions. [2019-08-05 10:04:47,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:04:47,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:04:47,931 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:04:47,932 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:04:47,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:04:47,932 INFO L82 PathProgramCache]: Analyzing trace with hash -669661310, now seen corresponding path program 5 times [2019-08-05 10:04:47,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:04:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:04:47,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:04:47,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:04:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-08-05 10:04:48,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:04:48,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:04:48,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:04:48,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:04:48,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:04:48,225 INFO L87 Difference]: Start difference. First operand 89 states and 141 transitions. Second operand 10 states. [2019-08-05 10:04:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:04:48,480 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2019-08-05 10:04:48,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:04:48,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2019-08-05 10:04:48,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:04:48,481 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:04:48,481 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:04:48,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:04:48,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:04:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:04:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:04:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:04:48,483 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2019-08-05 10:04:48,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:04:48,483 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:04:48,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:04:48,484 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:04:48,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:04:48,489 INFO L202 PluginConnector]: Adding new model RanFile094.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:04:48 BoogieIcfgContainer [2019-08-05 10:04:48,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:04:48,491 INFO L168 Benchmark]: Toolchain (without parser) took 102197.38 ms. Allocated memory was 141.6 MB in the beginning and 361.2 MB in the end (delta: 219.7 MB). Free memory was 109.1 MB in the beginning and 202.8 MB in the end (delta: -93.7 MB). Peak memory consumption was 125.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:04:48,492 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory was 111.2 MB in the beginning and 111.0 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:04:48,493 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.05 ms. Allocated memory is still 141.6 MB. Free memory was 108.9 MB in the beginning and 107.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:04:48,494 INFO L168 Benchmark]: Boogie Preprocessor took 77.81 ms. Allocated memory is still 141.6 MB. Free memory was 107.0 MB in the beginning and 105.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:04:48,495 INFO L168 Benchmark]: RCFGBuilder took 2342.37 ms. Allocated memory was 141.6 MB in the beginning and 175.6 MB in the end (delta: 34.1 MB). Free memory was 105.0 MB in the beginning and 122.9 MB in the end (delta: -17.9 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:04:48,495 INFO L168 Benchmark]: TraceAbstraction took 99732.74 ms. Allocated memory was 175.6 MB in the beginning and 361.2 MB in the end (delta: 185.6 MB). Free memory was 122.2 MB in the beginning and 202.8 MB in the end (delta: -80.7 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:04:48,499 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.21 ms. Allocated memory is still 141.6 MB. Free memory was 111.2 MB in the beginning and 111.0 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 39.05 ms. Allocated memory is still 141.6 MB. Free memory was 108.9 MB in the beginning and 107.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 77.81 ms. Allocated memory is still 141.6 MB. Free memory was 107.0 MB in the beginning and 105.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2342.37 ms. Allocated memory was 141.6 MB in the beginning and 175.6 MB in the end (delta: 34.1 MB). Free memory was 105.0 MB in the beginning and 122.9 MB in the end (delta: -17.9 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99732.74 ms. Allocated memory was 175.6 MB in the beginning and 361.2 MB in the end (delta: 185.6 MB). Free memory was 122.2 MB in the beginning and 202.8 MB in the end (delta: -80.7 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 263]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 264]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 265]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 3 error locations. SAFE Result, 99.6s OverallTime, 30 OverallIterations, 4 TraceHistogramMax, 74.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1941 SDtfs, 1035 SDslu, 1108 SDs, 0 SdLazy, 9924 SolverSat, 269 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 62.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 925 GetRequests, 718 SyntacticMatches, 5 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 32.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=23, 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, 30 MinimizatonAttempts, 629 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 24.2s InterpolantComputationTime, 896 NumberOfCodeBlocks, 896 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 866 ConstructedInterpolants, 83 QuantifiedInterpolants, 237631 SizeOfPredicates, 96 NumberOfNonLiveVariables, 1859 ConjunctsInSsa, 221 ConjunctsInUnsatCore, 30 InterpolantComputations, 20 PerfectInterpolantSequences, 55/119 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...