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/real-life/threadpooling_out.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:13:23,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:13:23,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:13:23,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:13:23,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:13:23,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:13:23,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:13:23,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:13:23,745 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:13:23,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:13:23,747 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:13:23,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:13:23,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:13:23,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:13:23,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:13:23,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:13:23,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:13:23,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:13:23,764 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:13:23,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:13:23,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:13:23,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:13:23,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:13:23,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:13:23,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:13:23,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:13:23,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:13:23,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:13:23,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:13:23,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:13:23,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:13:23,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:13:23,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:13:23,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:13:23,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:13:23,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:13:23,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:13:23,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:13:23,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:13:23,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:13:23,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:13:23,827 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:13:23,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:13:23,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:13:23,844 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:13:23,844 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:13:23,845 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl [2019-08-05 10:13:23,845 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2019-08-05 10:13:23,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:13:23,908 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:13:23,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:13:23,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:13:23,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:13:23,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:23" (1/1) ... [2019-08-05 10:13:23,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:23" (1/1) ... [2019-08-05 10:13:23,955 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:13:23,956 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:13:23,956 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:13:23,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:13:23,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:13:23,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:13:23,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:13:23,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:23" (1/1) ... [2019-08-05 10:13:23,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:23" (1/1) ... [2019-08-05 10:13:23,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:23" (1/1) ... [2019-08-05 10:13:23,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:23" (1/1) ... [2019-08-05 10:13:23,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:23" (1/1) ... [2019-08-05 10:13:24,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:23" (1/1) ... [2019-08-05 10:13:24,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:23" (1/1) ... [2019-08-05 10:13:24,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:13:24,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:13:24,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:13:24,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:13:24,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:23" (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:13:24,082 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2019-08-05 10:13:24,082 INFO L130 BoogieDeclarations]: Found specification of procedure product [2019-08-05 10:13:24,082 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2019-08-05 10:13:24,916 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint productFINAL: assume true; [2019-08-05 10:13:24,918 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:13:24,918 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:13:24,919 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:13:24 BoogieIcfgContainer [2019-08-05 10:13:24,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:13:24,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:13:24,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:13:24,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:13:24,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:13:23" (1/2) ... [2019-08-05 10:13:24,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cdd3144 and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:13:24, skipping insertion in model container [2019-08-05 10:13:24,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:13:24" (2/2) ... [2019-08-05 10:13:24,928 INFO L109 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2019-08-05 10:13:24,937 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:13:24,946 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-08-05 10:13:24,962 INFO L252 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-08-05 10:13:24,985 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:13:24,985 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:13:24,985 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:13:24,986 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:13:24,986 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:13:24,986 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:13:24,986 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:13:24,986 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:13:24,986 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:13:25,004 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2019-08-05 10:13:25,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:13:25,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:25,014 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:25,017 INFO L418 AbstractCegarLoop]: === Iteration 1 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:25,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:25,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2019-08-05 10:13:25,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:25,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:25,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:25,393 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:13:25,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:25,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:13:25,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:13:25,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:13:25,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:13:25,422 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2019-08-05 10:13:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:27,284 INFO L93 Difference]: Finished difference Result 158 states and 348 transitions. [2019-08-05 10:13:27,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:13:27,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 10:13:27,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:27,301 INFO L225 Difference]: With dead ends: 158 [2019-08-05 10:13:27,302 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 10:13:27,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:27,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 10:13:27,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2019-08-05 10:13:27,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:13:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2019-08-05 10:13:27,352 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2019-08-05 10:13:27,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:27,353 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2019-08-05 10:13:27,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:13:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2019-08-05 10:13:27,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:13:27,354 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:27,355 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:27,356 INFO L418 AbstractCegarLoop]: === Iteration 2 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:27,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:27,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2019-08-05 10:13:27,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:27,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:13:27,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:27,503 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:13:27,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:27,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:13:27,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:13:27,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:13:27,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:13:27,508 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2019-08-05 10:13:28,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:28,267 INFO L93 Difference]: Finished difference Result 183 states and 408 transitions. [2019-08-05 10:13:28,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:13:28,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 10:13:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:28,271 INFO L225 Difference]: With dead ends: 183 [2019-08-05 10:13:28,272 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 10:13:28,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:13:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 10:13:28,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2019-08-05 10:13:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:13:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2019-08-05 10:13:28,286 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2019-08-05 10:13:28,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:28,287 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2019-08-05 10:13:28,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:13:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2019-08-05 10:13:28,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:13:28,288 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:28,288 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:28,289 INFO L418 AbstractCegarLoop]: === Iteration 3 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:28,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:28,290 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2019-08-05 10:13:28,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:28,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:28,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:28,436 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:13:28,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:28,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:13:28,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:28,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:28,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:28,437 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2019-08-05 10:13:29,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:29,655 INFO L93 Difference]: Finished difference Result 212 states and 478 transitions. [2019-08-05 10:13:29,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:13:29,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-05 10:13:29,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:29,660 INFO L225 Difference]: With dead ends: 212 [2019-08-05 10:13:29,660 INFO L226 Difference]: Without dead ends: 212 [2019-08-05 10:13:29,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:13:29,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-08-05 10:13:29,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 138. [2019-08-05 10:13:29,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 10:13:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 304 transitions. [2019-08-05 10:13:29,672 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 304 transitions. Word has length 9 [2019-08-05 10:13:29,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:29,673 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 304 transitions. [2019-08-05 10:13:29,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:29,673 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 304 transitions. [2019-08-05 10:13:29,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:13:29,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:29,674 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:29,675 INFO L418 AbstractCegarLoop]: === Iteration 4 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:29,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:29,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2019-08-05 10:13:29,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:29,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:13:29,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:29,805 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:13:29,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:29,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:13:29,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:13:29,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:13:29,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:13:29,808 INFO L87 Difference]: Start difference. First operand 138 states and 304 transitions. Second operand 7 states. [2019-08-05 10:13:30,009 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-08-05 10:13:30,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:30,723 INFO L93 Difference]: Finished difference Result 253 states and 572 transitions. [2019-08-05 10:13:30,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:13:30,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-05 10:13:30,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:30,726 INFO L225 Difference]: With dead ends: 253 [2019-08-05 10:13:30,726 INFO L226 Difference]: Without dead ends: 253 [2019-08-05 10:13:30,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:13:30,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-08-05 10:13:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 159. [2019-08-05 10:13:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-05 10:13:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 351 transitions. [2019-08-05 10:13:30,755 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 351 transitions. Word has length 9 [2019-08-05 10:13:30,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:30,756 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 351 transitions. [2019-08-05 10:13:30,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:13:30,756 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 351 transitions. [2019-08-05 10:13:30,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:13:30,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:30,757 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:30,758 INFO L418 AbstractCegarLoop]: === Iteration 5 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:30,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:30,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2019-08-05 10:13:30,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:30,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:30,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:30,945 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:13:30,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:30,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:30,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:30,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:30,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:30,947 INFO L87 Difference]: Start difference. First operand 159 states and 351 transitions. Second operand 8 states. [2019-08-05 10:13:33,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:33,296 INFO L93 Difference]: Finished difference Result 798 states and 1815 transitions. [2019-08-05 10:13:33,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:13:33,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:13:33,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:33,304 INFO L225 Difference]: With dead ends: 798 [2019-08-05 10:13:33,304 INFO L226 Difference]: Without dead ends: 798 [2019-08-05 10:13:33,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:13:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-08-05 10:13:33,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 382. [2019-08-05 10:13:33,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-08-05 10:13:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 912 transitions. [2019-08-05 10:13:33,325 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 912 transitions. Word has length 12 [2019-08-05 10:13:33,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:33,325 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 912 transitions. [2019-08-05 10:13:33,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:33,326 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 912 transitions. [2019-08-05 10:13:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:13:33,328 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:33,328 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:33,329 INFO L418 AbstractCegarLoop]: === Iteration 6 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:33,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:33,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2019-08-05 10:13:33,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:33,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:33,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:33,424 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:13:33,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:33,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:33,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:33,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:33,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:33,426 INFO L87 Difference]: Start difference. First operand 382 states and 912 transitions. Second operand 8 states. [2019-08-05 10:13:37,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:37,983 INFO L93 Difference]: Finished difference Result 921 states and 2086 transitions. [2019-08-05 10:13:37,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:13:37,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:13:37,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:37,989 INFO L225 Difference]: With dead ends: 921 [2019-08-05 10:13:37,989 INFO L226 Difference]: Without dead ends: 921 [2019-08-05 10:13:37,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:13:37,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-08-05 10:13:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 388. [2019-08-05 10:13:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-08-05 10:13:38,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 924 transitions. [2019-08-05 10:13:38,008 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 924 transitions. Word has length 12 [2019-08-05 10:13:38,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:38,008 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 924 transitions. [2019-08-05 10:13:38,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:38,009 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 924 transitions. [2019-08-05 10:13:38,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:13:38,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:38,011 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:38,011 INFO L418 AbstractCegarLoop]: === Iteration 7 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:38,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:38,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2019-08-05 10:13:38,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:38,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:38,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:38,113 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:13:38,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:38,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:38,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:38,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:38,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:38,114 INFO L87 Difference]: Start difference. First operand 388 states and 924 transitions. Second operand 8 states. [2019-08-05 10:13:40,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:40,991 INFO L93 Difference]: Finished difference Result 817 states and 1840 transitions. [2019-08-05 10:13:40,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:13:40,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:13:40,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:40,998 INFO L225 Difference]: With dead ends: 817 [2019-08-05 10:13:40,998 INFO L226 Difference]: Without dead ends: 817 [2019-08-05 10:13:40,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:13:41,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2019-08-05 10:13:41,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 416. [2019-08-05 10:13:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-08-05 10:13:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1000 transitions. [2019-08-05 10:13:41,016 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1000 transitions. Word has length 12 [2019-08-05 10:13:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:41,016 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 1000 transitions. [2019-08-05 10:13:41,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1000 transitions. [2019-08-05 10:13:41,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:13:41,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:41,018 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:41,019 INFO L418 AbstractCegarLoop]: === Iteration 8 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:41,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:41,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2019-08-05 10:13:41,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:41,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:41,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:41,137 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:13:41,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:41,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:41,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:41,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:41,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:41,139 INFO L87 Difference]: Start difference. First operand 416 states and 1000 transitions. Second operand 8 states. [2019-08-05 10:13:42,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:42,726 INFO L93 Difference]: Finished difference Result 666 states and 1511 transitions. [2019-08-05 10:13:42,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:13:42,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:13:42,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:42,731 INFO L225 Difference]: With dead ends: 666 [2019-08-05 10:13:42,731 INFO L226 Difference]: Without dead ends: 666 [2019-08-05 10:13:42,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:13:42,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-08-05 10:13:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 422. [2019-08-05 10:13:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-08-05 10:13:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1004 transitions. [2019-08-05 10:13:42,744 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1004 transitions. Word has length 12 [2019-08-05 10:13:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:42,745 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 1004 transitions. [2019-08-05 10:13:42,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1004 transitions. [2019-08-05 10:13:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:13:42,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:42,746 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:42,747 INFO L418 AbstractCegarLoop]: === Iteration 9 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:42,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:42,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2019-08-05 10:13:42,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:42,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:42,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:42,838 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:13:42,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:42,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:42,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:42,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:42,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:42,841 INFO L87 Difference]: Start difference. First operand 422 states and 1004 transitions. Second operand 8 states. [2019-08-05 10:13:45,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:45,061 INFO L93 Difference]: Finished difference Result 1103 states and 2507 transitions. [2019-08-05 10:13:45,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:13:45,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:13:45,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:45,070 INFO L225 Difference]: With dead ends: 1103 [2019-08-05 10:13:45,071 INFO L226 Difference]: Without dead ends: 1103 [2019-08-05 10:13:45,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:13:45,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-08-05 10:13:45,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 434. [2019-08-05 10:13:45,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-08-05 10:13:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1032 transitions. [2019-08-05 10:13:45,092 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1032 transitions. Word has length 12 [2019-08-05 10:13:45,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:45,092 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 1032 transitions. [2019-08-05 10:13:45,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1032 transitions. [2019-08-05 10:13:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:13:45,093 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:45,093 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:45,094 INFO L418 AbstractCegarLoop]: === Iteration 10 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:45,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:45,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2019-08-05 10:13:45,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:45,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:45,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:45,183 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:13:45,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:45,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:45,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:45,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:45,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:45,185 INFO L87 Difference]: Start difference. First operand 434 states and 1032 transitions. Second operand 8 states. [2019-08-05 10:13:47,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:47,625 INFO L93 Difference]: Finished difference Result 1091 states and 2447 transitions. [2019-08-05 10:13:47,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:13:47,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:13:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:47,634 INFO L225 Difference]: With dead ends: 1091 [2019-08-05 10:13:47,634 INFO L226 Difference]: Without dead ends: 1091 [2019-08-05 10:13:47,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:13:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2019-08-05 10:13:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 462. [2019-08-05 10:13:47,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-08-05 10:13:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1108 transitions. [2019-08-05 10:13:47,651 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1108 transitions. Word has length 12 [2019-08-05 10:13:47,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:47,652 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 1108 transitions. [2019-08-05 10:13:47,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1108 transitions. [2019-08-05 10:13:47,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:13:47,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:47,653 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:47,654 INFO L418 AbstractCegarLoop]: === Iteration 11 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:47,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:47,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2019-08-05 10:13:47,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:47,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:47,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:47,823 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:13:47,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:47,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:47,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:47,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:47,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:47,825 INFO L87 Difference]: Start difference. First operand 462 states and 1108 transitions. Second operand 8 states. [2019-08-05 10:13:49,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:49,507 INFO L93 Difference]: Finished difference Result 933 states and 2102 transitions. [2019-08-05 10:13:49,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:13:49,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:13:49,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:49,514 INFO L225 Difference]: With dead ends: 933 [2019-08-05 10:13:49,514 INFO L226 Difference]: Without dead ends: 933 [2019-08-05 10:13:49,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:13:49,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-08-05 10:13:49,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 428. [2019-08-05 10:13:49,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-08-05 10:13:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1020 transitions. [2019-08-05 10:13:49,529 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1020 transitions. Word has length 12 [2019-08-05 10:13:49,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:49,530 INFO L475 AbstractCegarLoop]: Abstraction has 428 states and 1020 transitions. [2019-08-05 10:13:49,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:49,530 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1020 transitions. [2019-08-05 10:13:49,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:13:49,531 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:49,531 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:49,531 INFO L418 AbstractCegarLoop]: === Iteration 12 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:49,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:49,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2019-08-05 10:13:49,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:49,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:49,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:49,648 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:13:49,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:49,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:49,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:49,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:49,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:49,650 INFO L87 Difference]: Start difference. First operand 428 states and 1020 transitions. Second operand 8 states. [2019-08-05 10:13:52,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:52,071 INFO L93 Difference]: Finished difference Result 1016 states and 2300 transitions. [2019-08-05 10:13:52,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:13:52,072 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:13:52,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:52,078 INFO L225 Difference]: With dead ends: 1016 [2019-08-05 10:13:52,078 INFO L226 Difference]: Without dead ends: 1016 [2019-08-05 10:13:52,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:13:52,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-08-05 10:13:52,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 474. [2019-08-05 10:13:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-08-05 10:13:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1152 transitions. [2019-08-05 10:13:52,093 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1152 transitions. Word has length 12 [2019-08-05 10:13:52,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:52,095 INFO L475 AbstractCegarLoop]: Abstraction has 474 states and 1152 transitions. [2019-08-05 10:13:52,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:52,095 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1152 transitions. [2019-08-05 10:13:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:13:52,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:52,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:52,096 INFO L418 AbstractCegarLoop]: === Iteration 13 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:52,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:52,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2019-08-05 10:13:52,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:52,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:52,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:52,299 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:13:52,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:52,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:52,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:52,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:52,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:52,301 INFO L87 Difference]: Start difference. First operand 474 states and 1152 transitions. Second operand 8 states. [2019-08-05 10:13:54,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:54,122 INFO L93 Difference]: Finished difference Result 919 states and 2083 transitions. [2019-08-05 10:13:54,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:13:54,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:13:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:54,129 INFO L225 Difference]: With dead ends: 919 [2019-08-05 10:13:54,129 INFO L226 Difference]: Without dead ends: 919 [2019-08-05 10:13:54,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:13:54,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-08-05 10:13:54,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 462. [2019-08-05 10:13:54,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-08-05 10:13:54,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1122 transitions. [2019-08-05 10:13:54,143 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1122 transitions. Word has length 12 [2019-08-05 10:13:54,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:54,144 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 1122 transitions. [2019-08-05 10:13:54,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:54,144 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1122 transitions. [2019-08-05 10:13:54,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:13:54,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:54,145 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:54,145 INFO L418 AbstractCegarLoop]: === Iteration 14 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:54,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:54,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2019-08-05 10:13:54,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:54,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:54,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:54,529 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:13:54,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:54,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:54,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:54,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:54,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:54,531 INFO L87 Difference]: Start difference. First operand 462 states and 1122 transitions. Second operand 8 states. [2019-08-05 10:13:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:56,366 INFO L93 Difference]: Finished difference Result 945 states and 2174 transitions. [2019-08-05 10:13:56,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:13:56,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:13:56,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:56,372 INFO L225 Difference]: With dead ends: 945 [2019-08-05 10:13:56,372 INFO L226 Difference]: Without dead ends: 945 [2019-08-05 10:13:56,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:13:56,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-08-05 10:13:56,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 483. [2019-08-05 10:13:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-08-05 10:13:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 1177 transitions. [2019-08-05 10:13:56,385 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 1177 transitions. Word has length 12 [2019-08-05 10:13:56,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:56,386 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 1177 transitions. [2019-08-05 10:13:56,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:56,386 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 1177 transitions. [2019-08-05 10:13:56,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:13:56,387 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:56,387 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:56,387 INFO L418 AbstractCegarLoop]: === Iteration 15 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:56,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:56,388 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2019-08-05 10:13:56,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:56,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:56,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:56,542 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:13:56,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:56,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:56,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:56,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:56,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:56,544 INFO L87 Difference]: Start difference. First operand 483 states and 1177 transitions. Second operand 8 states. [2019-08-05 10:13:58,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:13:58,419 INFO L93 Difference]: Finished difference Result 1169 states and 2718 transitions. [2019-08-05 10:13:58,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:13:58,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:13:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:13:58,425 INFO L225 Difference]: With dead ends: 1169 [2019-08-05 10:13:58,425 INFO L226 Difference]: Without dead ends: 1169 [2019-08-05 10:13:58,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:13:58,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2019-08-05 10:13:58,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 697. [2019-08-05 10:13:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-08-05 10:13:58,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1710 transitions. [2019-08-05 10:13:58,441 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1710 transitions. Word has length 12 [2019-08-05 10:13:58,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:13:58,441 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 1710 transitions. [2019-08-05 10:13:58,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:13:58,442 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1710 transitions. [2019-08-05 10:13:58,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:13:58,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:13:58,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:13:58,443 INFO L418 AbstractCegarLoop]: === Iteration 16 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:13:58,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:13:58,443 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2019-08-05 10:13:58,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:13:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:13:58,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:13:58,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:13:58,616 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:13:58,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:13:58,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:13:58,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:13:58,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:13:58,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:13:58,617 INFO L87 Difference]: Start difference. First operand 697 states and 1710 transitions. Second operand 8 states. [2019-08-05 10:14:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:00,312 INFO L93 Difference]: Finished difference Result 1231 states and 2836 transitions. [2019-08-05 10:14:00,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:14:00,313 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:14:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:00,319 INFO L225 Difference]: With dead ends: 1231 [2019-08-05 10:14:00,319 INFO L226 Difference]: Without dead ends: 1231 [2019-08-05 10:14:00,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:14:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2019-08-05 10:14:00,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 709. [2019-08-05 10:14:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-08-05 10:14:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1740 transitions. [2019-08-05 10:14:00,336 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1740 transitions. Word has length 12 [2019-08-05 10:14:00,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:00,336 INFO L475 AbstractCegarLoop]: Abstraction has 709 states and 1740 transitions. [2019-08-05 10:14:00,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1740 transitions. [2019-08-05 10:14:00,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:14:00,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:00,338 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:00,338 INFO L418 AbstractCegarLoop]: === Iteration 17 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:00,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:00,338 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2019-08-05 10:14:00,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:00,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:14:00,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:00,471 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:14:00,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:00,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:00,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:00,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:00,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:00,472 INFO L87 Difference]: Start difference. First operand 709 states and 1740 transitions. Second operand 8 states. [2019-08-05 10:14:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:02,753 INFO L93 Difference]: Finished difference Result 1376 states and 3224 transitions. [2019-08-05 10:14:02,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:14:02,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:14:02,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:02,761 INFO L225 Difference]: With dead ends: 1376 [2019-08-05 10:14:02,762 INFO L226 Difference]: Without dead ends: 1376 [2019-08-05 10:14:02,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=632, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:14:02,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2019-08-05 10:14:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 756. [2019-08-05 10:14:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2019-08-05 10:14:02,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1867 transitions. [2019-08-05 10:14:02,778 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1867 transitions. Word has length 12 [2019-08-05 10:14:02,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:02,779 INFO L475 AbstractCegarLoop]: Abstraction has 756 states and 1867 transitions. [2019-08-05 10:14:02,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:02,779 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1867 transitions. [2019-08-05 10:14:02,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:14:02,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:02,780 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:02,781 INFO L418 AbstractCegarLoop]: === Iteration 18 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:02,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:02,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2019-08-05 10:14:02,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:02,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:14:02,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:02,945 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:14:02,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:02,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:02,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:02,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:02,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:02,946 INFO L87 Difference]: Start difference. First operand 756 states and 1867 transitions. Second operand 8 states. [2019-08-05 10:14:04,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:04,546 INFO L93 Difference]: Finished difference Result 1294 states and 2987 transitions. [2019-08-05 10:14:04,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:14:04,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:14:04,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:04,554 INFO L225 Difference]: With dead ends: 1294 [2019-08-05 10:14:04,554 INFO L226 Difference]: Without dead ends: 1294 [2019-08-05 10:14:04,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:14:04,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2019-08-05 10:14:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 799. [2019-08-05 10:14:04,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-08-05 10:14:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1966 transitions. [2019-08-05 10:14:04,572 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1966 transitions. Word has length 12 [2019-08-05 10:14:04,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:04,572 INFO L475 AbstractCegarLoop]: Abstraction has 799 states and 1966 transitions. [2019-08-05 10:14:04,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1966 transitions. [2019-08-05 10:14:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:14:04,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:04,573 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:04,574 INFO L418 AbstractCegarLoop]: === Iteration 19 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:04,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:04,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2019-08-05 10:14:04,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:04,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:14:04,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:04,646 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:14:04,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:04,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:04,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:04,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:04,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:04,649 INFO L87 Difference]: Start difference. First operand 799 states and 1966 transitions. Second operand 8 states. [2019-08-05 10:14:07,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:07,021 INFO L93 Difference]: Finished difference Result 1532 states and 3571 transitions. [2019-08-05 10:14:07,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:14:07,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:14:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:07,029 INFO L225 Difference]: With dead ends: 1532 [2019-08-05 10:14:07,030 INFO L226 Difference]: Without dead ends: 1532 [2019-08-05 10:14:07,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:14:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-08-05 10:14:07,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 762. [2019-08-05 10:14:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2019-08-05 10:14:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1879 transitions. [2019-08-05 10:14:07,049 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1879 transitions. Word has length 12 [2019-08-05 10:14:07,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:07,049 INFO L475 AbstractCegarLoop]: Abstraction has 762 states and 1879 transitions. [2019-08-05 10:14:07,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1879 transitions. [2019-08-05 10:14:07,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:14:07,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:07,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:07,051 INFO L418 AbstractCegarLoop]: === Iteration 20 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:07,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:07,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2019-08-05 10:14:07,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:07,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:14:07,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:07,185 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:14:07,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:07,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:07,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:07,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:07,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:07,187 INFO L87 Difference]: Start difference. First operand 762 states and 1879 transitions. Second operand 8 states. [2019-08-05 10:14:07,679 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:14:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:09,792 INFO L93 Difference]: Finished difference Result 1485 states and 3491 transitions. [2019-08-05 10:14:09,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:14:09,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:14:09,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:09,802 INFO L225 Difference]: With dead ends: 1485 [2019-08-05 10:14:09,802 INFO L226 Difference]: Without dead ends: 1485 [2019-08-05 10:14:09,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:14:09,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2019-08-05 10:14:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 780. [2019-08-05 10:14:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-08-05 10:14:09,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1919 transitions. [2019-08-05 10:14:09,819 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1919 transitions. Word has length 12 [2019-08-05 10:14:09,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:09,819 INFO L475 AbstractCegarLoop]: Abstraction has 780 states and 1919 transitions. [2019-08-05 10:14:09,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:09,819 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1919 transitions. [2019-08-05 10:14:09,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:14:09,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:09,820 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:09,821 INFO L418 AbstractCegarLoop]: === Iteration 21 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:09,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:09,821 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2019-08-05 10:14:09,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:09,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:14:09,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:09,896 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:14:09,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:09,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:09,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:09,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:09,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:09,897 INFO L87 Difference]: Start difference. First operand 780 states and 1919 transitions. Second operand 8 states. [2019-08-05 10:14:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:11,201 INFO L93 Difference]: Finished difference Result 1058 states and 2483 transitions. [2019-08-05 10:14:11,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:14:11,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:14:11,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:11,208 INFO L225 Difference]: With dead ends: 1058 [2019-08-05 10:14:11,208 INFO L226 Difference]: Without dead ends: 1058 [2019-08-05 10:14:11,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:14:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2019-08-05 10:14:11,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 783. [2019-08-05 10:14:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-08-05 10:14:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1927 transitions. [2019-08-05 10:14:11,223 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1927 transitions. Word has length 12 [2019-08-05 10:14:11,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:11,223 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1927 transitions. [2019-08-05 10:14:11,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:11,224 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1927 transitions. [2019-08-05 10:14:11,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:14:11,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:11,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:11,225 INFO L418 AbstractCegarLoop]: === Iteration 22 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:11,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:11,225 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2019-08-05 10:14:11,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:11,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:14:11,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:11,300 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:14:11,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:11,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:11,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:11,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:11,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:11,301 INFO L87 Difference]: Start difference. First operand 783 states and 1927 transitions. Second operand 8 states. [2019-08-05 10:14:13,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:13,357 INFO L93 Difference]: Finished difference Result 1295 states and 3071 transitions. [2019-08-05 10:14:13,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:14:13,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:14:13,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:13,363 INFO L225 Difference]: With dead ends: 1295 [2019-08-05 10:14:13,363 INFO L226 Difference]: Without dead ends: 1295 [2019-08-05 10:14:13,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:14:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2019-08-05 10:14:13,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 746. [2019-08-05 10:14:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-08-05 10:14:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1840 transitions. [2019-08-05 10:14:13,375 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1840 transitions. Word has length 12 [2019-08-05 10:14:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:13,375 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1840 transitions. [2019-08-05 10:14:13,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:13,375 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1840 transitions. [2019-08-05 10:14:13,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:14:13,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:13,376 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:13,377 INFO L418 AbstractCegarLoop]: === Iteration 23 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:13,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:13,377 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2019-08-05 10:14:13,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:13,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:14:13,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:13,480 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:14:13,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:13,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:13,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:13,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:13,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:13,482 INFO L87 Difference]: Start difference. First operand 746 states and 1840 transitions. Second operand 8 states. [2019-08-05 10:14:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:15,629 INFO L93 Difference]: Finished difference Result 1428 states and 3394 transitions. [2019-08-05 10:14:15,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:14:15,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:14:15,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:15,634 INFO L225 Difference]: With dead ends: 1428 [2019-08-05 10:14:15,634 INFO L226 Difference]: Without dead ends: 1428 [2019-08-05 10:14:15,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:14:15,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-08-05 10:14:15,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 740. [2019-08-05 10:14:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-08-05 10:14:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1828 transitions. [2019-08-05 10:14:15,651 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1828 transitions. Word has length 12 [2019-08-05 10:14:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:15,652 INFO L475 AbstractCegarLoop]: Abstraction has 740 states and 1828 transitions. [2019-08-05 10:14:15,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1828 transitions. [2019-08-05 10:14:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:14:15,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:15,653 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:15,653 INFO L418 AbstractCegarLoop]: === Iteration 24 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:15,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:15,654 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2019-08-05 10:14:15,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:15,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:14:15,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:15,737 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:14:15,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:14:15,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 10:14:15,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:14:15,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:14:15,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:14:15,739 INFO L87 Difference]: Start difference. First operand 740 states and 1828 transitions. Second operand 8 states. [2019-08-05 10:14:17,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:17,523 INFO L93 Difference]: Finished difference Result 1450 states and 3475 transitions. [2019-08-05 10:14:17,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:14:17,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 10:14:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:17,528 INFO L225 Difference]: With dead ends: 1450 [2019-08-05 10:14:17,528 INFO L226 Difference]: Without dead ends: 1450 [2019-08-05 10:14:17,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:14:17,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-08-05 10:14:17,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 795. [2019-08-05 10:14:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-08-05 10:14:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1959 transitions. [2019-08-05 10:14:17,544 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1959 transitions. Word has length 12 [2019-08-05 10:14:17,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:17,544 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1959 transitions. [2019-08-05 10:14:17,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:14:17,544 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1959 transitions. [2019-08-05 10:14:17,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:17,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:17,545 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:17,545 INFO L418 AbstractCegarLoop]: === Iteration 25 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:17,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:17,546 INFO L82 PathProgramCache]: Analyzing trace with hash -987625651, now seen corresponding path program 1 times [2019-08-05 10:14:17,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:17,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:17,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:17,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:17,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:17,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:17,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:17,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:17,675 INFO L87 Difference]: Start difference. First operand 795 states and 1959 transitions. Second operand 10 states. [2019-08-05 10:14:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:19,166 INFO L93 Difference]: Finished difference Result 1415 states and 3419 transitions. [2019-08-05 10:14:19,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:14:19,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:14:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:19,171 INFO L225 Difference]: With dead ends: 1415 [2019-08-05 10:14:19,171 INFO L226 Difference]: Without dead ends: 1415 [2019-08-05 10:14:19,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:14:19,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2019-08-05 10:14:19,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 708. [2019-08-05 10:14:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-08-05 10:14:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1738 transitions. [2019-08-05 10:14:19,188 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1738 transitions. Word has length 16 [2019-08-05 10:14:19,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:19,188 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 1738 transitions. [2019-08-05 10:14:19,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:19,188 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1738 transitions. [2019-08-05 10:14:19,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:19,189 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:19,189 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:19,190 INFO L418 AbstractCegarLoop]: === Iteration 26 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:19,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:19,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1303373677, now seen corresponding path program 1 times [2019-08-05 10:14:19,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:19,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:19,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:19,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:19,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:19,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:19,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:19,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:19,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:19,355 INFO L87 Difference]: Start difference. First operand 708 states and 1738 transitions. Second operand 10 states. [2019-08-05 10:14:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:21,682 INFO L93 Difference]: Finished difference Result 2271 states and 5507 transitions. [2019-08-05 10:14:21,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:14:21,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:14:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:21,689 INFO L225 Difference]: With dead ends: 2271 [2019-08-05 10:14:21,690 INFO L226 Difference]: Without dead ends: 2271 [2019-08-05 10:14:21,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=517, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:14:21,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2019-08-05 10:14:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 827. [2019-08-05 10:14:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-08-05 10:14:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 2076 transitions. [2019-08-05 10:14:21,712 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 2076 transitions. Word has length 16 [2019-08-05 10:14:21,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:21,713 INFO L475 AbstractCegarLoop]: Abstraction has 827 states and 2076 transitions. [2019-08-05 10:14:21,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:21,713 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 2076 transitions. [2019-08-05 10:14:21,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:21,714 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:21,714 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:21,717 INFO L418 AbstractCegarLoop]: === Iteration 27 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:21,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:21,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1922316245, now seen corresponding path program 1 times [2019-08-05 10:14:21,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:21,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:21,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:21,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:21,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:21,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:21,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:21,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:21,987 INFO L87 Difference]: Start difference. First operand 827 states and 2076 transitions. Second operand 10 states. [2019-08-05 10:14:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:24,908 INFO L93 Difference]: Finished difference Result 1841 states and 4404 transitions. [2019-08-05 10:14:24,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:14:24,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:14:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:24,914 INFO L225 Difference]: With dead ends: 1841 [2019-08-05 10:14:24,914 INFO L226 Difference]: Without dead ends: 1841 [2019-08-05 10:14:24,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=374, Invalid=958, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:14:24,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2019-08-05 10:14:24,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 833. [2019-08-05 10:14:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-08-05 10:14:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 2091 transitions. [2019-08-05 10:14:24,935 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 2091 transitions. Word has length 16 [2019-08-05 10:14:24,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:24,936 INFO L475 AbstractCegarLoop]: Abstraction has 833 states and 2091 transitions. [2019-08-05 10:14:24,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 2091 transitions. [2019-08-05 10:14:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:24,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:24,937 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:24,938 INFO L418 AbstractCegarLoop]: === Iteration 28 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:24,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:24,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1925116599, now seen corresponding path program 1 times [2019-08-05 10:14:24,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:24,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:24,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:25,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:25,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:25,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:25,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:25,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:25,115 INFO L87 Difference]: Start difference. First operand 833 states and 2091 transitions. Second operand 10 states. [2019-08-05 10:14:27,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:27,836 INFO L93 Difference]: Finished difference Result 1717 states and 4102 transitions. [2019-08-05 10:14:27,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:14:27,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:14:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:27,842 INFO L225 Difference]: With dead ends: 1717 [2019-08-05 10:14:27,842 INFO L226 Difference]: Without dead ends: 1717 [2019-08-05 10:14:27,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=561, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:14:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2019-08-05 10:14:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 870. [2019-08-05 10:14:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-08-05 10:14:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 2205 transitions. [2019-08-05 10:14:27,857 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 2205 transitions. Word has length 16 [2019-08-05 10:14:27,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:27,857 INFO L475 AbstractCegarLoop]: Abstraction has 870 states and 2205 transitions. [2019-08-05 10:14:27,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 2205 transitions. [2019-08-05 10:14:27,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:27,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:27,858 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:27,858 INFO L418 AbstractCegarLoop]: === Iteration 29 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:27,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:27,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1925014454, now seen corresponding path program 1 times [2019-08-05 10:14:27,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:27,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:27,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:27,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:27,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:27,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:27,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:27,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:27,942 INFO L87 Difference]: Start difference. First operand 870 states and 2205 transitions. Second operand 10 states. [2019-08-05 10:14:30,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:30,005 INFO L93 Difference]: Finished difference Result 1453 states and 3494 transitions. [2019-08-05 10:14:30,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:14:30,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:14:30,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:30,010 INFO L225 Difference]: With dead ends: 1453 [2019-08-05 10:14:30,010 INFO L226 Difference]: Without dead ends: 1453 [2019-08-05 10:14:30,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:14:30,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2019-08-05 10:14:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 867. [2019-08-05 10:14:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2019-08-05 10:14:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 2186 transitions. [2019-08-05 10:14:30,028 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 2186 transitions. Word has length 16 [2019-08-05 10:14:30,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:30,028 INFO L475 AbstractCegarLoop]: Abstraction has 867 states and 2186 transitions. [2019-08-05 10:14:30,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:30,028 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 2186 transitions. [2019-08-05 10:14:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:30,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:30,030 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:30,030 INFO L418 AbstractCegarLoop]: === Iteration 30 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:30,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:30,031 INFO L82 PathProgramCache]: Analyzing trace with hash 207486896, now seen corresponding path program 1 times [2019-08-05 10:14:30,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:30,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:30,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:30,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:30,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:30,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:30,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:30,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:30,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:30,316 INFO L87 Difference]: Start difference. First operand 867 states and 2186 transitions. Second operand 10 states. [2019-08-05 10:14:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:32,137 INFO L93 Difference]: Finished difference Result 2005 states and 4912 transitions. [2019-08-05 10:14:32,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:14:32,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:14:32,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:32,140 INFO L225 Difference]: With dead ends: 2005 [2019-08-05 10:14:32,140 INFO L226 Difference]: Without dead ends: 2005 [2019-08-05 10:14:32,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=238, Invalid=518, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:14:32,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2019-08-05 10:14:32,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 730. [2019-08-05 10:14:32,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-08-05 10:14:32,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1839 transitions. [2019-08-05 10:14:32,157 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1839 transitions. Word has length 16 [2019-08-05 10:14:32,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:32,158 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1839 transitions. [2019-08-05 10:14:32,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:32,158 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1839 transitions. [2019-08-05 10:14:32,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:32,159 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:32,159 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:32,159 INFO L418 AbstractCegarLoop]: === Iteration 31 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:32,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:32,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1276764270, now seen corresponding path program 1 times [2019-08-05 10:14:32,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:32,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:32,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:32,364 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:14:32,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:32,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:32,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:32,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:32,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:32,365 INFO L87 Difference]: Start difference. First operand 730 states and 1839 transitions. Second operand 10 states. [2019-08-05 10:14:34,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:34,918 INFO L93 Difference]: Finished difference Result 1896 states and 4574 transitions. [2019-08-05 10:14:34,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:14:34,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:14:34,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:34,922 INFO L225 Difference]: With dead ends: 1896 [2019-08-05 10:14:34,922 INFO L226 Difference]: Without dead ends: 1896 [2019-08-05 10:14:34,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=373, Invalid=959, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:14:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-08-05 10:14:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 733. [2019-08-05 10:14:34,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-08-05 10:14:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1845 transitions. [2019-08-05 10:14:34,959 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1845 transitions. Word has length 16 [2019-08-05 10:14:34,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:34,959 INFO L475 AbstractCegarLoop]: Abstraction has 733 states and 1845 transitions. [2019-08-05 10:14:34,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:34,960 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1845 transitions. [2019-08-05 10:14:34,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:34,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:34,961 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:34,961 INFO L418 AbstractCegarLoop]: === Iteration 32 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:34,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:34,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1273963916, now seen corresponding path program 1 times [2019-08-05 10:14:34,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:34,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:34,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:35,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:35,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:35,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:35,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:35,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:35,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:35,054 INFO L87 Difference]: Start difference. First operand 733 states and 1845 transitions. Second operand 10 states. [2019-08-05 10:14:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:37,327 INFO L93 Difference]: Finished difference Result 1659 states and 3985 transitions. [2019-08-05 10:14:37,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:14:37,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:14:37,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:37,330 INFO L225 Difference]: With dead ends: 1659 [2019-08-05 10:14:37,330 INFO L226 Difference]: Without dead ends: 1659 [2019-08-05 10:14:37,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:14:37,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2019-08-05 10:14:37,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 760. [2019-08-05 10:14:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-08-05 10:14:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1925 transitions. [2019-08-05 10:14:37,342 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1925 transitions. Word has length 16 [2019-08-05 10:14:37,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:37,342 INFO L475 AbstractCegarLoop]: Abstraction has 760 states and 1925 transitions. [2019-08-05 10:14:37,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:37,342 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1925 transitions. [2019-08-05 10:14:37,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:37,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:37,343 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:37,344 INFO L418 AbstractCegarLoop]: === Iteration 33 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:37,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:37,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1274066061, now seen corresponding path program 1 times [2019-08-05 10:14:37,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:37,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:37,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:37,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:37,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:37,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:37,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:37,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:37,486 INFO L87 Difference]: Start difference. First operand 760 states and 1925 transitions. Second operand 10 states. [2019-08-05 10:14:39,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:39,120 INFO L93 Difference]: Finished difference Result 1230 states and 2946 transitions. [2019-08-05 10:14:39,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:14:39,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:14:39,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:39,123 INFO L225 Difference]: With dead ends: 1230 [2019-08-05 10:14:39,123 INFO L226 Difference]: Without dead ends: 1230 [2019-08-05 10:14:39,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:14:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-08-05 10:14:39,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 730. [2019-08-05 10:14:39,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-08-05 10:14:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1839 transitions. [2019-08-05 10:14:39,134 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1839 transitions. Word has length 16 [2019-08-05 10:14:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:39,134 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1839 transitions. [2019-08-05 10:14:39,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1839 transitions. [2019-08-05 10:14:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:39,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:39,135 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:39,135 INFO L418 AbstractCegarLoop]: === Iteration 34 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:39,136 INFO L82 PathProgramCache]: Analyzing trace with hash 91368871, now seen corresponding path program 1 times [2019-08-05 10:14:39,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:39,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:39,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:39,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:39,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:39,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:39,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:39,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:39,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:39,378 INFO L87 Difference]: Start difference. First operand 730 states and 1839 transitions. Second operand 10 states. [2019-08-05 10:14:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:41,719 INFO L93 Difference]: Finished difference Result 1812 states and 4393 transitions. [2019-08-05 10:14:41,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:14:41,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:14:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:41,722 INFO L225 Difference]: With dead ends: 1812 [2019-08-05 10:14:41,722 INFO L226 Difference]: Without dead ends: 1812 [2019-08-05 10:14:41,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:14:41,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2019-08-05 10:14:41,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 727. [2019-08-05 10:14:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2019-08-05 10:14:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1834 transitions. [2019-08-05 10:14:41,734 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1834 transitions. Word has length 16 [2019-08-05 10:14:41,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:41,734 INFO L475 AbstractCegarLoop]: Abstraction has 727 states and 1834 transitions. [2019-08-05 10:14:41,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1834 transitions. [2019-08-05 10:14:41,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:41,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:41,736 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:41,736 INFO L418 AbstractCegarLoop]: === Iteration 35 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:41,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:41,736 INFO L82 PathProgramCache]: Analyzing trace with hash 88568517, now seen corresponding path program 1 times [2019-08-05 10:14:41,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:41,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:41,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:41,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:41,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:41,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:41,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:41,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:41,818 INFO L87 Difference]: Start difference. First operand 727 states and 1834 transitions. Second operand 10 states. [2019-08-05 10:14:42,818 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-08-05 10:14:44,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:44,741 INFO L93 Difference]: Finished difference Result 1871 states and 4491 transitions. [2019-08-05 10:14:44,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:14:44,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:14:44,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:44,745 INFO L225 Difference]: With dead ends: 1871 [2019-08-05 10:14:44,745 INFO L226 Difference]: Without dead ends: 1871 [2019-08-05 10:14:44,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=319, Invalid=737, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:14:44,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2019-08-05 10:14:44,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 770. [2019-08-05 10:14:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-08-05 10:14:44,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1959 transitions. [2019-08-05 10:14:44,758 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1959 transitions. Word has length 16 [2019-08-05 10:14:44,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:44,758 INFO L475 AbstractCegarLoop]: Abstraction has 770 states and 1959 transitions. [2019-08-05 10:14:44,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:44,758 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1959 transitions. [2019-08-05 10:14:44,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:44,759 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:44,759 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:44,759 INFO L418 AbstractCegarLoop]: === Iteration 36 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:44,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:44,759 INFO L82 PathProgramCache]: Analyzing trace with hash 88670662, now seen corresponding path program 1 times [2019-08-05 10:14:44,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:44,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:44,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:44,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:44,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:44,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:44,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:44,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:44,836 INFO L87 Difference]: Start difference. First operand 770 states and 1959 transitions. Second operand 10 states. [2019-08-05 10:14:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:46,753 INFO L93 Difference]: Finished difference Result 1385 states and 3291 transitions. [2019-08-05 10:14:46,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:14:46,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:14:46,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:46,756 INFO L225 Difference]: With dead ends: 1385 [2019-08-05 10:14:46,756 INFO L226 Difference]: Without dead ends: 1385 [2019-08-05 10:14:46,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:14:46,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2019-08-05 10:14:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 736. [2019-08-05 10:14:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-08-05 10:14:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1856 transitions. [2019-08-05 10:14:46,768 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1856 transitions. Word has length 16 [2019-08-05 10:14:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:46,768 INFO L475 AbstractCegarLoop]: Abstraction has 736 states and 1856 transitions. [2019-08-05 10:14:46,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1856 transitions. [2019-08-05 10:14:46,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:46,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:46,769 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:46,769 INFO L418 AbstractCegarLoop]: === Iteration 37 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:46,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:46,769 INFO L82 PathProgramCache]: Analyzing trace with hash 385942279, now seen corresponding path program 1 times [2019-08-05 10:14:46,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:46,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:46,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:46,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:46,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:46,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:46,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:46,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:46,879 INFO L87 Difference]: Start difference. First operand 736 states and 1856 transitions. Second operand 10 states. [2019-08-05 10:14:49,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:49,225 INFO L93 Difference]: Finished difference Result 1623 states and 3902 transitions. [2019-08-05 10:14:49,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:14:49,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:14:49,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:49,228 INFO L225 Difference]: With dead ends: 1623 [2019-08-05 10:14:49,228 INFO L226 Difference]: Without dead ends: 1623 [2019-08-05 10:14:49,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:14:49,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2019-08-05 10:14:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 649. [2019-08-05 10:14:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-08-05 10:14:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1618 transitions. [2019-08-05 10:14:49,240 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1618 transitions. Word has length 16 [2019-08-05 10:14:49,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:49,240 INFO L475 AbstractCegarLoop]: Abstraction has 649 states and 1618 transitions. [2019-08-05 10:14:49,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1618 transitions. [2019-08-05 10:14:49,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:49,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:49,242 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:49,242 INFO L418 AbstractCegarLoop]: === Iteration 38 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:49,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:49,242 INFO L82 PathProgramCache]: Analyzing trace with hash 386044424, now seen corresponding path program 1 times [2019-08-05 10:14:49,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:49,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:49,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:49,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:49,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:49,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:49,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:49,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:49,379 INFO L87 Difference]: Start difference. First operand 649 states and 1618 transitions. Second operand 10 states. [2019-08-05 10:14:51,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:51,228 INFO L93 Difference]: Finished difference Result 1299 states and 3067 transitions. [2019-08-05 10:14:51,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:14:51,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:14:51,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:51,230 INFO L225 Difference]: With dead ends: 1299 [2019-08-05 10:14:51,231 INFO L226 Difference]: Without dead ends: 1299 [2019-08-05 10:14:51,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:14:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2019-08-05 10:14:51,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 637. [2019-08-05 10:14:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-08-05 10:14:51,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1588 transitions. [2019-08-05 10:14:51,240 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1588 transitions. Word has length 16 [2019-08-05 10:14:51,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:51,240 INFO L475 AbstractCegarLoop]: Abstraction has 637 states and 1588 transitions. [2019-08-05 10:14:51,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1588 transitions. [2019-08-05 10:14:51,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:51,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:51,241 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:51,242 INFO L418 AbstractCegarLoop]: === Iteration 39 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:51,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:51,242 INFO L82 PathProgramCache]: Analyzing trace with hash 394958660, now seen corresponding path program 1 times [2019-08-05 10:14:51,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:51,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:51,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:51,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:51,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:51,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:51,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:51,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:51,329 INFO L87 Difference]: Start difference. First operand 637 states and 1588 transitions. Second operand 10 states. [2019-08-05 10:14:53,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:53,274 INFO L93 Difference]: Finished difference Result 1148 states and 2747 transitions. [2019-08-05 10:14:53,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:14:53,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:14:53,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:53,276 INFO L225 Difference]: With dead ends: 1148 [2019-08-05 10:14:53,276 INFO L226 Difference]: Without dead ends: 1148 [2019-08-05 10:14:53,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:14:53,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-08-05 10:14:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 298. [2019-08-05 10:14:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-08-05 10:14:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 699 transitions. [2019-08-05 10:14:53,283 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 699 transitions. Word has length 16 [2019-08-05 10:14:53,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:53,283 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 699 transitions. [2019-08-05 10:14:53,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 699 transitions. [2019-08-05 10:14:53,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:53,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:53,283 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:53,284 INFO L418 AbstractCegarLoop]: === Iteration 40 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:53,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:53,284 INFO L82 PathProgramCache]: Analyzing trace with hash -884179606, now seen corresponding path program 1 times [2019-08-05 10:14:53,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:53,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:53,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:53,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:53,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:53,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:53,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:53,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:53,336 INFO L87 Difference]: Start difference. First operand 298 states and 699 transitions. Second operand 10 states. [2019-08-05 10:14:55,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:55,231 INFO L93 Difference]: Finished difference Result 583 states and 1322 transitions. [2019-08-05 10:14:55,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:14:55,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:14:55,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:55,233 INFO L225 Difference]: With dead ends: 583 [2019-08-05 10:14:55,233 INFO L226 Difference]: Without dead ends: 583 [2019-08-05 10:14:55,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:14:55,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-08-05 10:14:55,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 287. [2019-08-05 10:14:55,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-08-05 10:14:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 665 transitions. [2019-08-05 10:14:55,239 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 665 transitions. Word has length 16 [2019-08-05 10:14:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:55,239 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 665 transitions. [2019-08-05 10:14:55,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:55,239 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 665 transitions. [2019-08-05 10:14:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:55,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:55,240 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:55,241 INFO L418 AbstractCegarLoop]: === Iteration 41 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:55,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:55,241 INFO L82 PathProgramCache]: Analyzing trace with hash -886878094, now seen corresponding path program 1 times [2019-08-05 10:14:55,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:55,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:55,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:55,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:55,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:55,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:55,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:55,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:55,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:55,357 INFO L87 Difference]: Start difference. First operand 287 states and 665 transitions. Second operand 10 states. [2019-08-05 10:14:57,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:57,331 INFO L93 Difference]: Finished difference Result 619 states and 1366 transitions. [2019-08-05 10:14:57,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:14:57,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:14:57,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:57,333 INFO L225 Difference]: With dead ends: 619 [2019-08-05 10:14:57,333 INFO L226 Difference]: Without dead ends: 619 [2019-08-05 10:14:57,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=337, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:14:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-08-05 10:14:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 291. [2019-08-05 10:14:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-08-05 10:14:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 675 transitions. [2019-08-05 10:14:57,338 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 675 transitions. Word has length 16 [2019-08-05 10:14:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:57,338 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 675 transitions. [2019-08-05 10:14:57,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:57,339 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 675 transitions. [2019-08-05 10:14:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:57,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:57,339 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:57,339 INFO L418 AbstractCegarLoop]: === Iteration 42 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:57,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:57,340 INFO L82 PathProgramCache]: Analyzing trace with hash -886877815, now seen corresponding path program 1 times [2019-08-05 10:14:57,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:57,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:57,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:14:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:14:57,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:14:57,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:14:57,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:14:57,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:14:57,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:14:57,415 INFO L87 Difference]: Start difference. First operand 291 states and 675 transitions. Second operand 10 states. [2019-08-05 10:14:59,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:14:59,924 INFO L93 Difference]: Finished difference Result 665 states and 1507 transitions. [2019-08-05 10:14:59,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:14:59,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:14:59,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:14:59,926 INFO L225 Difference]: With dead ends: 665 [2019-08-05 10:14:59,926 INFO L226 Difference]: Without dead ends: 665 [2019-08-05 10:14:59,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:14:59,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-08-05 10:14:59,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 257. [2019-08-05 10:14:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-08-05 10:14:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 588 transitions. [2019-08-05 10:14:59,932 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 588 transitions. Word has length 16 [2019-08-05 10:14:59,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:14:59,932 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 588 transitions. [2019-08-05 10:14:59,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:14:59,932 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 588 transitions. [2019-08-05 10:14:59,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:14:59,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:14:59,933 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:14:59,934 INFO L418 AbstractCegarLoop]: === Iteration 43 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:14:59,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:14:59,934 INFO L82 PathProgramCache]: Analyzing trace with hash 344711637, now seen corresponding path program 1 times [2019-08-05 10:14:59,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:14:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:14:59,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:14:59,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:00,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:00,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:00,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:15:00,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:15:00,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:15:00,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:00,433 INFO L87 Difference]: Start difference. First operand 257 states and 588 transitions. Second operand 10 states. [2019-08-05 10:15:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:02,465 INFO L93 Difference]: Finished difference Result 634 states and 1404 transitions. [2019-08-05 10:15:02,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:15:02,465 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:15:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:02,466 INFO L225 Difference]: With dead ends: 634 [2019-08-05 10:15:02,467 INFO L226 Difference]: Without dead ends: 634 [2019-08-05 10:15:02,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:15:02,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-08-05 10:15:02,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 277. [2019-08-05 10:15:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-08-05 10:15:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 633 transitions. [2019-08-05 10:15:02,472 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 633 transitions. Word has length 16 [2019-08-05 10:15:02,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:02,472 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 633 transitions. [2019-08-05 10:15:02,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:15:02,472 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 633 transitions. [2019-08-05 10:15:02,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:15:02,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:02,473 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:02,474 INFO L418 AbstractCegarLoop]: === Iteration 44 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:02,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:02,474 INFO L82 PathProgramCache]: Analyzing trace with hash 344711916, now seen corresponding path program 1 times [2019-08-05 10:15:02,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:02,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:15:02,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:02,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:02,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:15:02,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:15:02,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:15:02,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:02,529 INFO L87 Difference]: Start difference. First operand 277 states and 633 transitions. Second operand 10 states. [2019-08-05 10:15:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:05,288 INFO L93 Difference]: Finished difference Result 728 states and 1636 transitions. [2019-08-05 10:15:05,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:15:05,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:15:05,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:05,290 INFO L225 Difference]: With dead ends: 728 [2019-08-05 10:15:05,290 INFO L226 Difference]: Without dead ends: 728 [2019-08-05 10:15:05,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=319, Invalid=737, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:15:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-08-05 10:15:05,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 259. [2019-08-05 10:15:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-08-05 10:15:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 592 transitions. [2019-08-05 10:15:05,296 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 592 transitions. Word has length 16 [2019-08-05 10:15:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:05,296 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 592 transitions. [2019-08-05 10:15:05,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:15:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 592 transitions. [2019-08-05 10:15:05,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:15:05,297 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:05,297 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:05,297 INFO L418 AbstractCegarLoop]: === Iteration 45 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:05,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:05,298 INFO L82 PathProgramCache]: Analyzing trace with hash 348591473, now seen corresponding path program 1 times [2019-08-05 10:15:05,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:05,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:15:05,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:05,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:05,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:15:05,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:15:05,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:15:05,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:05,373 INFO L87 Difference]: Start difference. First operand 259 states and 592 transitions. Second operand 10 states. [2019-08-05 10:15:07,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:07,905 INFO L93 Difference]: Finished difference Result 705 states and 1605 transitions. [2019-08-05 10:15:07,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:15:07,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:15:07,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:07,907 INFO L225 Difference]: With dead ends: 705 [2019-08-05 10:15:07,907 INFO L226 Difference]: Without dead ends: 705 [2019-08-05 10:15:07,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:15:07,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-08-05 10:15:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 253. [2019-08-05 10:15:07,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-08-05 10:15:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 578 transitions. [2019-08-05 10:15:07,913 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 578 transitions. Word has length 16 [2019-08-05 10:15:07,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:07,913 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 578 transitions. [2019-08-05 10:15:07,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:15:07,913 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 578 transitions. [2019-08-05 10:15:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:15:07,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:07,914 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:07,914 INFO L418 AbstractCegarLoop]: === Iteration 46 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:07,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:07,915 INFO L82 PathProgramCache]: Analyzing trace with hash -353600118, now seen corresponding path program 1 times [2019-08-05 10:15:07,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:07,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:15:07,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:07,985 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:15:07,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:07,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:15:07,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:15:07,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:15:07,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:07,987 INFO L87 Difference]: Start difference. First operand 253 states and 578 transitions. Second operand 10 states. [2019-08-05 10:15:09,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:09,628 INFO L93 Difference]: Finished difference Result 502 states and 1107 transitions. [2019-08-05 10:15:09,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:15:09,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:15:09,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:09,629 INFO L225 Difference]: With dead ends: 502 [2019-08-05 10:15:09,629 INFO L226 Difference]: Without dead ends: 502 [2019-08-05 10:15:09,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:15:09,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-08-05 10:15:09,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 292. [2019-08-05 10:15:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-08-05 10:15:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 665 transitions. [2019-08-05 10:15:09,634 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 665 transitions. Word has length 16 [2019-08-05 10:15:09,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:09,635 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 665 transitions. [2019-08-05 10:15:09,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:15:09,635 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 665 transitions. [2019-08-05 10:15:09,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:15:09,635 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:09,635 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:09,635 INFO L418 AbstractCegarLoop]: === Iteration 47 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:09,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:09,636 INFO L82 PathProgramCache]: Analyzing trace with hash -353599839, now seen corresponding path program 1 times [2019-08-05 10:15:09,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:09,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:15:09,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:09,689 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:15:09,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:09,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:15:09,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:15:09,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:15:09,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:09,690 INFO L87 Difference]: Start difference. First operand 292 states and 665 transitions. Second operand 10 states. [2019-08-05 10:15:11,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:11,876 INFO L93 Difference]: Finished difference Result 625 states and 1396 transitions. [2019-08-05 10:15:11,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:15:11,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:15:11,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:11,878 INFO L225 Difference]: With dead ends: 625 [2019-08-05 10:15:11,878 INFO L226 Difference]: Without dead ends: 625 [2019-08-05 10:15:11,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:15:11,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-08-05 10:15:11,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 274. [2019-08-05 10:15:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-08-05 10:15:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 624 transitions. [2019-08-05 10:15:11,883 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 624 transitions. Word has length 16 [2019-08-05 10:15:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:11,884 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 624 transitions. [2019-08-05 10:15:11,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:15:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 624 transitions. [2019-08-05 10:15:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:15:11,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:11,884 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:11,884 INFO L418 AbstractCegarLoop]: === Iteration 48 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:11,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:11,885 INFO L82 PathProgramCache]: Analyzing trace with hash -349720282, now seen corresponding path program 1 times [2019-08-05 10:15:11,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:11,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:15:11,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:11,936 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:15:11,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:11,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:15:11,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:15:11,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:15:11,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:11,937 INFO L87 Difference]: Start difference. First operand 274 states and 624 transitions. Second operand 10 states. [2019-08-05 10:15:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:14,429 INFO L93 Difference]: Finished difference Result 675 states and 1517 transitions. [2019-08-05 10:15:14,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:15:14,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:15:14,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:14,431 INFO L225 Difference]: With dead ends: 675 [2019-08-05 10:15:14,431 INFO L226 Difference]: Without dead ends: 675 [2019-08-05 10:15:14,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=373, Invalid=959, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:15:14,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-08-05 10:15:14,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 272. [2019-08-05 10:15:14,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-08-05 10:15:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 620 transitions. [2019-08-05 10:15:14,436 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 620 transitions. Word has length 16 [2019-08-05 10:15:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:14,436 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 620 transitions. [2019-08-05 10:15:14,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:15:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 620 transitions. [2019-08-05 10:15:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:15:14,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:14,440 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:14,440 INFO L418 AbstractCegarLoop]: === Iteration 49 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:14,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:14,441 INFO L82 PathProgramCache]: Analyzing trace with hash -260138745, now seen corresponding path program 1 times [2019-08-05 10:15:14,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:14,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:15:14,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:14,712 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:15:14,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:14,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:15:14,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:15:14,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:15:14,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:14,713 INFO L87 Difference]: Start difference. First operand 272 states and 620 transitions. Second operand 10 states. [2019-08-05 10:15:16,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:16,685 INFO L93 Difference]: Finished difference Result 684 states and 1550 transitions. [2019-08-05 10:15:16,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:15:16,686 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:15:16,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:16,687 INFO L225 Difference]: With dead ends: 684 [2019-08-05 10:15:16,687 INFO L226 Difference]: Without dead ends: 684 [2019-08-05 10:15:16,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=238, Invalid=518, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:15:16,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-08-05 10:15:16,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 286. [2019-08-05 10:15:16,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-08-05 10:15:16,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 650 transitions. [2019-08-05 10:15:16,693 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 650 transitions. Word has length 16 [2019-08-05 10:15:16,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:16,693 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 650 transitions. [2019-08-05 10:15:16,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:15:16,693 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 650 transitions. [2019-08-05 10:15:16,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:15:16,694 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:16,694 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:16,694 INFO L418 AbstractCegarLoop]: === Iteration 50 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:16,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:16,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1302531536, now seen corresponding path program 1 times [2019-08-05 10:15:16,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:16,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:15:16,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:16,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:16,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:16,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:15:16,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:15:16,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:15:16,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:16,800 INFO L87 Difference]: Start difference. First operand 286 states and 650 transitions. Second operand 10 states. [2019-08-05 10:15:19,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:19,006 INFO L93 Difference]: Finished difference Result 980 states and 2250 transitions. [2019-08-05 10:15:19,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:15:19,007 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:15:19,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:19,008 INFO L225 Difference]: With dead ends: 980 [2019-08-05 10:15:19,009 INFO L226 Difference]: Without dead ends: 980 [2019-08-05 10:15:19,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:15:19,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2019-08-05 10:15:19,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 286. [2019-08-05 10:15:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-08-05 10:15:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 650 transitions. [2019-08-05 10:15:19,015 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 650 transitions. Word has length 16 [2019-08-05 10:15:19,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:19,015 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 650 transitions. [2019-08-05 10:15:19,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:15:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 650 transitions. [2019-08-05 10:15:19,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:15:19,016 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:19,016 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:19,016 INFO L418 AbstractCegarLoop]: === Iteration 51 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:19,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:19,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1302531815, now seen corresponding path program 1 times [2019-08-05 10:15:19,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:19,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:15:19,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:19,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:19,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:15:19,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:15:19,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:15:19,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:19,182 INFO L87 Difference]: Start difference. First operand 286 states and 650 transitions. Second operand 10 states. [2019-08-05 10:15:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:21,944 INFO L93 Difference]: Finished difference Result 1215 states and 2797 transitions. [2019-08-05 10:15:21,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:15:21,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:15:21,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:21,946 INFO L225 Difference]: With dead ends: 1215 [2019-08-05 10:15:21,946 INFO L226 Difference]: Without dead ends: 1215 [2019-08-05 10:15:21,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=561, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:15:21,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-08-05 10:15:21,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 268. [2019-08-05 10:15:21,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-08-05 10:15:21,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 609 transitions. [2019-08-05 10:15:21,952 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 609 transitions. Word has length 16 [2019-08-05 10:15:21,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:21,952 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 609 transitions. [2019-08-05 10:15:21,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:15:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 609 transitions. [2019-08-05 10:15:21,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:15:21,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:21,953 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:21,954 INFO L418 AbstractCegarLoop]: === Iteration 52 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:21,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:21,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1306411372, now seen corresponding path program 1 times [2019-08-05 10:15:21,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:21,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:15:21,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:22,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:22,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:15:22,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:15:22,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:15:22,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:22,021 INFO L87 Difference]: Start difference. First operand 268 states and 609 transitions. Second operand 10 states. [2019-08-05 10:15:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:25,065 INFO L93 Difference]: Finished difference Result 1303 states and 3013 transitions. [2019-08-05 10:15:25,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:15:25,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:15:25,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:25,068 INFO L225 Difference]: With dead ends: 1303 [2019-08-05 10:15:25,068 INFO L226 Difference]: Without dead ends: 1303 [2019-08-05 10:15:25,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=374, Invalid=958, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:15:25,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2019-08-05 10:15:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 266. [2019-08-05 10:15:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-08-05 10:15:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 605 transitions. [2019-08-05 10:15:25,074 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 605 transitions. Word has length 16 [2019-08-05 10:15:25,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:25,075 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 605 transitions. [2019-08-05 10:15:25,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:15:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 605 transitions. [2019-08-05 10:15:25,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:15:25,075 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:25,075 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:25,075 INFO L418 AbstractCegarLoop]: === Iteration 53 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:25,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:25,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1395992909, now seen corresponding path program 1 times [2019-08-05 10:15:25,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:25,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:15:25,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:25,122 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:15:25,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:25,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:15:25,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:15:25,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:15:25,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:25,123 INFO L87 Difference]: Start difference. First operand 266 states and 605 transitions. Second operand 10 states. [2019-08-05 10:15:27,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:27,413 INFO L93 Difference]: Finished difference Result 1152 states and 2667 transitions. [2019-08-05 10:15:27,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:15:27,413 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:15:27,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:27,415 INFO L225 Difference]: With dead ends: 1152 [2019-08-05 10:15:27,415 INFO L226 Difference]: Without dead ends: 1152 [2019-08-05 10:15:27,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=517, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:15:27,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2019-08-05 10:15:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 247. [2019-08-05 10:15:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-08-05 10:15:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 563 transitions. [2019-08-05 10:15:27,421 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 563 transitions. Word has length 16 [2019-08-05 10:15:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:27,422 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 563 transitions. [2019-08-05 10:15:27,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:15:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 563 transitions. [2019-08-05 10:15:27,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:15:27,422 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:27,422 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:27,422 INFO L418 AbstractCegarLoop]: === Iteration 54 === [productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:27,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:27,423 INFO L82 PathProgramCache]: Analyzing trace with hash 451559940, now seen corresponding path program 1 times [2019-08-05 10:15:27,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:27,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:15:27,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:27,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:27,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:15:27,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:15:27,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:15:27,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:27,469 INFO L87 Difference]: Start difference. First operand 247 states and 563 transitions. Second operand 10 states. [2019-08-05 10:15:28,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:28,971 INFO L93 Difference]: Finished difference Result 501 states and 1169 transitions. [2019-08-05 10:15:28,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:15:28,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 10:15:28,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:28,972 INFO L225 Difference]: With dead ends: 501 [2019-08-05 10:15:28,972 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:15:28,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:15:28,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:15:28,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:15:28,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:15:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:15:28,973 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2019-08-05 10:15:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:28,974 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:15:28,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:15:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:15:28,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:15:28,980 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:15:28 BoogieIcfgContainer [2019-08-05 10:15:28,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:15:28,981 INFO L168 Benchmark]: Toolchain (without parser) took 125073.64 ms. Allocated memory was 140.5 MB in the beginning and 250.1 MB in the end (delta: 109.6 MB). Free memory was 108.0 MB in the beginning and 157.3 MB in the end (delta: -49.3 MB). Peak memory consumption was 60.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:28,982 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:15:28,983 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.55 ms. Allocated memory is still 140.5 MB. Free memory was 108.0 MB in the beginning and 106.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:28,983 INFO L168 Benchmark]: Boogie Preprocessor took 52.81 ms. Allocated memory is still 140.5 MB. Free memory was 106.2 MB in the beginning and 104.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:28,984 INFO L168 Benchmark]: RCFGBuilder took 907.75 ms. Allocated memory is still 140.5 MB. Free memory was 104.6 MB in the beginning and 79.9 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:28,985 INFO L168 Benchmark]: TraceAbstraction took 124058.99 ms. Allocated memory was 140.5 MB in the beginning and 250.1 MB in the end (delta: 109.6 MB). Free memory was 79.5 MB in the beginning and 157.3 MB in the end (delta: -77.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:28,987 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.55 ms. Allocated memory is still 140.5 MB. Free memory was 108.0 MB in the beginning and 106.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.81 ms. Allocated memory is still 140.5 MB. Free memory was 106.2 MB in the beginning and 104.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 907.75 ms. Allocated memory is still 140.5 MB. Free memory was 104.6 MB in the beginning and 79.9 MB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 124058.99 ms. Allocated memory was 140.5 MB in the beginning and 250.1 MB in the end (delta: 109.6 MB). Free memory was 79.5 MB in the beginning and 157.3 MB in the end (delta: -77.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 229]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 364]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 247]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 294]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 277]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 205]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 284]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 154]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 240]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 54]: 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: 332]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 250]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 222]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 65 locations, 14 error locations. SAFE Result, 124.0s OverallTime, 54 OverallIterations, 2 TraceHistogramMax, 115.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15251 SDtfs, 42587 SDslu, 50868 SDs, 0 SdLazy, 95828 SolverSat, 9774 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 79.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1690 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 1272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6566 ImplicationChecksByTransitivity, 23.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=870occurred in iteration=28, 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.6s AutomataMinimizationTime, 54 MinimizatonAttempts, 31912 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 752 NumberOfCodeBlocks, 752 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 698 ConstructedInterpolants, 0 QuantifiedInterpolants, 44362 SizeOfPredicates, 240 NumberOfNonLiveVariables, 2102 ConjunctsInSsa, 438 ConjunctsInUnsatCore, 54 InterpolantComputations, 24 PerfectInterpolantSequences, 0/72 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...