java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:15:33,658 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:15:33,660 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:15:33,675 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:15:33,675 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:15:33,676 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:15:33,678 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:15:33,680 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:15:33,683 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:15:33,687 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:15:33,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:15:33,689 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:15:33,690 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:15:33,691 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:15:33,694 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:15:33,695 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:15:33,696 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:15:33,703 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:15:33,705 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:15:33,707 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:15:33,709 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:15:33,710 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:15:33,712 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:15:33,713 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:15:33,713 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:15:33,714 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:15:33,715 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:15:33,716 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:15:33,717 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:15:33,719 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:15:33,719 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:15:33,720 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:15:33,720 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:15:33,720 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:15:33,722 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:15:33,723 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:15:33,723 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:15:33,740 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:15:33,740 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:15:33,742 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:15:33,743 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:15:33,743 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:15:33,743 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:15:33,743 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:15:33,743 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:15:33,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:15:33,827 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:15:33,832 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:15:33,834 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:15:33,835 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:15:33,836 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl [2018-07-25 13:15:33,836 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3.mover.bpl' [2018-07-25 13:15:33,940 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:15:33,943 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:15:33,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:15:33,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:15:33,944 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:15:33,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:33" (1/1) ... [2018-07-25 13:15:33,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:33" (1/1) ... [2018-07-25 13:15:34,000 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 13:15:34,000 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 13:15:34,000 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 13:15:34,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:15:34,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:15:34,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:15:34,004 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:15:34,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:33" (1/1) ... [2018-07-25 13:15:34,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:33" (1/1) ... [2018-07-25 13:15:34,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:33" (1/1) ... [2018-07-25 13:15:34,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:33" (1/1) ... [2018-07-25 13:15:34,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:33" (1/1) ... [2018-07-25 13:15:34,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:33" (1/1) ... [2018-07-25 13:15:34,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:33" (1/1) ... [2018-07-25 13:15:34,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:15:34,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:15:34,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:15:34,068 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:15:34,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:33" (1/1) ... [2018-07-25 13:15:34,163 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-07-25 13:15:34,163 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-07-25 13:15:34,163 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-07-25 13:15:34,721 INFO L270 CfgBuilder]: Using library mode [2018-07-25 13:15:34,721 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:15:34 BoogieIcfgContainer [2018-07-25 13:15:34,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:15:34,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:15:34,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:15:34,726 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:15:34,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:15:33" (1/2) ... [2018-07-25 13:15:34,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2decf969 and model type threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:15:34, skipping insertion in model container [2018-07-25 13:15:34,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:15:34" (2/2) ... [2018-07-25 13:15:34,731 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3.mover.bpl [2018-07-25 13:15:34,741 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:15:34,751 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-07-25 13:15:34,801 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:15:34,802 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:15:34,802 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:15:34,803 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:15:34,803 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:15:34,803 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:15:34,803 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:15:34,804 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:15:34,804 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:15:34,824 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-07-25 13:15:34,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:15:34,834 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:34,835 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:15:34,837 INFO L415 AbstractCegarLoop]: === Iteration 1 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:34,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1483933, now seen corresponding path program 1 times [2018-07-25 13:15:34,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:34,995 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:34,995 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:15:35,003 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:15:35,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:15:35,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:15:35,022 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 5 states. [2018-07-25 13:15:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:35,674 INFO L93 Difference]: Finished difference Result 83 states and 244 transitions. [2018-07-25 13:15:35,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:15:35,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 13:15:35,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:35,693 INFO L225 Difference]: With dead ends: 83 [2018-07-25 13:15:35,693 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 13:15:35,697 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:35,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 13:15:35,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2018-07-25 13:15:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 13:15:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 188 transitions. [2018-07-25 13:15:35,759 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 188 transitions. Word has length 4 [2018-07-25 13:15:35,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:35,760 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 188 transitions. [2018-07-25 13:15:35,760 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:15:35,761 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 188 transitions. [2018-07-25 13:15:35,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:15:35,762 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:35,762 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:15:35,763 INFO L415 AbstractCegarLoop]: === Iteration 2 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:35,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1486926, now seen corresponding path program 1 times [2018-07-25 13:15:35,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:35,806 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:35,806 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:15:35,808 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:15:35,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:15:35,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:15:35,810 INFO L87 Difference]: Start difference. First operand 67 states and 188 transitions. Second operand 5 states. [2018-07-25 13:15:36,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:36,220 INFO L93 Difference]: Finished difference Result 141 states and 439 transitions. [2018-07-25 13:15:36,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:15:36,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 13:15:36,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:36,225 INFO L225 Difference]: With dead ends: 141 [2018-07-25 13:15:36,225 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 13:15:36,226 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:36,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 13:15:36,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 95. [2018-07-25 13:15:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 13:15:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 316 transitions. [2018-07-25 13:15:36,273 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 316 transitions. Word has length 4 [2018-07-25 13:15:36,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:36,273 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 316 transitions. [2018-07-25 13:15:36,273 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:15:36,274 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 316 transitions. [2018-07-25 13:15:36,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:15:36,274 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:36,275 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:15:36,277 INFO L415 AbstractCegarLoop]: === Iteration 3 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:36,277 INFO L82 PathProgramCache]: Analyzing trace with hash 951145, now seen corresponding path program 1 times [2018-07-25 13:15:36,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:36,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:36,320 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:36,321 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:15:36,321 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:15:36,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:15:36,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:15:36,322 INFO L87 Difference]: Start difference. First operand 95 states and 316 transitions. Second operand 5 states. [2018-07-25 13:15:36,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:36,677 INFO L93 Difference]: Finished difference Result 161 states and 531 transitions. [2018-07-25 13:15:36,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:15:36,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-07-25 13:15:36,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:36,683 INFO L225 Difference]: With dead ends: 161 [2018-07-25 13:15:36,685 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 13:15:36,686 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:15:36,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 13:15:36,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 115. [2018-07-25 13:15:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 13:15:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 408 transitions. [2018-07-25 13:15:36,738 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 408 transitions. Word has length 4 [2018-07-25 13:15:36,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:36,739 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 408 transitions. [2018-07-25 13:15:36,740 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:15:36,740 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 408 transitions. [2018-07-25 13:15:36,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:36,741 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:36,741 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:36,744 INFO L415 AbstractCegarLoop]: === Iteration 4 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:36,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1424687860, now seen corresponding path program 1 times [2018-07-25 13:15:36,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:36,776 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:36,777 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:36,777 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:36,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:36,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:36,779 INFO L87 Difference]: Start difference. First operand 115 states and 408 transitions. Second operand 7 states. [2018-07-25 13:15:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:37,670 INFO L93 Difference]: Finished difference Result 429 states and 1559 transitions. [2018-07-25 13:15:37,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:15:37,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:37,676 INFO L225 Difference]: With dead ends: 429 [2018-07-25 13:15:37,677 INFO L226 Difference]: Without dead ends: 423 [2018-07-25 13:15:37,678 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:15:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-07-25 13:15:37,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 197. [2018-07-25 13:15:37,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-25 13:15:37,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 815 transitions. [2018-07-25 13:15:37,734 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 815 transitions. Word has length 6 [2018-07-25 13:15:37,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:37,735 INFO L472 AbstractCegarLoop]: Abstraction has 197 states and 815 transitions. [2018-07-25 13:15:37,735 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 815 transitions. [2018-07-25 13:15:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:37,737 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:37,737 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:37,738 INFO L415 AbstractCegarLoop]: === Iteration 5 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:37,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1424687863, now seen corresponding path program 1 times [2018-07-25 13:15:37,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:37,770 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:37,770 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:37,771 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:37,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:37,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:37,772 INFO L87 Difference]: Start difference. First operand 197 states and 815 transitions. Second operand 7 states. [2018-07-25 13:15:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:38,783 INFO L93 Difference]: Finished difference Result 469 states and 1652 transitions. [2018-07-25 13:15:38,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:15:38,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:38,790 INFO L225 Difference]: With dead ends: 469 [2018-07-25 13:15:38,791 INFO L226 Difference]: Without dead ends: 463 [2018-07-25 13:15:38,792 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:15:38,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-07-25 13:15:38,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 221. [2018-07-25 13:15:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-25 13:15:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 931 transitions. [2018-07-25 13:15:38,874 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 931 transitions. Word has length 6 [2018-07-25 13:15:38,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:38,874 INFO L472 AbstractCegarLoop]: Abstraction has 221 states and 931 transitions. [2018-07-25 13:15:38,877 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:38,877 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 931 transitions. [2018-07-25 13:15:38,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:38,879 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:38,879 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:38,882 INFO L415 AbstractCegarLoop]: === Iteration 6 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:38,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1424690216, now seen corresponding path program 1 times [2018-07-25 13:15:38,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:38,913 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:38,913 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:38,914 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:38,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:38,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:38,915 INFO L87 Difference]: Start difference. First operand 221 states and 931 transitions. Second operand 7 states. [2018-07-25 13:15:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:39,776 INFO L93 Difference]: Finished difference Result 425 states and 1563 transitions. [2018-07-25 13:15:39,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:15:39,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:39,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:39,781 INFO L225 Difference]: With dead ends: 425 [2018-07-25 13:15:39,781 INFO L226 Difference]: Without dead ends: 419 [2018-07-25 13:15:39,783 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:15:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-07-25 13:15:39,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 235. [2018-07-25 13:15:39,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-07-25 13:15:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 1000 transitions. [2018-07-25 13:15:39,856 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 1000 transitions. Word has length 6 [2018-07-25 13:15:39,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:39,857 INFO L472 AbstractCegarLoop]: Abstraction has 235 states and 1000 transitions. [2018-07-25 13:15:39,857 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:39,857 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 1000 transitions. [2018-07-25 13:15:39,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:39,859 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:39,859 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:39,860 INFO L415 AbstractCegarLoop]: === Iteration 7 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:39,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1424690219, now seen corresponding path program 1 times [2018-07-25 13:15:39,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:39,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:39,891 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:39,891 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:39,891 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:39,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:39,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:39,892 INFO L87 Difference]: Start difference. First operand 235 states and 1000 transitions. Second operand 7 states. [2018-07-25 13:15:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:40,767 INFO L93 Difference]: Finished difference Result 461 states and 1684 transitions. [2018-07-25 13:15:40,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:15:40,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:40,775 INFO L225 Difference]: With dead ends: 461 [2018-07-25 13:15:40,775 INFO L226 Difference]: Without dead ends: 455 [2018-07-25 13:15:40,776 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:15:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-07-25 13:15:40,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 233. [2018-07-25 13:15:40,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-25 13:15:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 991 transitions. [2018-07-25 13:15:40,859 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 991 transitions. Word has length 6 [2018-07-25 13:15:40,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:40,859 INFO L472 AbstractCegarLoop]: Abstraction has 233 states and 991 transitions. [2018-07-25 13:15:40,859 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 991 transitions. [2018-07-25 13:15:40,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:40,862 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:40,862 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:40,863 INFO L415 AbstractCegarLoop]: === Iteration 8 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:40,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1425662275, now seen corresponding path program 1 times [2018-07-25 13:15:40,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:40,894 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:40,894 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:40,895 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:40,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:40,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:40,896 INFO L87 Difference]: Start difference. First operand 233 states and 991 transitions. Second operand 7 states. [2018-07-25 13:15:41,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:41,759 INFO L93 Difference]: Finished difference Result 532 states and 2077 transitions. [2018-07-25 13:15:41,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:15:41,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:41,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:41,765 INFO L225 Difference]: With dead ends: 532 [2018-07-25 13:15:41,765 INFO L226 Difference]: Without dead ends: 526 [2018-07-25 13:15:41,767 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:15:41,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-07-25 13:15:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 318. [2018-07-25 13:15:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-07-25 13:15:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 1405 transitions. [2018-07-25 13:15:41,859 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 1405 transitions. Word has length 6 [2018-07-25 13:15:41,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:41,860 INFO L472 AbstractCegarLoop]: Abstraction has 318 states and 1405 transitions. [2018-07-25 13:15:41,860 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:41,860 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 1405 transitions. [2018-07-25 13:15:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:41,861 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:41,861 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:41,862 INFO L415 AbstractCegarLoop]: === Iteration 9 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:41,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1425662278, now seen corresponding path program 1 times [2018-07-25 13:15:41,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:41,881 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:41,881 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:41,882 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:41,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:41,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:41,883 INFO L87 Difference]: Start difference. First operand 318 states and 1405 transitions. Second operand 7 states. [2018-07-25 13:15:42,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:42,553 INFO L93 Difference]: Finished difference Result 795 states and 3375 transitions. [2018-07-25 13:15:42,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:15:42,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:42,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:42,559 INFO L225 Difference]: With dead ends: 795 [2018-07-25 13:15:42,560 INFO L226 Difference]: Without dead ends: 478 [2018-07-25 13:15:42,564 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:15:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-07-25 13:15:42,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 344. [2018-07-25 13:15:42,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-07-25 13:15:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1488 transitions. [2018-07-25 13:15:42,689 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 1488 transitions. Word has length 6 [2018-07-25 13:15:42,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:42,690 INFO L472 AbstractCegarLoop]: Abstraction has 344 states and 1488 transitions. [2018-07-25 13:15:42,690 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:42,691 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 1488 transitions. [2018-07-25 13:15:42,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:42,692 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:42,693 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:42,698 INFO L415 AbstractCegarLoop]: === Iteration 10 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:42,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1426082271, now seen corresponding path program 1 times [2018-07-25 13:15:42,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:42,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:42,729 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:42,729 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:42,730 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:42,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:42,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:42,731 INFO L87 Difference]: Start difference. First operand 344 states and 1488 transitions. Second operand 7 states. [2018-07-25 13:15:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:43,580 INFO L93 Difference]: Finished difference Result 559 states and 2201 transitions. [2018-07-25 13:15:43,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:15:43,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:43,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:43,587 INFO L225 Difference]: With dead ends: 559 [2018-07-25 13:15:43,587 INFO L226 Difference]: Without dead ends: 553 [2018-07-25 13:15:43,588 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:15:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2018-07-25 13:15:43,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 350. [2018-07-25 13:15:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-07-25 13:15:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1507 transitions. [2018-07-25 13:15:43,710 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 1507 transitions. Word has length 6 [2018-07-25 13:15:43,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:43,711 INFO L472 AbstractCegarLoop]: Abstraction has 350 states and 1507 transitions. [2018-07-25 13:15:43,711 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:43,711 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 1507 transitions. [2018-07-25 13:15:43,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:43,712 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:43,712 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:43,713 INFO L415 AbstractCegarLoop]: === Iteration 11 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:43,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1426082274, now seen corresponding path program 1 times [2018-07-25 13:15:43,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:43,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:43,740 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:43,740 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:43,741 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:43,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:43,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:43,742 INFO L87 Difference]: Start difference. First operand 350 states and 1507 transitions. Second operand 7 states. [2018-07-25 13:15:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:44,646 INFO L93 Difference]: Finished difference Result 589 states and 2338 transitions. [2018-07-25 13:15:44,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:15:44,647 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:44,653 INFO L225 Difference]: With dead ends: 589 [2018-07-25 13:15:44,654 INFO L226 Difference]: Without dead ends: 583 [2018-07-25 13:15:44,655 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:15:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-07-25 13:15:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 356. [2018-07-25 13:15:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-07-25 13:15:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 1534 transitions. [2018-07-25 13:15:44,798 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 1534 transitions. Word has length 6 [2018-07-25 13:15:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:44,799 INFO L472 AbstractCegarLoop]: Abstraction has 356 states and 1534 transitions. [2018-07-25 13:15:44,799 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 1534 transitions. [2018-07-25 13:15:44,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:44,800 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:44,800 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:44,801 INFO L415 AbstractCegarLoop]: === Iteration 12 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:44,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1411063228, now seen corresponding path program 1 times [2018-07-25 13:15:44,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:44,827 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:44,827 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:44,828 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:44,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:44,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:44,828 INFO L87 Difference]: Start difference. First operand 356 states and 1534 transitions. Second operand 7 states. [2018-07-25 13:15:45,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:45,560 INFO L93 Difference]: Finished difference Result 614 states and 2391 transitions. [2018-07-25 13:15:45,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:15:45,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:45,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:45,567 INFO L225 Difference]: With dead ends: 614 [2018-07-25 13:15:45,567 INFO L226 Difference]: Without dead ends: 608 [2018-07-25 13:15:45,568 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:15:45,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-07-25 13:15:45,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 381. [2018-07-25 13:15:45,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-07-25 13:15:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1666 transitions. [2018-07-25 13:15:45,732 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1666 transitions. Word has length 6 [2018-07-25 13:15:45,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:45,732 INFO L472 AbstractCegarLoop]: Abstraction has 381 states and 1666 transitions. [2018-07-25 13:15:45,732 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1666 transitions. [2018-07-25 13:15:45,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:45,734 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:45,734 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:45,735 INFO L415 AbstractCegarLoop]: === Iteration 13 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:45,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1411063231, now seen corresponding path program 1 times [2018-07-25 13:15:45,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:45,755 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:45,756 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:45,756 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:45,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:45,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:45,757 INFO L87 Difference]: Start difference. First operand 381 states and 1666 transitions. Second operand 7 states. [2018-07-25 13:15:46,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:46,436 INFO L93 Difference]: Finished difference Result 872 states and 3679 transitions. [2018-07-25 13:15:46,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:15:46,436 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:46,442 INFO L225 Difference]: With dead ends: 872 [2018-07-25 13:15:46,442 INFO L226 Difference]: Without dead ends: 492 [2018-07-25 13:15:46,444 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:15:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-07-25 13:15:46,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 406. [2018-07-25 13:15:46,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-07-25 13:15:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1759 transitions. [2018-07-25 13:15:46,615 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 1759 transitions. Word has length 6 [2018-07-25 13:15:46,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:46,615 INFO L472 AbstractCegarLoop]: Abstraction has 406 states and 1759 transitions. [2018-07-25 13:15:46,616 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:46,616 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1759 transitions. [2018-07-25 13:15:46,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:46,617 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:46,617 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:46,618 INFO L415 AbstractCegarLoop]: === Iteration 14 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:46,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1411050270, now seen corresponding path program 1 times [2018-07-25 13:15:46,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:46,642 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:46,642 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:46,643 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:46,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:46,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:46,644 INFO L87 Difference]: Start difference. First operand 406 states and 1759 transitions. Second operand 7 states. [2018-07-25 13:15:47,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:47,541 INFO L93 Difference]: Finished difference Result 642 states and 2484 transitions. [2018-07-25 13:15:47,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:15:47,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:47,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:47,548 INFO L225 Difference]: With dead ends: 642 [2018-07-25 13:15:47,548 INFO L226 Difference]: Without dead ends: 636 [2018-07-25 13:15:47,549 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:15:47,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-07-25 13:15:47,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 394. [2018-07-25 13:15:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-07-25 13:15:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1695 transitions. [2018-07-25 13:15:47,704 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1695 transitions. Word has length 6 [2018-07-25 13:15:47,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:47,705 INFO L472 AbstractCegarLoop]: Abstraction has 394 states and 1695 transitions. [2018-07-25 13:15:47,705 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:47,705 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1695 transitions. [2018-07-25 13:15:47,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:47,706 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:47,706 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:47,707 INFO L415 AbstractCegarLoop]: === Iteration 15 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:47,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1411050273, now seen corresponding path program 1 times [2018-07-25 13:15:47,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:47,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:47,724 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:47,724 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:47,725 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:47,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:47,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:47,725 INFO L87 Difference]: Start difference. First operand 394 states and 1695 transitions. Second operand 7 states. [2018-07-25 13:15:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:48,379 INFO L93 Difference]: Finished difference Result 530 states and 2122 transitions. [2018-07-25 13:15:48,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:15:48,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:48,385 INFO L225 Difference]: With dead ends: 530 [2018-07-25 13:15:48,385 INFO L226 Difference]: Without dead ends: 524 [2018-07-25 13:15:48,386 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:15:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-07-25 13:15:48,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 394. [2018-07-25 13:15:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-07-25 13:15:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1695 transitions. [2018-07-25 13:15:48,549 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1695 transitions. Word has length 6 [2018-07-25 13:15:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:48,550 INFO L472 AbstractCegarLoop]: Abstraction has 394 states and 1695 transitions. [2018-07-25 13:15:48,550 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1695 transitions. [2018-07-25 13:15:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:48,551 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:48,551 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:48,552 INFO L415 AbstractCegarLoop]: === Iteration 16 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:48,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1418574259, now seen corresponding path program 1 times [2018-07-25 13:15:48,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:48,573 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:48,574 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:48,574 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:48,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:48,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:48,575 INFO L87 Difference]: Start difference. First operand 394 states and 1695 transitions. Second operand 7 states. [2018-07-25 13:15:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:49,337 INFO L93 Difference]: Finished difference Result 811 states and 3241 transitions. [2018-07-25 13:15:49,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:15:49,337 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:49,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:49,345 INFO L225 Difference]: With dead ends: 811 [2018-07-25 13:15:49,346 INFO L226 Difference]: Without dead ends: 805 [2018-07-25 13:15:49,347 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:15:49,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-07-25 13:15:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 455. [2018-07-25 13:15:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-07-25 13:15:49,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 2000 transitions. [2018-07-25 13:15:49,540 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 2000 transitions. Word has length 6 [2018-07-25 13:15:49,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:49,541 INFO L472 AbstractCegarLoop]: Abstraction has 455 states and 2000 transitions. [2018-07-25 13:15:49,541 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 2000 transitions. [2018-07-25 13:15:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:49,542 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:49,542 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:49,543 INFO L415 AbstractCegarLoop]: === Iteration 17 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:49,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1418574132, now seen corresponding path program 1 times [2018-07-25 13:15:49,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:49,587 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:49,588 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:49,588 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:49,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:49,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:49,589 INFO L87 Difference]: Start difference. First operand 455 states and 2000 transitions. Second operand 7 states. [2018-07-25 13:15:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:50,332 INFO L93 Difference]: Finished difference Result 829 states and 3301 transitions. [2018-07-25 13:15:50,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:15:50,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:50,341 INFO L225 Difference]: With dead ends: 829 [2018-07-25 13:15:50,341 INFO L226 Difference]: Without dead ends: 823 [2018-07-25 13:15:50,342 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:15:50,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-07-25 13:15:50,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 480. [2018-07-25 13:15:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-07-25 13:15:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 2125 transitions. [2018-07-25 13:15:50,542 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 2125 transitions. Word has length 6 [2018-07-25 13:15:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:50,543 INFO L472 AbstractCegarLoop]: Abstraction has 480 states and 2125 transitions. [2018-07-25 13:15:50,543 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 2125 transitions. [2018-07-25 13:15:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:50,544 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:50,544 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:50,545 INFO L415 AbstractCegarLoop]: === Iteration 18 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:50,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1418562851, now seen corresponding path program 1 times [2018-07-25 13:15:50,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:50,568 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:50,568 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:50,569 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:50,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:50,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:50,570 INFO L87 Difference]: Start difference. First operand 480 states and 2125 transitions. Second operand 7 states. [2018-07-25 13:15:51,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:51,447 INFO L93 Difference]: Finished difference Result 858 states and 3471 transitions. [2018-07-25 13:15:51,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:15:51,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:51,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:51,457 INFO L225 Difference]: With dead ends: 858 [2018-07-25 13:15:51,457 INFO L226 Difference]: Without dead ends: 852 [2018-07-25 13:15:51,458 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:15:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-07-25 13:15:51,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 502. [2018-07-25 13:15:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-07-25 13:15:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 2231 transitions. [2018-07-25 13:15:51,722 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 2231 transitions. Word has length 6 [2018-07-25 13:15:51,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:51,723 INFO L472 AbstractCegarLoop]: Abstraction has 502 states and 2231 transitions. [2018-07-25 13:15:51,723 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:51,723 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 2231 transitions. [2018-07-25 13:15:51,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:51,724 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:51,724 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:51,725 INFO L415 AbstractCegarLoop]: === Iteration 19 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:51,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1418562724, now seen corresponding path program 1 times [2018-07-25 13:15:51,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:51,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:51,755 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:51,755 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:51,756 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:51,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:51,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:51,757 INFO L87 Difference]: Start difference. First operand 502 states and 2231 transitions. Second operand 7 states. [2018-07-25 13:15:52,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:52,462 INFO L93 Difference]: Finished difference Result 868 states and 3505 transitions. [2018-07-25 13:15:52,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:15:52,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:52,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:52,471 INFO L225 Difference]: With dead ends: 868 [2018-07-25 13:15:52,471 INFO L226 Difference]: Without dead ends: 862 [2018-07-25 13:15:52,472 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:15:52,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2018-07-25 13:15:52,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 516. [2018-07-25 13:15:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-07-25 13:15:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 2303 transitions. [2018-07-25 13:15:52,712 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 2303 transitions. Word has length 6 [2018-07-25 13:15:52,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:52,712 INFO L472 AbstractCegarLoop]: Abstraction has 516 states and 2303 transitions. [2018-07-25 13:15:52,712 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:52,713 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 2303 transitions. [2018-07-25 13:15:52,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:52,714 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:52,714 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:52,714 INFO L415 AbstractCegarLoop]: === Iteration 20 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:52,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1428797377, now seen corresponding path program 1 times [2018-07-25 13:15:52,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:52,742 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:52,742 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:52,742 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:52,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:52,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:52,743 INFO L87 Difference]: Start difference. First operand 516 states and 2303 transitions. Second operand 7 states. [2018-07-25 13:15:53,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:53,619 INFO L93 Difference]: Finished difference Result 907 states and 3733 transitions. [2018-07-25 13:15:53,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:15:53,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:53,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:53,628 INFO L225 Difference]: With dead ends: 907 [2018-07-25 13:15:53,628 INFO L226 Difference]: Without dead ends: 901 [2018-07-25 13:15:53,629 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:15:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2018-07-25 13:15:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 520. [2018-07-25 13:15:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-07-25 13:15:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 2319 transitions. [2018-07-25 13:15:53,874 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 2319 transitions. Word has length 6 [2018-07-25 13:15:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:53,875 INFO L472 AbstractCegarLoop]: Abstraction has 520 states and 2319 transitions. [2018-07-25 13:15:53,875 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 2319 transitions. [2018-07-25 13:15:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:53,876 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:53,876 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:53,877 INFO L415 AbstractCegarLoop]: === Iteration 21 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:53,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1428797250, now seen corresponding path program 1 times [2018-07-25 13:15:53,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:53,890 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:53,891 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:53,891 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:53,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:53,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:53,892 INFO L87 Difference]: Start difference. First operand 520 states and 2319 transitions. Second operand 7 states. [2018-07-25 13:15:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:54,573 INFO L93 Difference]: Finished difference Result 773 states and 3271 transitions. [2018-07-25 13:15:54,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:15:54,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:54,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:54,583 INFO L225 Difference]: With dead ends: 773 [2018-07-25 13:15:54,583 INFO L226 Difference]: Without dead ends: 767 [2018-07-25 13:15:54,584 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:15:54,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-07-25 13:15:54,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 593. [2018-07-25 13:15:54,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-07-25 13:15:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 2685 transitions. [2018-07-25 13:15:54,868 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 2685 transitions. Word has length 6 [2018-07-25 13:15:54,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:54,869 INFO L472 AbstractCegarLoop]: Abstraction has 593 states and 2685 transitions. [2018-07-25 13:15:54,869 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:54,869 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 2685 transitions. [2018-07-25 13:15:54,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:54,870 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:54,870 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:54,871 INFO L415 AbstractCegarLoop]: === Iteration 22 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:54,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1428952251, now seen corresponding path program 1 times [2018-07-25 13:15:54,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:54,885 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:54,885 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:54,886 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:54,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:54,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:54,886 INFO L87 Difference]: Start difference. First operand 593 states and 2685 transitions. Second operand 7 states. [2018-07-25 13:15:55,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:55,911 INFO L93 Difference]: Finished difference Result 1183 states and 5111 transitions. [2018-07-25 13:15:55,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:15:55,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:55,927 INFO L225 Difference]: With dead ends: 1183 [2018-07-25 13:15:55,927 INFO L226 Difference]: Without dead ends: 1177 [2018-07-25 13:15:55,928 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:15:55,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2018-07-25 13:15:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 745. [2018-07-25 13:15:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-07-25 13:15:56,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 3444 transitions. [2018-07-25 13:15:56,267 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 3444 transitions. Word has length 6 [2018-07-25 13:15:56,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:56,267 INFO L472 AbstractCegarLoop]: Abstraction has 745 states and 3444 transitions. [2018-07-25 13:15:56,267 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:56,268 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 3444 transitions. [2018-07-25 13:15:56,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:56,269 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:56,269 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:56,269 INFO L415 AbstractCegarLoop]: === Iteration 23 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:56,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1428952254, now seen corresponding path program 1 times [2018-07-25 13:15:56,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:56,286 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:56,286 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:56,287 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:56,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:56,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:56,287 INFO L87 Difference]: Start difference. First operand 745 states and 3444 transitions. Second operand 7 states. [2018-07-25 13:15:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:57,181 INFO L93 Difference]: Finished difference Result 1125 states and 4823 transitions. [2018-07-25 13:15:57,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:15:57,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:57,196 INFO L225 Difference]: With dead ends: 1125 [2018-07-25 13:15:57,196 INFO L226 Difference]: Without dead ends: 1119 [2018-07-25 13:15:57,197 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:15:57,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-07-25 13:15:57,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 749. [2018-07-25 13:15:57,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2018-07-25 13:15:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 3456 transitions. [2018-07-25 13:15:57,596 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 3456 transitions. Word has length 6 [2018-07-25 13:15:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:57,596 INFO L472 AbstractCegarLoop]: Abstraction has 749 states and 3456 transitions. [2018-07-25 13:15:57,597 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 3456 transitions. [2018-07-25 13:15:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:57,598 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:57,598 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-25 13:15:57,599 INFO L415 AbstractCegarLoop]: === Iteration 24 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1428955365, now seen corresponding path program 1 times [2018-07-25 13:15:57,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:57,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:57,605 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:57,605 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 13:15:57,605 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:15:57,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:15:57,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:15:57,609 INFO L87 Difference]: Start difference. First operand 749 states and 3456 transitions. Second operand 4 states. [2018-07-25 13:15:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:57,952 INFO L93 Difference]: Finished difference Result 1227 states and 5516 transitions. [2018-07-25 13:15:57,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:15:57,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-25 13:15:57,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:57,958 INFO L225 Difference]: With dead ends: 1227 [2018-07-25 13:15:57,958 INFO L226 Difference]: Without dead ends: 722 [2018-07-25 13:15:57,959 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:15:57,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-07-25 13:15:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 614. [2018-07-25 13:15:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-07-25 13:15:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 2719 transitions. [2018-07-25 13:15:58,263 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 2719 transitions. Word has length 6 [2018-07-25 13:15:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:58,264 INFO L472 AbstractCegarLoop]: Abstraction has 614 states and 2719 transitions. [2018-07-25 13:15:58,264 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:15:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 2719 transitions. [2018-07-25 13:15:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:58,265 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:58,265 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:58,266 INFO L415 AbstractCegarLoop]: === Iteration 25 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:58,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1418670078, now seen corresponding path program 1 times [2018-07-25 13:15:58,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:58,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:58,281 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:58,281 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:58,282 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:58,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:58,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:58,282 INFO L87 Difference]: Start difference. First operand 614 states and 2719 transitions. Second operand 7 states. [2018-07-25 13:15:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:15:59,137 INFO L93 Difference]: Finished difference Result 1007 states and 4285 transitions. [2018-07-25 13:15:59,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:15:59,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:15:59,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:15:59,145 INFO L225 Difference]: With dead ends: 1007 [2018-07-25 13:15:59,145 INFO L226 Difference]: Without dead ends: 1001 [2018-07-25 13:15:59,146 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:15:59,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2018-07-25 13:15:59,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 649. [2018-07-25 13:15:59,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-07-25 13:15:59,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 2895 transitions. [2018-07-25 13:15:59,394 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 2895 transitions. Word has length 6 [2018-07-25 13:15:59,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:15:59,394 INFO L472 AbstractCegarLoop]: Abstraction has 649 states and 2895 transitions. [2018-07-25 13:15:59,394 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:15:59,394 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 2895 transitions. [2018-07-25 13:15:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:15:59,395 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:15:59,395 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:15:59,396 INFO L415 AbstractCegarLoop]: === Iteration 26 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:15:59,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1418670081, now seen corresponding path program 1 times [2018-07-25 13:15:59,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:15:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:15:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:15:59,413 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:15:59,413 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:15:59,413 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:15:59,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:15:59,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:15:59,414 INFO L87 Difference]: Start difference. First operand 649 states and 2895 transitions. Second operand 7 states. [2018-07-25 13:16:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:00,323 INFO L93 Difference]: Finished difference Result 1057 states and 4428 transitions. [2018-07-25 13:16:00,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:16:00,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:16:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:00,329 INFO L225 Difference]: With dead ends: 1057 [2018-07-25 13:16:00,329 INFO L226 Difference]: Without dead ends: 1051 [2018-07-25 13:16:00,330 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:16:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2018-07-25 13:16:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 643. [2018-07-25 13:16:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-07-25 13:16:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 2867 transitions. [2018-07-25 13:16:00,601 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 2867 transitions. Word has length 6 [2018-07-25 13:16:00,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:00,601 INFO L472 AbstractCegarLoop]: Abstraction has 643 states and 2867 transitions. [2018-07-25 13:16:00,601 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:00,601 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 2867 transitions. [2018-07-25 13:16:00,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:16:00,602 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:00,603 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:16:00,603 INFO L415 AbstractCegarLoop]: === Iteration 27 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:00,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1418672434, now seen corresponding path program 1 times [2018-07-25 13:16:00,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:00,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:00,614 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:00,614 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:16:00,614 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:00,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:00,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:00,615 INFO L87 Difference]: Start difference. First operand 643 states and 2867 transitions. Second operand 7 states. [2018-07-25 13:16:01,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:01,405 INFO L93 Difference]: Finished difference Result 1019 states and 4290 transitions. [2018-07-25 13:16:01,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:01,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:16:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:01,410 INFO L225 Difference]: With dead ends: 1019 [2018-07-25 13:16:01,411 INFO L226 Difference]: Without dead ends: 1013 [2018-07-25 13:16:01,411 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:01,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2018-07-25 13:16:01,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 667. [2018-07-25 13:16:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-07-25 13:16:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2969 transitions. [2018-07-25 13:16:01,698 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 2969 transitions. Word has length 6 [2018-07-25 13:16:01,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:01,698 INFO L472 AbstractCegarLoop]: Abstraction has 667 states and 2969 transitions. [2018-07-25 13:16:01,698 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 2969 transitions. [2018-07-25 13:16:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:16:01,699 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:01,699 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:16:01,700 INFO L415 AbstractCegarLoop]: === Iteration 28 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:01,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1418672437, now seen corresponding path program 1 times [2018-07-25 13:16:01,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:01,717 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:01,717 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:16:01,721 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:01,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:01,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:01,721 INFO L87 Difference]: Start difference. First operand 667 states and 2969 transitions. Second operand 7 states. [2018-07-25 13:16:02,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:02,736 INFO L93 Difference]: Finished difference Result 1100 states and 4588 transitions. [2018-07-25 13:16:02,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:02,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:16:02,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:02,741 INFO L225 Difference]: With dead ends: 1100 [2018-07-25 13:16:02,741 INFO L226 Difference]: Without dead ends: 1098 [2018-07-25 13:16:02,742 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:02,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2018-07-25 13:16:03,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 636. [2018-07-25 13:16:03,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2018-07-25 13:16:03,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2815 transitions. [2018-07-25 13:16:03,095 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 2815 transitions. Word has length 6 [2018-07-25 13:16:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:03,096 INFO L472 AbstractCegarLoop]: Abstraction has 636 states and 2815 transitions. [2018-07-25 13:16:03,096 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:03,096 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 2815 transitions. [2018-07-25 13:16:03,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:16:03,097 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:03,097 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:16:03,097 INFO L415 AbstractCegarLoop]: === Iteration 29 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:03,097 INFO L82 PathProgramCache]: Analyzing trace with hash 914033883, now seen corresponding path program 1 times [2018-07-25 13:16:03,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:03,130 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:03,130 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:16:03,130 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:03,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:03,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:03,131 INFO L87 Difference]: Start difference. First operand 636 states and 2815 transitions. Second operand 7 states. [2018-07-25 13:16:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:04,398 INFO L93 Difference]: Finished difference Result 1140 states and 4821 transitions. [2018-07-25 13:16:04,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:16:04,398 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:16:04,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:04,404 INFO L225 Difference]: With dead ends: 1140 [2018-07-25 13:16:04,404 INFO L226 Difference]: Without dead ends: 1138 [2018-07-25 13:16:04,405 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:16:04,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2018-07-25 13:16:04,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 705. [2018-07-25 13:16:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-07-25 13:16:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 3157 transitions. [2018-07-25 13:16:04,720 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 3157 transitions. Word has length 6 [2018-07-25 13:16:04,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:04,720 INFO L472 AbstractCegarLoop]: Abstraction has 705 states and 3157 transitions. [2018-07-25 13:16:04,721 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:04,721 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 3157 transitions. [2018-07-25 13:16:04,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:16:04,722 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:04,722 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:16:04,722 INFO L415 AbstractCegarLoop]: === Iteration 30 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:04,722 INFO L82 PathProgramCache]: Analyzing trace with hash 914033756, now seen corresponding path program 1 times [2018-07-25 13:16:04,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:04,746 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:04,746 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:16:04,746 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:04,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:04,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:04,747 INFO L87 Difference]: Start difference. First operand 705 states and 3157 transitions. Second operand 7 states. [2018-07-25 13:16:05,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:05,813 INFO L93 Difference]: Finished difference Result 1069 states and 4536 transitions. [2018-07-25 13:16:05,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:05,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:16:05,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:05,819 INFO L225 Difference]: With dead ends: 1069 [2018-07-25 13:16:05,819 INFO L226 Difference]: Without dead ends: 1063 [2018-07-25 13:16:05,820 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:05,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2018-07-25 13:16:06,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 699. [2018-07-25 13:16:06,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-07-25 13:16:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 3128 transitions. [2018-07-25 13:16:06,390 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 3128 transitions. Word has length 6 [2018-07-25 13:16:06,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:06,390 INFO L472 AbstractCegarLoop]: Abstraction has 699 states and 3128 transitions. [2018-07-25 13:16:06,390 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:06,390 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 3128 transitions. [2018-07-25 13:16:06,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:16:06,391 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:06,391 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:16:06,391 INFO L415 AbstractCegarLoop]: === Iteration 31 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:06,392 INFO L82 PathProgramCache]: Analyzing trace with hash 914022475, now seen corresponding path program 1 times [2018-07-25 13:16:06,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:06,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:06,416 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:06,416 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:16:06,417 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:06,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:06,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:06,417 INFO L87 Difference]: Start difference. First operand 699 states and 3128 transitions. Second operand 7 states. [2018-07-25 13:16:07,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:07,802 INFO L93 Difference]: Finished difference Result 1187 states and 5015 transitions. [2018-07-25 13:16:07,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:07,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:16:07,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:07,809 INFO L225 Difference]: With dead ends: 1187 [2018-07-25 13:16:07,809 INFO L226 Difference]: Without dead ends: 1181 [2018-07-25 13:16:07,810 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:16:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2018-07-25 13:16:08,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 711. [2018-07-25 13:16:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2018-07-25 13:16:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 3183 transitions. [2018-07-25 13:16:08,403 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 3183 transitions. Word has length 6 [2018-07-25 13:16:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:08,403 INFO L472 AbstractCegarLoop]: Abstraction has 711 states and 3183 transitions. [2018-07-25 13:16:08,403 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 3183 transitions. [2018-07-25 13:16:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:16:08,404 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:08,404 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:16:08,405 INFO L415 AbstractCegarLoop]: === Iteration 32 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:08,405 INFO L82 PathProgramCache]: Analyzing trace with hash 914022348, now seen corresponding path program 1 times [2018-07-25 13:16:08,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:08,425 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:08,426 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:16:08,426 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:08,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:08,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:08,432 INFO L87 Difference]: Start difference. First operand 711 states and 3183 transitions. Second operand 7 states. [2018-07-25 13:16:09,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:09,326 INFO L93 Difference]: Finished difference Result 1122 states and 4765 transitions. [2018-07-25 13:16:09,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:09,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:16:09,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:09,331 INFO L225 Difference]: With dead ends: 1122 [2018-07-25 13:16:09,332 INFO L226 Difference]: Without dead ends: 1116 [2018-07-25 13:16:09,332 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2018-07-25 13:16:09,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 697. [2018-07-25 13:16:09,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-07-25 13:16:09,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 3116 transitions. [2018-07-25 13:16:09,838 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 3116 transitions. Word has length 6 [2018-07-25 13:16:09,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:09,839 INFO L472 AbstractCegarLoop]: Abstraction has 697 states and 3116 transitions. [2018-07-25 13:16:09,839 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:09,839 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 3116 transitions. [2018-07-25 13:16:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:16:09,840 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:09,840 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-25 13:16:09,840 INFO L415 AbstractCegarLoop]: === Iteration 33 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:09,840 INFO L82 PathProgramCache]: Analyzing trace with hash 914069320, now seen corresponding path program 1 times [2018-07-25 13:16:09,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:09,845 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:09,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-25 13:16:09,845 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:16:09,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:16:09,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:16:09,846 INFO L87 Difference]: Start difference. First operand 697 states and 3116 transitions. Second operand 4 states. [2018-07-25 13:16:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:10,291 INFO L93 Difference]: Finished difference Result 1197 states and 5195 transitions. [2018-07-25 13:16:10,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:16:10,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-25 13:16:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:10,296 INFO L225 Difference]: With dead ends: 1197 [2018-07-25 13:16:10,296 INFO L226 Difference]: Without dead ends: 869 [2018-07-25 13:16:10,297 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:16:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-07-25 13:16:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 671. [2018-07-25 13:16:10,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-07-25 13:16:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 2941 transitions. [2018-07-25 13:16:10,863 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 2941 transitions. Word has length 6 [2018-07-25 13:16:10,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:10,864 INFO L472 AbstractCegarLoop]: Abstraction has 671 states and 2941 transitions. [2018-07-25 13:16:10,864 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:16:10,864 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 2941 transitions. [2018-07-25 13:16:10,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:16:10,865 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:10,865 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:16:10,865 INFO L415 AbstractCegarLoop]: === Iteration 34 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:10,865 INFO L82 PathProgramCache]: Analyzing trace with hash 914072468, now seen corresponding path program 1 times [2018-07-25 13:16:10,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:10,877 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:10,878 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:16:10,878 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:10,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:10,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:10,878 INFO L87 Difference]: Start difference. First operand 671 states and 2941 transitions. Second operand 7 states. [2018-07-25 13:16:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:11,605 INFO L93 Difference]: Finished difference Result 1201 states and 4932 transitions. [2018-07-25 13:16:11,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:11,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:16:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:11,609 INFO L225 Difference]: With dead ends: 1201 [2018-07-25 13:16:11,609 INFO L226 Difference]: Without dead ends: 1195 [2018-07-25 13:16:11,610 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:11,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2018-07-25 13:16:12,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 752. [2018-07-25 13:16:12,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-07-25 13:16:12,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 3312 transitions. [2018-07-25 13:16:12,023 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 3312 transitions. Word has length 6 [2018-07-25 13:16:12,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:12,023 INFO L472 AbstractCegarLoop]: Abstraction has 752 states and 3312 transitions. [2018-07-25 13:16:12,023 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 3312 transitions. [2018-07-25 13:16:12,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:16:12,024 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:12,024 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:16:12,024 INFO L415 AbstractCegarLoop]: === Iteration 35 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:12,024 INFO L82 PathProgramCache]: Analyzing trace with hash 914072471, now seen corresponding path program 1 times [2018-07-25 13:16:12,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:12,035 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:12,036 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:16:12,036 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:12,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:12,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:12,036 INFO L87 Difference]: Start difference. First operand 752 states and 3312 transitions. Second operand 7 states. [2018-07-25 13:16:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:13,001 INFO L93 Difference]: Finished difference Result 1250 states and 5213 transitions. [2018-07-25 13:16:13,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:13,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:16:13,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:13,005 INFO L225 Difference]: With dead ends: 1250 [2018-07-25 13:16:13,005 INFO L226 Difference]: Without dead ends: 1244 [2018-07-25 13:16:13,006 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:16:13,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2018-07-25 13:16:13,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 825. [2018-07-25 13:16:13,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-07-25 13:16:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 3616 transitions. [2018-07-25 13:16:13,481 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 3616 transitions. Word has length 6 [2018-07-25 13:16:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:13,481 INFO L472 AbstractCegarLoop]: Abstraction has 825 states and 3616 transitions. [2018-07-25 13:16:13,481 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 3616 transitions. [2018-07-25 13:16:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:16:13,482 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:13,482 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:16:13,482 INFO L415 AbstractCegarLoop]: === Iteration 36 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:13,482 INFO L82 PathProgramCache]: Analyzing trace with hash 914569284, now seen corresponding path program 1 times [2018-07-25 13:16:13,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:13,494 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:13,494 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:16:13,495 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:13,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:13,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:13,495 INFO L87 Difference]: Start difference. First operand 825 states and 3616 transitions. Second operand 7 states. [2018-07-25 13:16:14,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:14,641 INFO L93 Difference]: Finished difference Result 1256 states and 5269 transitions. [2018-07-25 13:16:14,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:16:14,641 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:16:14,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:14,644 INFO L225 Difference]: With dead ends: 1256 [2018-07-25 13:16:14,645 INFO L226 Difference]: Without dead ends: 1250 [2018-07-25 13:16:14,645 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:16:14,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2018-07-25 13:16:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 857. [2018-07-25 13:16:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2018-07-25 13:16:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 3741 transitions. [2018-07-25 13:16:15,165 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 3741 transitions. Word has length 6 [2018-07-25 13:16:15,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:15,166 INFO L472 AbstractCegarLoop]: Abstraction has 857 states and 3741 transitions. [2018-07-25 13:16:15,166 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 3741 transitions. [2018-07-25 13:16:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:16:15,167 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:15,167 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:16:15,167 INFO L415 AbstractCegarLoop]: === Iteration 37 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:15,167 INFO L82 PathProgramCache]: Analyzing trace with hash 914569157, now seen corresponding path program 1 times [2018-07-25 13:16:15,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:15,182 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:15,182 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:16:15,182 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:15,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:15,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:15,183 INFO L87 Difference]: Start difference. First operand 857 states and 3741 transitions. Second operand 7 states. [2018-07-25 13:16:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:16,126 INFO L93 Difference]: Finished difference Result 1225 states and 5152 transitions. [2018-07-25 13:16:16,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:16,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:16:16,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:16,129 INFO L225 Difference]: With dead ends: 1225 [2018-07-25 13:16:16,129 INFO L226 Difference]: Without dead ends: 1219 [2018-07-25 13:16:16,130 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:16,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-07-25 13:16:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 849. [2018-07-25 13:16:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2018-07-25 13:16:16,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 3706 transitions. [2018-07-25 13:16:16,670 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 3706 transitions. Word has length 6 [2018-07-25 13:16:16,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:16,670 INFO L472 AbstractCegarLoop]: Abstraction has 849 states and 3706 transitions. [2018-07-25 13:16:16,671 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:16,671 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 3706 transitions. [2018-07-25 13:16:16,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:16:16,672 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:16,672 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:16:16,672 INFO L415 AbstractCegarLoop]: === Iteration 38 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:16,672 INFO L82 PathProgramCache]: Analyzing trace with hash 913940811, now seen corresponding path program 1 times [2018-07-25 13:16:16,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:16,686 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:16,686 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:16:16,686 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:16,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:16,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:16,687 INFO L87 Difference]: Start difference. First operand 849 states and 3706 transitions. Second operand 7 states. [2018-07-25 13:16:17,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:17,821 INFO L93 Difference]: Finished difference Result 1442 states and 5955 transitions. [2018-07-25 13:16:17,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:17,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:16:17,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:17,825 INFO L225 Difference]: With dead ends: 1442 [2018-07-25 13:16:17,825 INFO L226 Difference]: Without dead ends: 1436 [2018-07-25 13:16:17,826 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:17,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2018-07-25 13:16:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 905. [2018-07-25 13:16:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2018-07-25 13:16:18,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 3981 transitions. [2018-07-25 13:16:18,398 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 3981 transitions. Word has length 6 [2018-07-25 13:16:18,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:18,398 INFO L472 AbstractCegarLoop]: Abstraction has 905 states and 3981 transitions. [2018-07-25 13:16:18,398 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 3981 transitions. [2018-07-25 13:16:18,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:16:18,399 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:18,400 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:16:18,400 INFO L415 AbstractCegarLoop]: === Iteration 39 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:18,400 INFO L82 PathProgramCache]: Analyzing trace with hash 913940814, now seen corresponding path program 1 times [2018-07-25 13:16:18,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:18,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:18,422 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:18,422 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:16:18,422 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:18,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:18,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:18,423 INFO L87 Difference]: Start difference. First operand 905 states and 3981 transitions. Second operand 7 states. [2018-07-25 13:16:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:19,576 INFO L93 Difference]: Finished difference Result 1440 states and 5977 transitions. [2018-07-25 13:16:19,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:19,576 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:16:19,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:19,580 INFO L225 Difference]: With dead ends: 1440 [2018-07-25 13:16:19,580 INFO L226 Difference]: Without dead ends: 1434 [2018-07-25 13:16:19,581 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:16:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2018-07-25 13:16:20,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 889. [2018-07-25 13:16:20,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-07-25 13:16:20,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 3911 transitions. [2018-07-25 13:16:20,176 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 3911 transitions. Word has length 6 [2018-07-25 13:16:20,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:20,176 INFO L472 AbstractCegarLoop]: Abstraction has 889 states and 3911 transitions. [2018-07-25 13:16:20,176 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:20,176 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 3911 transitions. [2018-07-25 13:16:20,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:16:20,177 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:20,177 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:16:20,177 INFO L415 AbstractCegarLoop]: === Iteration 40 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:20,177 INFO L82 PathProgramCache]: Analyzing trace with hash 913927853, now seen corresponding path program 1 times [2018-07-25 13:16:20,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:20,198 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:20,198 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:16:20,198 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:20,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:20,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:20,199 INFO L87 Difference]: Start difference. First operand 889 states and 3911 transitions. Second operand 7 states. [2018-07-25 13:16:21,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:21,359 INFO L93 Difference]: Finished difference Result 1361 states and 5672 transitions. [2018-07-25 13:16:21,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:21,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:16:21,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:21,363 INFO L225 Difference]: With dead ends: 1361 [2018-07-25 13:16:21,363 INFO L226 Difference]: Without dead ends: 1355 [2018-07-25 13:16:21,364 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:21,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2018-07-25 13:16:22,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 900. [2018-07-25 13:16:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-07-25 13:16:22,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 3963 transitions. [2018-07-25 13:16:22,015 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 3963 transitions. Word has length 6 [2018-07-25 13:16:22,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:22,015 INFO L472 AbstractCegarLoop]: Abstraction has 900 states and 3963 transitions. [2018-07-25 13:16:22,015 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 3963 transitions. [2018-07-25 13:16:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:16:22,016 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:22,016 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:16:22,016 INFO L415 AbstractCegarLoop]: === Iteration 41 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:22,016 INFO L82 PathProgramCache]: Analyzing trace with hash 913927856, now seen corresponding path program 1 times [2018-07-25 13:16:22,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:22,040 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:22,040 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-25 13:16:22,040 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:16:22,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:16:22,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:16:22,040 INFO L87 Difference]: Start difference. First operand 900 states and 3963 transitions. Second operand 7 states. [2018-07-25 13:16:23,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:23,220 INFO L93 Difference]: Finished difference Result 1349 states and 5655 transitions. [2018-07-25 13:16:23,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:16:23,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-07-25 13:16:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:23,224 INFO L225 Difference]: With dead ends: 1349 [2018-07-25 13:16:23,224 INFO L226 Difference]: Without dead ends: 1343 [2018-07-25 13:16:23,225 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:16:23,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2018-07-25 13:16:23,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 896. [2018-07-25 13:16:23,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-07-25 13:16:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 3945 transitions. [2018-07-25 13:16:23,769 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 3945 transitions. Word has length 6 [2018-07-25 13:16:23,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:23,769 INFO L472 AbstractCegarLoop]: Abstraction has 896 states and 3945 transitions. [2018-07-25 13:16:23,769 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:16:23,770 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 3945 transitions. [2018-07-25 13:16:23,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:16:23,771 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:23,771 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:23,771 INFO L415 AbstractCegarLoop]: === Iteration 42 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:23,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1215232670, now seen corresponding path program 1 times [2018-07-25 13:16:23,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:23,784 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:23,784 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:16:23,785 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:23,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:23,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:23,785 INFO L87 Difference]: Start difference. First operand 896 states and 3945 transitions. Second operand 8 states. [2018-07-25 13:16:25,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:25,203 INFO L93 Difference]: Finished difference Result 1632 states and 6899 transitions. [2018-07-25 13:16:25,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:16:25,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:16:25,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:25,207 INFO L225 Difference]: With dead ends: 1632 [2018-07-25 13:16:25,208 INFO L226 Difference]: Without dead ends: 1626 [2018-07-25 13:16:25,208 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:16:25,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2018-07-25 13:16:25,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1177. [2018-07-25 13:16:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-07-25 13:16:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 5230 transitions. [2018-07-25 13:16:25,987 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 5230 transitions. Word has length 7 [2018-07-25 13:16:25,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:25,987 INFO L472 AbstractCegarLoop]: Abstraction has 1177 states and 5230 transitions. [2018-07-25 13:16:25,987 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 5230 transitions. [2018-07-25 13:16:25,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:16:25,988 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:25,988 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:25,989 INFO L415 AbstractCegarLoop]: === Iteration 43 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:25,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1215233045, now seen corresponding path program 1 times [2018-07-25 13:16:25,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:26,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:26,001 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:26,001 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:16:26,001 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:26,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:26,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:26,002 INFO L87 Difference]: Start difference. First operand 1177 states and 5230 transitions. Second operand 8 states. [2018-07-25 13:16:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:27,076 INFO L93 Difference]: Finished difference Result 1376 states and 5845 transitions. [2018-07-25 13:16:27,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:16:27,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:16:27,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:27,079 INFO L225 Difference]: With dead ends: 1376 [2018-07-25 13:16:27,079 INFO L226 Difference]: Without dead ends: 1370 [2018-07-25 13:16:27,080 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:27,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-07-25 13:16:27,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1171. [2018-07-25 13:16:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2018-07-25 13:16:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 5199 transitions. [2018-07-25 13:16:27,817 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 5199 transitions. Word has length 7 [2018-07-25 13:16:27,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:27,817 INFO L472 AbstractCegarLoop]: Abstraction has 1171 states and 5199 transitions. [2018-07-25 13:16:27,817 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:27,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 5199 transitions. [2018-07-25 13:16:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:16:27,818 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:27,818 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:27,818 INFO L415 AbstractCegarLoop]: === Iteration 44 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:27,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1202921392, now seen corresponding path program 1 times [2018-07-25 13:16:27,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:27,828 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:27,828 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:16:27,829 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:27,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:27,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:27,829 INFO L87 Difference]: Start difference. First operand 1171 states and 5199 transitions. Second operand 8 states. [2018-07-25 13:16:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:29,231 INFO L93 Difference]: Finished difference Result 1643 states and 7055 transitions. [2018-07-25 13:16:29,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:16:29,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:16:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:29,235 INFO L225 Difference]: With dead ends: 1643 [2018-07-25 13:16:29,235 INFO L226 Difference]: Without dead ends: 1637 [2018-07-25 13:16:29,236 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:29,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2018-07-25 13:16:30,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1203. [2018-07-25 13:16:30,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2018-07-25 13:16:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 5375 transitions. [2018-07-25 13:16:30,026 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 5375 transitions. Word has length 7 [2018-07-25 13:16:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:30,026 INFO L472 AbstractCegarLoop]: Abstraction has 1203 states and 5375 transitions. [2018-07-25 13:16:30,026 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 5375 transitions. [2018-07-25 13:16:30,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:16:30,028 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:30,028 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:30,028 INFO L415 AbstractCegarLoop]: === Iteration 45 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:30,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1202921767, now seen corresponding path program 1 times [2018-07-25 13:16:30,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:30,038 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:30,038 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:16:30,038 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:30,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:30,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:30,039 INFO L87 Difference]: Start difference. First operand 1203 states and 5375 transitions. Second operand 8 states. [2018-07-25 13:16:31,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:31,365 INFO L93 Difference]: Finished difference Result 1627 states and 7002 transitions. [2018-07-25 13:16:31,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:16:31,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:16:31,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:31,369 INFO L225 Difference]: With dead ends: 1627 [2018-07-25 13:16:31,370 INFO L226 Difference]: Without dead ends: 1621 [2018-07-25 13:16:31,370 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:31,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2018-07-25 13:16:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1282. [2018-07-25 13:16:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2018-07-25 13:16:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 5742 transitions. [2018-07-25 13:16:32,222 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 5742 transitions. Word has length 7 [2018-07-25 13:16:32,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:32,222 INFO L472 AbstractCegarLoop]: Abstraction has 1282 states and 5742 transitions. [2018-07-25 13:16:32,222 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 5742 transitions. [2018-07-25 13:16:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:16:32,223 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:32,223 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:32,224 INFO L415 AbstractCegarLoop]: === Iteration 46 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:32,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1202932831, now seen corresponding path program 1 times [2018-07-25 13:16:32,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:32,232 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:32,232 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:16:32,232 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:32,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:32,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:32,233 INFO L87 Difference]: Start difference. First operand 1282 states and 5742 transitions. Second operand 8 states. [2018-07-25 13:16:33,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:33,848 INFO L93 Difference]: Finished difference Result 1692 states and 7228 transitions. [2018-07-25 13:16:33,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:33,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:16:33,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:33,852 INFO L225 Difference]: With dead ends: 1692 [2018-07-25 13:16:33,852 INFO L226 Difference]: Without dead ends: 1686 [2018-07-25 13:16:33,853 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:16:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2018-07-25 13:16:34,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1244. [2018-07-25 13:16:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2018-07-25 13:16:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 5541 transitions. [2018-07-25 13:16:34,798 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 5541 transitions. Word has length 7 [2018-07-25 13:16:34,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:34,798 INFO L472 AbstractCegarLoop]: Abstraction has 1244 states and 5541 transitions. [2018-07-25 13:16:34,798 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:34,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 5541 transitions. [2018-07-25 13:16:34,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:16:34,799 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:34,799 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:34,799 INFO L415 AbstractCegarLoop]: === Iteration 47 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:34,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1202933206, now seen corresponding path program 1 times [2018-07-25 13:16:34,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:34,810 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:34,811 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:16:34,811 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:34,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:34,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:34,811 INFO L87 Difference]: Start difference. First operand 1244 states and 5541 transitions. Second operand 8 states. [2018-07-25 13:16:36,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:36,414 INFO L93 Difference]: Finished difference Result 1668 states and 7135 transitions. [2018-07-25 13:16:36,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:16:36,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:16:36,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:36,418 INFO L225 Difference]: With dead ends: 1668 [2018-07-25 13:16:36,418 INFO L226 Difference]: Without dead ends: 1666 [2018-07-25 13:16:36,419 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:16:36,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2018-07-25 13:16:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1223. [2018-07-25 13:16:37,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2018-07-25 13:16:37,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 5442 transitions. [2018-07-25 13:16:37,513 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 5442 transitions. Word has length 7 [2018-07-25 13:16:37,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:37,514 INFO L472 AbstractCegarLoop]: Abstraction has 1223 states and 5442 transitions. [2018-07-25 13:16:37,514 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:37,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 5442 transitions. [2018-07-25 13:16:37,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:16:37,515 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:37,515 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:37,515 INFO L415 AbstractCegarLoop]: === Iteration 48 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:37,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1245822743, now seen corresponding path program 1 times [2018-07-25 13:16:37,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:37,530 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:37,530 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:16:37,531 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:37,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:37,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:37,531 INFO L87 Difference]: Start difference. First operand 1223 states and 5442 transitions. Second operand 8 states. [2018-07-25 13:16:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:38,989 INFO L93 Difference]: Finished difference Result 1979 states and 8650 transitions. [2018-07-25 13:16:38,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:16:38,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:16:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:38,994 INFO L225 Difference]: With dead ends: 1979 [2018-07-25 13:16:38,994 INFO L226 Difference]: Without dead ends: 1562 [2018-07-25 13:16:38,995 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:16:38,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2018-07-25 13:16:39,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1266. [2018-07-25 13:16:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2018-07-25 13:16:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 5570 transitions. [2018-07-25 13:16:39,969 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 5570 transitions. Word has length 7 [2018-07-25 13:16:39,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:39,969 INFO L472 AbstractCegarLoop]: Abstraction has 1266 states and 5570 transitions. [2018-07-25 13:16:39,969 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:39,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 5570 transitions. [2018-07-25 13:16:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:16:39,970 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:39,971 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:39,971 INFO L415 AbstractCegarLoop]: === Iteration 49 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:39,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1245822746, now seen corresponding path program 1 times [2018-07-25 13:16:39,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:39,983 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:39,983 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:16:39,983 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:39,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:39,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:39,984 INFO L87 Difference]: Start difference. First operand 1266 states and 5570 transitions. Second operand 8 states. [2018-07-25 13:16:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:41,686 INFO L93 Difference]: Finished difference Result 1823 states and 7865 transitions. [2018-07-25 13:16:41,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:16:41,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:16:41,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:41,691 INFO L225 Difference]: With dead ends: 1823 [2018-07-25 13:16:41,691 INFO L226 Difference]: Without dead ends: 1817 [2018-07-25 13:16:41,692 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:16:41,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2018-07-25 13:16:42,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1390. [2018-07-25 13:16:42,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1390 states. [2018-07-25 13:16:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 6137 transitions. [2018-07-25 13:16:42,885 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 6137 transitions. Word has length 7 [2018-07-25 13:16:42,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:42,885 INFO L472 AbstractCegarLoop]: Abstraction has 1390 states and 6137 transitions. [2018-07-25 13:16:42,885 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:42,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 6137 transitions. [2018-07-25 13:16:42,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:16:42,886 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:42,886 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:42,887 INFO L415 AbstractCegarLoop]: === Iteration 50 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:42,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1258459411, now seen corresponding path program 1 times [2018-07-25 13:16:42,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:42,900 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:42,900 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:16:42,900 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:42,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:42,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:42,901 INFO L87 Difference]: Start difference. First operand 1390 states and 6137 transitions. Second operand 8 states. [2018-07-25 13:16:44,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:44,723 INFO L93 Difference]: Finished difference Result 1838 states and 7765 transitions. [2018-07-25 13:16:44,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:16:44,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:16:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:44,727 INFO L225 Difference]: With dead ends: 1838 [2018-07-25 13:16:44,728 INFO L226 Difference]: Without dead ends: 1832 [2018-07-25 13:16:44,728 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:16:44,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2018-07-25 13:16:45,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1163. [2018-07-25 13:16:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1163 states. [2018-07-25 13:16:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 5098 transitions. [2018-07-25 13:16:45,603 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 5098 transitions. Word has length 7 [2018-07-25 13:16:45,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:45,604 INFO L472 AbstractCegarLoop]: Abstraction has 1163 states and 5098 transitions. [2018-07-25 13:16:45,604 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 5098 transitions. [2018-07-25 13:16:45,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:16:45,605 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:45,605 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:45,605 INFO L415 AbstractCegarLoop]: === Iteration 51 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:45,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1258459786, now seen corresponding path program 1 times [2018-07-25 13:16:45,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:45,619 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:45,619 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:16:45,619 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:45,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:45,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:45,620 INFO L87 Difference]: Start difference. First operand 1163 states and 5098 transitions. Second operand 8 states. [2018-07-25 13:16:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:47,014 INFO L93 Difference]: Finished difference Result 1536 states and 6478 transitions. [2018-07-25 13:16:47,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:47,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:16:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:47,018 INFO L225 Difference]: With dead ends: 1536 [2018-07-25 13:16:47,018 INFO L226 Difference]: Without dead ends: 1530 [2018-07-25 13:16:47,019 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:16:47,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2018-07-25 13:16:47,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1072. [2018-07-25 13:16:47,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2018-07-25 13:16:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 4678 transitions. [2018-07-25 13:16:47,928 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 4678 transitions. Word has length 7 [2018-07-25 13:16:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:47,928 INFO L472 AbstractCegarLoop]: Abstraction has 1072 states and 4678 transitions. [2018-07-25 13:16:47,928 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 4678 transitions. [2018-07-25 13:16:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:16:47,929 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:47,930 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:47,930 INFO L415 AbstractCegarLoop]: === Iteration 52 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:47,930 INFO L82 PathProgramCache]: Analyzing trace with hash 792850588, now seen corresponding path program 1 times [2018-07-25 13:16:47,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:47,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:47,979 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:47,979 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:16:47,979 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:47,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:47,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:47,980 INFO L87 Difference]: Start difference. First operand 1072 states and 4678 transitions. Second operand 8 states. [2018-07-25 13:16:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:49,555 INFO L93 Difference]: Finished difference Result 1630 states and 6984 transitions. [2018-07-25 13:16:49,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:49,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:16:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:49,559 INFO L225 Difference]: With dead ends: 1630 [2018-07-25 13:16:49,559 INFO L226 Difference]: Without dead ends: 1618 [2018-07-25 13:16:49,560 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:49,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2018-07-25 13:16:50,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1182. [2018-07-25 13:16:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2018-07-25 13:16:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 5237 transitions. [2018-07-25 13:16:50,547 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 5237 transitions. Word has length 7 [2018-07-25 13:16:50,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:50,547 INFO L472 AbstractCegarLoop]: Abstraction has 1182 states and 5237 transitions. [2018-07-25 13:16:50,547 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 5237 transitions. [2018-07-25 13:16:50,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:16:50,548 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:50,548 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:50,548 INFO L415 AbstractCegarLoop]: === Iteration 53 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:50,548 INFO L82 PathProgramCache]: Analyzing trace with hash 792058662, now seen corresponding path program 1 times [2018-07-25 13:16:50,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:50,558 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:50,559 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:16:50,559 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:50,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:50,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:50,559 INFO L87 Difference]: Start difference. First operand 1182 states and 5237 transitions. Second operand 8 states. [2018-07-25 13:16:52,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:52,264 INFO L93 Difference]: Finished difference Result 1554 states and 6632 transitions. [2018-07-25 13:16:52,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:16:52,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:16:52,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:52,268 INFO L225 Difference]: With dead ends: 1554 [2018-07-25 13:16:52,268 INFO L226 Difference]: Without dead ends: 1548 [2018-07-25 13:16:52,269 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:52,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2018-07-25 13:16:53,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1166. [2018-07-25 13:16:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1166 states. [2018-07-25 13:16:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 5153 transitions. [2018-07-25 13:16:53,390 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 5153 transitions. Word has length 7 [2018-07-25 13:16:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:53,390 INFO L472 AbstractCegarLoop]: Abstraction has 1166 states and 5153 transitions. [2018-07-25 13:16:53,390 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:53,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 5153 transitions. [2018-07-25 13:16:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:16:53,391 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:53,391 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:53,391 INFO L415 AbstractCegarLoop]: === Iteration 54 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:53,391 INFO L82 PathProgramCache]: Analyzing trace with hash 792058665, now seen corresponding path program 1 times [2018-07-25 13:16:53,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:53,402 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:53,403 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:16:53,403 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:53,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:53,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:53,403 INFO L87 Difference]: Start difference. First operand 1166 states and 5153 transitions. Second operand 8 states. [2018-07-25 13:16:55,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:55,541 INFO L93 Difference]: Finished difference Result 1766 states and 7491 transitions. [2018-07-25 13:16:55,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:16:55,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:16:55,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:55,545 INFO L225 Difference]: With dead ends: 1766 [2018-07-25 13:16:55,546 INFO L226 Difference]: Without dead ends: 1764 [2018-07-25 13:16:55,546 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:16:55,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-07-25 13:16:56,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1149. [2018-07-25 13:16:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2018-07-25 13:16:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 5076 transitions. [2018-07-25 13:16:56,534 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 5076 transitions. Word has length 7 [2018-07-25 13:16:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:56,534 INFO L472 AbstractCegarLoop]: Abstraction has 1149 states and 5076 transitions. [2018-07-25 13:16:56,534 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 5076 transitions. [2018-07-25 13:16:56,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:16:56,535 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:56,535 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:56,535 INFO L415 AbstractCegarLoop]: === Iteration 55 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:56,535 INFO L82 PathProgramCache]: Analyzing trace with hash 792055841, now seen corresponding path program 1 times [2018-07-25 13:16:56,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:56,545 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:56,545 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:16:56,545 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:56,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:56,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:56,546 INFO L87 Difference]: Start difference. First operand 1149 states and 5076 transitions. Second operand 8 states. [2018-07-25 13:16:58,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:16:58,663 INFO L93 Difference]: Finished difference Result 1832 states and 7818 transitions. [2018-07-25 13:16:58,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:16:58,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:16:58,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:16:58,667 INFO L225 Difference]: With dead ends: 1832 [2018-07-25 13:16:58,667 INFO L226 Difference]: Without dead ends: 1826 [2018-07-25 13:16:58,668 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:16:58,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2018-07-25 13:16:59,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1154. [2018-07-25 13:16:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1154 states. [2018-07-25 13:16:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 5098 transitions. [2018-07-25 13:16:59,679 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 5098 transitions. Word has length 7 [2018-07-25 13:16:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:16:59,679 INFO L472 AbstractCegarLoop]: Abstraction has 1154 states and 5098 transitions. [2018-07-25 13:16:59,679 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:16:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 5098 transitions. [2018-07-25 13:16:59,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:16:59,680 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:16:59,680 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:16:59,680 INFO L415 AbstractCegarLoop]: === Iteration 56 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:16:59,681 INFO L82 PathProgramCache]: Analyzing trace with hash 792055844, now seen corresponding path program 1 times [2018-07-25 13:16:59,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:16:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:16:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:16:59,695 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:16:59,696 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:16:59,696 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:16:59,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:16:59,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:16:59,696 INFO L87 Difference]: Start difference. First operand 1154 states and 5098 transitions. Second operand 8 states. [2018-07-25 13:17:01,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:01,720 INFO L93 Difference]: Finished difference Result 1820 states and 7670 transitions. [2018-07-25 13:17:01,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:17:01,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:17:01,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:01,724 INFO L225 Difference]: With dead ends: 1820 [2018-07-25 13:17:01,724 INFO L226 Difference]: Without dead ends: 1814 [2018-07-25 13:17:01,725 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:17:01,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2018-07-25 13:17:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1048. [2018-07-25 13:17:02,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-07-25 13:17:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 4552 transitions. [2018-07-25 13:17:02,725 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 4552 transitions. Word has length 7 [2018-07-25 13:17:02,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:02,725 INFO L472 AbstractCegarLoop]: Abstraction has 1048 states and 4552 transitions. [2018-07-25 13:17:02,725 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:17:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 4552 transitions. [2018-07-25 13:17:02,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:17:02,726 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:02,726 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:02,726 INFO L415 AbstractCegarLoop]: === Iteration 57 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:02,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1734683267, now seen corresponding path program 1 times [2018-07-25 13:17:02,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:02,743 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:17:02,743 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:17:02,743 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:17:02,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:17:02,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:17:02,744 INFO L87 Difference]: Start difference. First operand 1048 states and 4552 transitions. Second operand 8 states. [2018-07-25 13:17:04,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:04,949 INFO L93 Difference]: Finished difference Result 1741 states and 7174 transitions. [2018-07-25 13:17:04,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:17:04,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:17:04,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:04,953 INFO L225 Difference]: With dead ends: 1741 [2018-07-25 13:17:04,953 INFO L226 Difference]: Without dead ends: 1735 [2018-07-25 13:17:04,954 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:17:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2018-07-25 13:17:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1077. [2018-07-25 13:17:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1077 states. [2018-07-25 13:17:05,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 4692 transitions. [2018-07-25 13:17:05,975 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 4692 transitions. Word has length 7 [2018-07-25 13:17:05,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:05,976 INFO L472 AbstractCegarLoop]: Abstraction has 1077 states and 4692 transitions. [2018-07-25 13:17:05,976 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:17:05,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 4692 transitions. [2018-07-25 13:17:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:17:05,976 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:05,977 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:05,977 INFO L415 AbstractCegarLoop]: === Iteration 58 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:05,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1734682892, now seen corresponding path program 1 times [2018-07-25 13:17:05,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:05,999 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:17:06,000 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:17:06,000 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:17:06,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:17:06,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:17:06,000 INFO L87 Difference]: Start difference. First operand 1077 states and 4692 transitions. Second operand 8 states. [2018-07-25 13:17:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:09,044 INFO L93 Difference]: Finished difference Result 1734 states and 7201 transitions. [2018-07-25 13:17:09,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:17:09,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:17:09,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:09,048 INFO L225 Difference]: With dead ends: 1734 [2018-07-25 13:17:09,049 INFO L226 Difference]: Without dead ends: 1728 [2018-07-25 13:17:09,049 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:17:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2018-07-25 13:17:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1068. [2018-07-25 13:17:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2018-07-25 13:17:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 4655 transitions. [2018-07-25 13:17:10,220 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 4655 transitions. Word has length 7 [2018-07-25 13:17:10,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:10,220 INFO L472 AbstractCegarLoop]: Abstraction has 1068 states and 4655 transitions. [2018-07-25 13:17:10,220 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:17:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 4655 transitions. [2018-07-25 13:17:10,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:17:10,221 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:10,222 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:10,222 INFO L415 AbstractCegarLoop]: === Iteration 59 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:10,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1734671828, now seen corresponding path program 1 times [2018-07-25 13:17:10,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:10,242 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:17:10,242 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:17:10,243 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:17:10,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:17:10,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:17:10,243 INFO L87 Difference]: Start difference. First operand 1068 states and 4655 transitions. Second operand 8 states. [2018-07-25 13:17:12,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:12,487 INFO L93 Difference]: Finished difference Result 1680 states and 6963 transitions. [2018-07-25 13:17:12,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:17:12,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:17:12,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:12,492 INFO L225 Difference]: With dead ends: 1680 [2018-07-25 13:17:12,492 INFO L226 Difference]: Without dead ends: 1674 [2018-07-25 13:17:12,493 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:17:12,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2018-07-25 13:17:13,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1058. [2018-07-25 13:17:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2018-07-25 13:17:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 4600 transitions. [2018-07-25 13:17:13,577 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 4600 transitions. Word has length 7 [2018-07-25 13:17:13,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:13,577 INFO L472 AbstractCegarLoop]: Abstraction has 1058 states and 4600 transitions. [2018-07-25 13:17:13,577 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:17:13,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 4600 transitions. [2018-07-25 13:17:13,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:17:13,578 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:13,579 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:13,579 INFO L415 AbstractCegarLoop]: === Iteration 60 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:13,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1734671453, now seen corresponding path program 1 times [2018-07-25 13:17:13,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:13,596 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:17:13,596 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:17:13,596 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:17:13,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:17:13,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:17:13,597 INFO L87 Difference]: Start difference. First operand 1058 states and 4600 transitions. Second operand 8 states. [2018-07-25 13:17:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:16,163 INFO L93 Difference]: Finished difference Result 1693 states and 7034 transitions. [2018-07-25 13:17:16,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:17:16,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:17:16,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:16,167 INFO L225 Difference]: With dead ends: 1693 [2018-07-25 13:17:16,167 INFO L226 Difference]: Without dead ends: 1691 [2018-07-25 13:17:16,168 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:17:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2018-07-25 13:17:17,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1025. [2018-07-25 13:17:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2018-07-25 13:17:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 4437 transitions. [2018-07-25 13:17:17,255 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 4437 transitions. Word has length 7 [2018-07-25 13:17:17,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:17,255 INFO L472 AbstractCegarLoop]: Abstraction has 1025 states and 4437 transitions. [2018-07-25 13:17:17,255 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:17:17,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 4437 transitions. [2018-07-25 13:17:17,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:17:17,256 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:17,256 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:17,256 INFO L415 AbstractCegarLoop]: === Iteration 61 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:17,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1730207890, now seen corresponding path program 1 times [2018-07-25 13:17:17,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:17,266 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:17:17,266 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:17:17,267 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:17:17,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:17:17,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:17:17,267 INFO L87 Difference]: Start difference. First operand 1025 states and 4437 transitions. Second operand 8 states. [2018-07-25 13:17:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:20,113 INFO L93 Difference]: Finished difference Result 1997 states and 8274 transitions. [2018-07-25 13:17:20,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:17:20,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:17:20,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:20,118 INFO L225 Difference]: With dead ends: 1997 [2018-07-25 13:17:20,118 INFO L226 Difference]: Without dead ends: 1991 [2018-07-25 13:17:20,119 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:17:20,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2018-07-25 13:17:21,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1089. [2018-07-25 13:17:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2018-07-25 13:17:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 4710 transitions. [2018-07-25 13:17:21,270 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 4710 transitions. Word has length 7 [2018-07-25 13:17:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:21,270 INFO L472 AbstractCegarLoop]: Abstraction has 1089 states and 4710 transitions. [2018-07-25 13:17:21,270 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:17:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 4710 transitions. [2018-07-25 13:17:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:17:21,271 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:21,271 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:21,272 INFO L415 AbstractCegarLoop]: === Iteration 62 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:21,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1730207515, now seen corresponding path program 1 times [2018-07-25 13:17:21,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:21,283 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:17:21,283 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:17:21,283 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:17:21,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:17:21,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:17:21,284 INFO L87 Difference]: Start difference. First operand 1089 states and 4710 transitions. Second operand 8 states. [2018-07-25 13:17:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:23,529 INFO L93 Difference]: Finished difference Result 1637 states and 6902 transitions. [2018-07-25 13:17:23,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:17:23,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:17:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:23,534 INFO L225 Difference]: With dead ends: 1637 [2018-07-25 13:17:23,534 INFO L226 Difference]: Without dead ends: 1631 [2018-07-25 13:17:23,535 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:17:23,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2018-07-25 13:17:25,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1325. [2018-07-25 13:17:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2018-07-25 13:17:25,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 5776 transitions. [2018-07-25 13:17:25,160 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 5776 transitions. Word has length 7 [2018-07-25 13:17:25,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:25,161 INFO L472 AbstractCegarLoop]: Abstraction has 1325 states and 5776 transitions. [2018-07-25 13:17:25,161 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:17:25,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 5776 transitions. [2018-07-25 13:17:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:17:25,162 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:25,162 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:25,162 INFO L415 AbstractCegarLoop]: === Iteration 63 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:25,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1728542101, now seen corresponding path program 1 times [2018-07-25 13:17:25,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:25,173 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:17:25,173 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:17:25,174 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:17:25,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:17:25,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:17:25,174 INFO L87 Difference]: Start difference. First operand 1325 states and 5776 transitions. Second operand 8 states. [2018-07-25 13:17:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:27,623 INFO L93 Difference]: Finished difference Result 1882 states and 7972 transitions. [2018-07-25 13:17:27,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:17:27,623 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:17:27,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:27,627 INFO L225 Difference]: With dead ends: 1882 [2018-07-25 13:17:27,627 INFO L226 Difference]: Without dead ends: 1876 [2018-07-25 13:17:27,628 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:17:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2018-07-25 13:17:29,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1337. [2018-07-25 13:17:29,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-07-25 13:17:29,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 5824 transitions. [2018-07-25 13:17:29,165 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 5824 transitions. Word has length 7 [2018-07-25 13:17:29,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:29,166 INFO L472 AbstractCegarLoop]: Abstraction has 1337 states and 5824 transitions. [2018-07-25 13:17:29,166 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:17:29,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 5824 transitions. [2018-07-25 13:17:29,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:17:29,167 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:29,167 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:29,167 INFO L415 AbstractCegarLoop]: === Iteration 64 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:29,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1728541990, now seen corresponding path program 1 times [2018-07-25 13:17:29,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:29,178 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:17:29,178 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:17:29,178 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:17:29,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:17:29,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:17:29,179 INFO L87 Difference]: Start difference. First operand 1337 states and 5824 transitions. Second operand 8 states. [2018-07-25 13:17:31,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:31,504 INFO L93 Difference]: Finished difference Result 1874 states and 7946 transitions. [2018-07-25 13:17:31,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:17:31,504 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:17:31,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:31,508 INFO L225 Difference]: With dead ends: 1874 [2018-07-25 13:17:31,509 INFO L226 Difference]: Without dead ends: 1868 [2018-07-25 13:17:31,510 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:17:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2018-07-25 13:17:33,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1328. [2018-07-25 13:17:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2018-07-25 13:17:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 5794 transitions. [2018-07-25 13:17:33,013 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 5794 transitions. Word has length 7 [2018-07-25 13:17:33,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:33,014 INFO L472 AbstractCegarLoop]: Abstraction has 1328 states and 5794 transitions. [2018-07-25 13:17:33,014 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:17:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 5794 transitions. [2018-07-25 13:17:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:17:33,015 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:33,015 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:33,015 INFO L415 AbstractCegarLoop]: === Iteration 65 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:33,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1713256811, now seen corresponding path program 1 times [2018-07-25 13:17:33,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:33,023 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:17:33,024 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:17:33,024 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:17:33,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:17:33,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:17:33,024 INFO L87 Difference]: Start difference. First operand 1328 states and 5794 transitions. Second operand 8 states. [2018-07-25 13:17:35,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:35,744 INFO L93 Difference]: Finished difference Result 1819 states and 7620 transitions. [2018-07-25 13:17:35,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:17:35,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:17:35,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:35,749 INFO L225 Difference]: With dead ends: 1819 [2018-07-25 13:17:35,749 INFO L226 Difference]: Without dead ends: 1813 [2018-07-25 13:17:35,750 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:17:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2018-07-25 13:17:37,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1326. [2018-07-25 13:17:37,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2018-07-25 13:17:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 5781 transitions. [2018-07-25 13:17:37,461 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 5781 transitions. Word has length 7 [2018-07-25 13:17:37,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:37,462 INFO L472 AbstractCegarLoop]: Abstraction has 1326 states and 5781 transitions. [2018-07-25 13:17:37,462 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:17:37,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 5781 transitions. [2018-07-25 13:17:37,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:17:37,463 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:37,463 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:37,463 INFO L415 AbstractCegarLoop]: === Iteration 66 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:37,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1713256436, now seen corresponding path program 1 times [2018-07-25 13:17:37,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:37,472 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:17:37,472 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:17:37,473 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:17:37,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:17:37,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:17:37,473 INFO L87 Difference]: Start difference. First operand 1326 states and 5781 transitions. Second operand 8 states. [2018-07-25 13:17:40,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:40,451 INFO L93 Difference]: Finished difference Result 1894 states and 7994 transitions. [2018-07-25 13:17:40,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:17:40,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:17:40,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:40,455 INFO L225 Difference]: With dead ends: 1894 [2018-07-25 13:17:40,455 INFO L226 Difference]: Without dead ends: 1888 [2018-07-25 13:17:40,456 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:17:40,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2018-07-25 13:17:42,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1224. [2018-07-25 13:17:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2018-07-25 13:17:42,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 5364 transitions. [2018-07-25 13:17:42,007 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 5364 transitions. Word has length 7 [2018-07-25 13:17:42,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:42,007 INFO L472 AbstractCegarLoop]: Abstraction has 1224 states and 5364 transitions. [2018-07-25 13:17:42,007 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:17:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 5364 transitions. [2018-07-25 13:17:42,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:17:42,008 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:42,008 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:42,008 INFO L415 AbstractCegarLoop]: === Iteration 67 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:42,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1732623468, now seen corresponding path program 1 times [2018-07-25 13:17:42,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:42,018 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:17:42,018 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:17:42,018 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:17:42,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:17:42,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:17:42,019 INFO L87 Difference]: Start difference. First operand 1224 states and 5364 transitions. Second operand 8 states. [2018-07-25 13:17:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:44,638 INFO L93 Difference]: Finished difference Result 1823 states and 7639 transitions. [2018-07-25 13:17:44,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:17:44,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:17:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:44,643 INFO L225 Difference]: With dead ends: 1823 [2018-07-25 13:17:44,643 INFO L226 Difference]: Without dead ends: 1817 [2018-07-25 13:17:44,644 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:17:44,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2018-07-25 13:17:46,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1235. [2018-07-25 13:17:46,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-07-25 13:17:46,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 5415 transitions. [2018-07-25 13:17:46,162 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 5415 transitions. Word has length 7 [2018-07-25 13:17:46,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:46,163 INFO L472 AbstractCegarLoop]: Abstraction has 1235 states and 5415 transitions. [2018-07-25 13:17:46,163 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:17:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 5415 transitions. [2018-07-25 13:17:46,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:17:46,164 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:46,164 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:46,165 INFO L415 AbstractCegarLoop]: === Iteration 68 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:46,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1732623357, now seen corresponding path program 1 times [2018-07-25 13:17:46,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:46,179 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:17:46,179 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:17:46,179 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:17:46,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:17:46,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:17:46,180 INFO L87 Difference]: Start difference. First operand 1235 states and 5415 transitions. Second operand 8 states. [2018-07-25 13:17:48,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:48,299 INFO L93 Difference]: Finished difference Result 1502 states and 6388 transitions. [2018-07-25 13:17:48,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:17:48,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:17:48,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:48,303 INFO L225 Difference]: With dead ends: 1502 [2018-07-25 13:17:48,303 INFO L226 Difference]: Without dead ends: 1496 [2018-07-25 13:17:48,304 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:17:48,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2018-07-25 13:17:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1178. [2018-07-25 13:17:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1178 states. [2018-07-25 13:17:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 5168 transitions. [2018-07-25 13:17:49,778 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 5168 transitions. Word has length 7 [2018-07-25 13:17:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:49,778 INFO L472 AbstractCegarLoop]: Abstraction has 1178 states and 5168 transitions. [2018-07-25 13:17:49,778 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:17:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 5168 transitions. [2018-07-25 13:17:49,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:17:49,780 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:49,780 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:49,780 INFO L415 AbstractCegarLoop]: === Iteration 69 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:49,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1733834669, now seen corresponding path program 1 times [2018-07-25 13:17:49,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:49,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:49,794 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:17:49,794 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:17:49,794 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:17:49,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:17:49,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:17:49,794 INFO L87 Difference]: Start difference. First operand 1178 states and 5168 transitions. Second operand 8 states. [2018-07-25 13:17:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:52,746 INFO L93 Difference]: Finished difference Result 1741 states and 7341 transitions. [2018-07-25 13:17:52,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:17:52,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:17:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:52,750 INFO L225 Difference]: With dead ends: 1741 [2018-07-25 13:17:52,751 INFO L226 Difference]: Without dead ends: 1735 [2018-07-25 13:17:52,751 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:17:52,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2018-07-25 13:17:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1153. [2018-07-25 13:17:54,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-07-25 13:17:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 5047 transitions. [2018-07-25 13:17:54,390 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 5047 transitions. Word has length 7 [2018-07-25 13:17:54,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:54,390 INFO L472 AbstractCegarLoop]: Abstraction has 1153 states and 5047 transitions. [2018-07-25 13:17:54,390 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:17:54,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 5047 transitions. [2018-07-25 13:17:54,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:17:54,392 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:54,392 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:54,392 INFO L415 AbstractCegarLoop]: === Iteration 70 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:54,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1733834558, now seen corresponding path program 1 times [2018-07-25 13:17:54,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:54,409 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:17:54,409 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:17:54,409 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:17:54,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:17:54,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:17:54,410 INFO L87 Difference]: Start difference. First operand 1153 states and 5047 transitions. Second operand 8 states. [2018-07-25 13:17:57,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:17:57,444 INFO L93 Difference]: Finished difference Result 1712 states and 7222 transitions. [2018-07-25 13:17:57,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:17:57,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:17:57,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:17:57,448 INFO L225 Difference]: With dead ends: 1712 [2018-07-25 13:17:57,448 INFO L226 Difference]: Without dead ends: 1710 [2018-07-25 13:17:57,449 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:17:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2018-07-25 13:17:59,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1145. [2018-07-25 13:17:59,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-07-25 13:17:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 5012 transitions. [2018-07-25 13:17:59,131 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 5012 transitions. Word has length 7 [2018-07-25 13:17:59,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:17:59,132 INFO L472 AbstractCegarLoop]: Abstraction has 1145 states and 5012 transitions. [2018-07-25 13:17:59,132 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:17:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 5012 transitions. [2018-07-25 13:17:59,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:17:59,133 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:17:59,133 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:17:59,133 INFO L415 AbstractCegarLoop]: === Iteration 71 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:17:59,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1733848743, now seen corresponding path program 1 times [2018-07-25 13:17:59,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:17:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:17:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:17:59,147 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:17:59,147 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:17:59,147 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:17:59,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:17:59,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:17:59,148 INFO L87 Difference]: Start difference. First operand 1145 states and 5012 transitions. Second operand 8 states. [2018-07-25 13:18:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:02,119 INFO L93 Difference]: Finished difference Result 1724 states and 7267 transitions. [2018-07-25 13:18:02,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:18:02,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:18:02,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:02,124 INFO L225 Difference]: With dead ends: 1724 [2018-07-25 13:18:02,124 INFO L226 Difference]: Without dead ends: 1722 [2018-07-25 13:18:02,124 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:18:02,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2018-07-25 13:18:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1145. [2018-07-25 13:18:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-07-25 13:18:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 5010 transitions. [2018-07-25 13:18:03,630 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 5010 transitions. Word has length 7 [2018-07-25 13:18:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:03,631 INFO L472 AbstractCegarLoop]: Abstraction has 1145 states and 5010 transitions. [2018-07-25 13:18:03,631 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:18:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 5010 transitions. [2018-07-25 13:18:03,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:18:03,631 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:03,632 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:03,632 INFO L415 AbstractCegarLoop]: === Iteration 72 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:03,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1733848632, now seen corresponding path program 1 times [2018-07-25 13:18:03,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:03,650 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:18:03,650 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-07-25 13:18:03,650 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:18:03,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:18:03,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:18:03,650 INFO L87 Difference]: Start difference. First operand 1145 states and 5010 transitions. Second operand 8 states. [2018-07-25 13:18:06,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:06,479 INFO L93 Difference]: Finished difference Result 1680 states and 7092 transitions. [2018-07-25 13:18:06,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:18:06,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-07-25 13:18:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:06,483 INFO L225 Difference]: With dead ends: 1680 [2018-07-25 13:18:06,483 INFO L226 Difference]: Without dead ends: 1674 [2018-07-25 13:18:06,483 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:18:06,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2018-07-25 13:18:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1057. [2018-07-25 13:18:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2018-07-25 13:18:07,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 4579 transitions. [2018-07-25 13:18:07,935 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 4579 transitions. Word has length 7 [2018-07-25 13:18:07,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:07,935 INFO L472 AbstractCegarLoop]: Abstraction has 1057 states and 4579 transitions. [2018-07-25 13:18:07,935 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:18:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 4579 transitions. [2018-07-25 13:18:07,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:18:07,936 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:07,936 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:07,936 INFO L415 AbstractCegarLoop]: === Iteration 73 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:07,937 INFO L82 PathProgramCache]: Analyzing trace with hash -969552830, now seen corresponding path program 1 times [2018-07-25 13:18:07,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:07,948 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:18:07,949 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:18:07,949 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:18:07,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:18:07,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:18:07,949 INFO L87 Difference]: Start difference. First operand 1057 states and 4579 transitions. Second operand 8 states. [2018-07-25 13:18:13,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:13,154 INFO L93 Difference]: Finished difference Result 3153 states and 12748 transitions. [2018-07-25 13:18:13,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:18:13,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:18:13,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:13,162 INFO L225 Difference]: With dead ends: 3153 [2018-07-25 13:18:13,162 INFO L226 Difference]: Without dead ends: 3144 [2018-07-25 13:18:13,163 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:18:13,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2018-07-25 13:18:15,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 1718. [2018-07-25 13:18:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2018-07-25 13:18:15,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 7792 transitions. [2018-07-25 13:18:15,687 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 7792 transitions. Word has length 8 [2018-07-25 13:18:15,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:15,688 INFO L472 AbstractCegarLoop]: Abstraction has 1718 states and 7792 transitions. [2018-07-25 13:18:15,688 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:18:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 7792 transitions. [2018-07-25 13:18:15,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:18:15,689 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:15,689 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:15,689 INFO L415 AbstractCegarLoop]: === Iteration 74 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:15,690 INFO L82 PathProgramCache]: Analyzing trace with hash -969552827, now seen corresponding path program 1 times [2018-07-25 13:18:15,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:15,700 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:18:15,700 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:18:15,700 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:18:15,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:18:15,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:18:15,701 INFO L87 Difference]: Start difference. First operand 1718 states and 7792 transitions. Second operand 8 states. [2018-07-25 13:18:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:21,320 INFO L93 Difference]: Finished difference Result 3177 states and 12838 transitions. [2018-07-25 13:18:21,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:18:21,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:18:21,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:21,330 INFO L225 Difference]: With dead ends: 3177 [2018-07-25 13:18:21,330 INFO L226 Difference]: Without dead ends: 3168 [2018-07-25 13:18:21,331 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:18:21,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3168 states. [2018-07-25 13:18:23,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3168 to 1750. [2018-07-25 13:18:23,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-07-25 13:18:23,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 7931 transitions. [2018-07-25 13:18:23,924 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 7931 transitions. Word has length 8 [2018-07-25 13:18:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:23,924 INFO L472 AbstractCegarLoop]: Abstraction has 1750 states and 7931 transitions. [2018-07-25 13:18:23,924 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:18:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 7931 transitions. [2018-07-25 13:18:23,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:18:23,925 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:23,925 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:23,926 INFO L415 AbstractCegarLoop]: === Iteration 75 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:23,926 INFO L82 PathProgramCache]: Analyzing trace with hash -969552824, now seen corresponding path program 1 times [2018-07-25 13:18:23,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:23,935 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:18:23,935 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:18:23,936 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:18:23,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:18:23,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:18:23,936 INFO L87 Difference]: Start difference. First operand 1750 states and 7931 transitions. Second operand 8 states. [2018-07-25 13:18:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:29,730 INFO L93 Difference]: Finished difference Result 3626 states and 14920 transitions. [2018-07-25 13:18:29,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:18:29,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:18:29,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:29,739 INFO L225 Difference]: With dead ends: 3626 [2018-07-25 13:18:29,739 INFO L226 Difference]: Without dead ends: 3617 [2018-07-25 13:18:29,740 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:18:29,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3617 states. [2018-07-25 13:18:32,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3617 to 1819. [2018-07-25 13:18:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819 states. [2018-07-25 13:18:32,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 8233 transitions. [2018-07-25 13:18:32,415 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 8233 transitions. Word has length 8 [2018-07-25 13:18:32,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:32,415 INFO L472 AbstractCegarLoop]: Abstraction has 1819 states and 8233 transitions. [2018-07-25 13:18:32,415 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:18:32,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 8233 transitions. [2018-07-25 13:18:32,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:18:32,416 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:32,416 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:32,417 INFO L415 AbstractCegarLoop]: === Iteration 76 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:32,417 INFO L82 PathProgramCache]: Analyzing trace with hash -982478745, now seen corresponding path program 1 times [2018-07-25 13:18:32,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:32,432 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:18:32,432 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:18:32,432 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:18:32,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:18:32,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:18:32,433 INFO L87 Difference]: Start difference. First operand 1819 states and 8233 transitions. Second operand 8 states. [2018-07-25 13:18:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:41,926 INFO L93 Difference]: Finished difference Result 4839 states and 19523 transitions. [2018-07-25 13:18:41,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:18:41,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:18:41,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:41,940 INFO L225 Difference]: With dead ends: 4839 [2018-07-25 13:18:41,940 INFO L226 Difference]: Without dead ends: 4830 [2018-07-25 13:18:41,941 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:18:41,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4830 states. [2018-07-25 13:18:45,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4830 to 1873. [2018-07-25 13:18:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2018-07-25 13:18:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 8515 transitions. [2018-07-25 13:18:45,126 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 8515 transitions. Word has length 8 [2018-07-25 13:18:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:45,126 INFO L472 AbstractCegarLoop]: Abstraction has 1873 states and 8515 transitions. [2018-07-25 13:18:45,126 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:18:45,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 8515 transitions. [2018-07-25 13:18:45,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:18:45,127 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:45,128 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:45,128 INFO L415 AbstractCegarLoop]: === Iteration 77 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:45,128 INFO L82 PathProgramCache]: Analyzing trace with hash -982478742, now seen corresponding path program 1 times [2018-07-25 13:18:45,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:45,143 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:18:45,143 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:18:45,143 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:18:45,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:18:45,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:18:45,143 INFO L87 Difference]: Start difference. First operand 1873 states and 8515 transitions. Second operand 8 states. [2018-07-25 13:18:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:18:52,640 INFO L93 Difference]: Finished difference Result 4115 states and 16897 transitions. [2018-07-25 13:18:52,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:18:52,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:18:52,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:18:52,649 INFO L225 Difference]: With dead ends: 4115 [2018-07-25 13:18:52,649 INFO L226 Difference]: Without dead ends: 4106 [2018-07-25 13:18:52,650 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:18:52,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-07-25 13:18:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 1907. [2018-07-25 13:18:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2018-07-25 13:18:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 8653 transitions. [2018-07-25 13:18:55,608 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 8653 transitions. Word has length 8 [2018-07-25 13:18:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:18:55,608 INFO L472 AbstractCegarLoop]: Abstraction has 1907 states and 8653 transitions. [2018-07-25 13:18:55,609 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:18:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 8653 transitions. [2018-07-25 13:18:55,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:18:55,610 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:18:55,610 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:18:55,610 INFO L415 AbstractCegarLoop]: === Iteration 78 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:18:55,610 INFO L82 PathProgramCache]: Analyzing trace with hash -982478739, now seen corresponding path program 1 times [2018-07-25 13:18:55,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:18:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:18:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:18:55,622 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:18:55,622 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:18:55,622 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:18:55,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:18:55,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:18:55,623 INFO L87 Difference]: Start difference. First operand 1907 states and 8653 transitions. Second operand 8 states. [2018-07-25 13:19:03,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:03,865 INFO L93 Difference]: Finished difference Result 4545 states and 18503 transitions. [2018-07-25 13:19:03,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:19:03,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:19:03,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:03,876 INFO L225 Difference]: With dead ends: 4545 [2018-07-25 13:19:03,877 INFO L226 Difference]: Without dead ends: 4536 [2018-07-25 13:19:03,878 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=282, Invalid=1124, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:19:03,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2018-07-25 13:19:07,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 2006. [2018-07-25 13:19:07,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2018-07-25 13:19:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 9153 transitions. [2018-07-25 13:19:07,144 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 9153 transitions. Word has length 8 [2018-07-25 13:19:07,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:07,144 INFO L472 AbstractCegarLoop]: Abstraction has 2006 states and 9153 transitions. [2018-07-25 13:19:07,144 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:19:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 9153 transitions. [2018-07-25 13:19:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:19:07,145 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:07,145 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:07,145 INFO L415 AbstractCegarLoop]: === Iteration 79 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:07,145 INFO L82 PathProgramCache]: Analyzing trace with hash -982470592, now seen corresponding path program 1 times [2018-07-25 13:19:07,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:07,159 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:19:07,159 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:19:07,159 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:19:07,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:19:07,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:19:07,159 INFO L87 Difference]: Start difference. First operand 2006 states and 9153 transitions. Second operand 8 states. [2018-07-25 13:19:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:16,424 INFO L93 Difference]: Finished difference Result 4713 states and 19244 transitions. [2018-07-25 13:19:16,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:19:16,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:19:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:16,434 INFO L225 Difference]: With dead ends: 4713 [2018-07-25 13:19:16,435 INFO L226 Difference]: Without dead ends: 4704 [2018-07-25 13:19:16,435 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=323, Invalid=1399, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:19:16,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4704 states. [2018-07-25 13:19:19,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4704 to 2044. [2018-07-25 13:19:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2018-07-25 13:19:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 9327 transitions. [2018-07-25 13:19:19,737 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 9327 transitions. Word has length 8 [2018-07-25 13:19:19,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:19,737 INFO L472 AbstractCegarLoop]: Abstraction has 2044 states and 9327 transitions. [2018-07-25 13:19:19,737 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:19:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 9327 transitions. [2018-07-25 13:19:19,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:19:19,738 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:19,738 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:19,738 INFO L415 AbstractCegarLoop]: === Iteration 80 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:19,739 INFO L82 PathProgramCache]: Analyzing trace with hash -982470589, now seen corresponding path program 1 times [2018-07-25 13:19:19,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:19,752 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:19:19,752 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:19:19,752 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:19:19,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:19:19,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:19:19,753 INFO L87 Difference]: Start difference. First operand 2044 states and 9327 transitions. Second operand 8 states. [2018-07-25 13:19:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:28,954 INFO L93 Difference]: Finished difference Result 4499 states and 18655 transitions. [2018-07-25 13:19:28,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:19:28,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:19:28,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:28,964 INFO L225 Difference]: With dead ends: 4499 [2018-07-25 13:19:28,965 INFO L226 Difference]: Without dead ends: 4490 [2018-07-25 13:19:28,965 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:19:28,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-07-25 13:19:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 2041. [2018-07-25 13:19:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2018-07-25 13:19:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 9313 transitions. [2018-07-25 13:19:32,303 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 9313 transitions. Word has length 8 [2018-07-25 13:19:32,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:32,303 INFO L472 AbstractCegarLoop]: Abstraction has 2041 states and 9313 transitions. [2018-07-25 13:19:32,303 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:19:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 9313 transitions. [2018-07-25 13:19:32,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:19:32,304 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:32,304 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:32,304 INFO L415 AbstractCegarLoop]: === Iteration 81 === [productErr6ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:32,305 INFO L82 PathProgramCache]: Analyzing trace with hash -982470586, now seen corresponding path program 1 times [2018-07-25 13:19:32,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:32,313 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:19:32,313 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-07-25 13:19:32,313 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:19:32,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:19:32,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:19:32,314 INFO L87 Difference]: Start difference. First operand 2041 states and 9313 transitions. Second operand 8 states. [2018-07-25 13:19:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:41,488 INFO L93 Difference]: Finished difference Result 4601 states and 18796 transitions. [2018-07-25 13:19:41,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:19:41,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:19:41,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:41,499 INFO L225 Difference]: With dead ends: 4601 [2018-07-25 13:19:41,499 INFO L226 Difference]: Without dead ends: 4598 [2018-07-25 13:19:41,500 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=279, Invalid=1127, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:19:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4598 states. Received shutdown request... [2018-07-25 13:19:44,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4598 to 2032. [2018-07-25 13:19:44,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2032 states. [2018-07-25 13:19:44,889 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:19:44,894 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:19:44,895 INFO L202 PluginConnector]: Adding new model threadpooling_out3.mover.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:19:44 BoogieIcfgContainer [2018-07-25 13:19:44,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:19:44,896 INFO L168 Benchmark]: Toolchain (without parser) took 250954.71 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 399.5 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-07-25 13:19:44,898 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:19:44,898 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:19:44,899 INFO L168 Benchmark]: Boogie Preprocessor took 63.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:19:44,899 INFO L168 Benchmark]: RCFGBuilder took 653.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-07-25 13:19:44,900 INFO L168 Benchmark]: TraceAbstraction took 250172.00 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 378.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-07-25 13:19:44,903 INFO L336 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 653.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250172.00 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 378.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 316]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 316). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 194]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 194). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 624]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 624). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 645). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 95). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 199). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 589). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 675). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 574). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 640). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 847]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 847). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 71). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 816]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 816). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 800]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 800). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 263]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 263). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 470]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 470). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 446]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 446). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 660). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 594]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 594). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 604]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 604). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 223]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 223). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 584]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 584). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 599]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 599). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 337). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 569). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 579). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 832]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 832). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 27 error locations. TIMEOUT Result, 250.1s OverallTime, 81 OverallIterations, 2 TraceHistogramMax, 171.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17770 SDtfs, 35133 SDslu, 26463 SDs, 0 SdLazy, 172196 SolverSat, 17661 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1332 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4511 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2044occurred in iteration=79, 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: 76.2s AutomataMinimizationTime, 81 MinimizatonAttempts, 46079 StatesRemovedByMinimization, 80 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 529 NumberOfCodeBlocks, 529 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 448 ConstructedInterpolants, 0 QuantifiedInterpolants, 23638 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 81 InterpolantComputations, 81 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-19-44-915.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3.mover.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-19-44-915.csv Completed graceful shutdown