java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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_product_WithProcedures.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:06:37,548 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:06:37,551 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:06:37,566 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:06:37,567 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:06:37,568 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:06:37,569 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:06:37,571 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:06:37,572 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:06:37,573 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:06:37,574 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:06:37,574 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:06:37,575 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:06:37,576 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:06:37,577 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:06:37,578 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:06:37,579 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:06:37,580 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:06:37,582 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:06:37,584 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:06:37,585 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:06:37,586 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:06:37,592 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:06:37,592 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:06:37,592 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:06:37,593 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:06:37,596 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:06:37,598 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:06:37,599 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:06:37,600 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:06:37,600 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:06:37,601 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:06:37,601 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:06:37,604 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:06:37,605 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:06:37,606 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:06:37,607 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:06:37,622 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:06:37,623 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:06:37,624 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:06:37,624 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:06:37,625 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:06:37,625 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:06:37,625 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:06:37,625 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:06:37,678 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:06:37,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:06:37,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:06:37,699 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:06:37,700 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:06:37,700 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl [2018-09-26 08:06:37,701 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl' [2018-09-26 08:06:37,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:06:37,783 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:06:37,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:37,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:06:37,784 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:06:37,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:37" (1/1) ... [2018-09-26 08:06:37,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:37" (1/1) ... [2018-09-26 08:06:37,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:06:37,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:06:37,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:06:37,826 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:06:37,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:37" (1/1) ... [2018-09-26 08:06:37,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:37" (1/1) ... [2018-09-26 08:06:37,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:37" (1/1) ... [2018-09-26 08:06:37,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:37" (1/1) ... [2018-09-26 08:06:37,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:37" (1/1) ... [2018-09-26 08:06:37,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:37" (1/1) ... [2018-09-26 08:06:37,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:37" (1/1) ... [2018-09-26 08:06:37,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:06:37,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:06:37,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:06:37,850 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:06:37,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:37" (1/1) ... [2018-09-26 08:06:37,931 INFO L130 BoogieDeclarations]: Found specification of procedure l1l0 [2018-09-26 08:06:37,931 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l0 [2018-09-26 08:06:37,931 INFO L130 BoogieDeclarations]: Found specification of procedure l0l1 [2018-09-26 08:06:37,932 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l1 [2018-09-26 08:06:37,932 INFO L130 BoogieDeclarations]: Found specification of procedure l0l0 [2018-09-26 08:06:37,932 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l0 [2018-09-26 08:06:37,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:06:37,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:06:37,932 INFO L130 BoogieDeclarations]: Found specification of procedure l1l1 [2018-09-26 08:06:37,933 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l1 [2018-09-26 08:06:38,124 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:06:38,125 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:38 BoogieIcfgContainer [2018-09-26 08:06:38,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:06:38,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:06:38,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:06:38,135 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:06:38,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:06:37" (1/2) ... [2018-09-26 08:06:38,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7029b9e6 and model type threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:06:38, skipping insertion in model container [2018-09-26 08:06:38,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:06:38" (2/2) ... [2018-09-26 08:06:38,139 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithProcedures.bpl [2018-09-26 08:06:38,151 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:06:38,159 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-09-26 08:06:38,209 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:06:38,210 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:06:38,210 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:06:38,211 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:06:38,211 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:06:38,211 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:06:38,211 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:06:38,211 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:06:38,212 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:06:38,231 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-09-26 08:06:38,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:06:38,241 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:38,242 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:38,244 INFO L423 AbstractCegarLoop]: === Iteration 1 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:38,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:38,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1282157605, now seen corresponding path program 1 times [2018-09-26 08:06:38,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:38,416 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:38,416 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:06:38,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:38,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:38,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:38,436 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-09-26 08:06:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:38,704 INFO L93 Difference]: Finished difference Result 72 states and 100 transitions. [2018-09-26 08:06:38,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:06:38,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-26 08:06:38,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:38,720 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:06:38,720 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:06:38,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:38,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:06:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2018-09-26 08:06:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 08:06:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2018-09-26 08:06:38,790 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 7 [2018-09-26 08:06:38,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:38,790 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2018-09-26 08:06:38,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:38,791 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2018-09-26 08:06:38,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:06:38,792 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:38,792 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:38,792 INFO L423 AbstractCegarLoop]: === Iteration 2 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:38,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:38,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1272619553, now seen corresponding path program 1 times [2018-09-26 08:06:38,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:38,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-09-26 08:06:38,828 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:38,828 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 08:06:38,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:38,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:38,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:38,831 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 6 states. [2018-09-26 08:06:38,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:38,994 INFO L93 Difference]: Finished difference Result 81 states and 113 transitions. [2018-09-26 08:06:38,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:06:38,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-26 08:06:38,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:39,000 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:06:39,000 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:06:39,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:39,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:06:39,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2018-09-26 08:06:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:06:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2018-09-26 08:06:39,033 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 7 [2018-09-26 08:06:39,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:39,034 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2018-09-26 08:06:39,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2018-09-26 08:06:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:39,036 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:39,036 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:39,036 INFO L423 AbstractCegarLoop]: === Iteration 3 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:39,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:39,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1601446133, now seen corresponding path program 1 times [2018-09-26 08:06:39,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:39,081 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:39,082 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 08:06:39,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:39,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:39,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:39,083 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand 7 states. [2018-09-26 08:06:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:39,427 INFO L93 Difference]: Finished difference Result 122 states and 175 transitions. [2018-09-26 08:06:39,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:39,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-09-26 08:06:39,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:39,430 INFO L225 Difference]: With dead ends: 122 [2018-09-26 08:06:39,431 INFO L226 Difference]: Without dead ends: 120 [2018-09-26 08:06:39,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:39,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-09-26 08:06:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 73. [2018-09-26 08:06:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:06:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2018-09-26 08:06:39,465 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 10 [2018-09-26 08:06:39,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:39,466 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2018-09-26 08:06:39,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:39,466 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2018-09-26 08:06:39,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:06:39,468 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:39,468 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:39,468 INFO L423 AbstractCegarLoop]: === Iteration 4 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:39,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:39,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1152651256, now seen corresponding path program 1 times [2018-09-26 08:06:39,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:39,508 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:39,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:06:39,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:39,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:39,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:39,512 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand 7 states. [2018-09-26 08:06:39,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:39,726 INFO L93 Difference]: Finished difference Result 143 states and 208 transitions. [2018-09-26 08:06:39,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:06:39,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-09-26 08:06:39,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:39,728 INFO L225 Difference]: With dead ends: 143 [2018-09-26 08:06:39,729 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 08:06:39,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:06:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 08:06:39,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 85. [2018-09-26 08:06:39,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:06:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2018-09-26 08:06:39,758 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 10 [2018-09-26 08:06:39,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:39,761 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2018-09-26 08:06:39,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2018-09-26 08:06:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:06:39,764 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:39,767 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:39,768 INFO L423 AbstractCegarLoop]: === Iteration 5 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:39,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:39,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1536370777, now seen corresponding path program 1 times [2018-09-26 08:06:39,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:39,804 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:39,804 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:06:39,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:39,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:39,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:39,806 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand 6 states. [2018-09-26 08:06:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:39,904 INFO L93 Difference]: Finished difference Result 152 states and 223 transitions. [2018-09-26 08:06:39,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:06:39,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-09-26 08:06:39,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:39,906 INFO L225 Difference]: With dead ends: 152 [2018-09-26 08:06:39,906 INFO L226 Difference]: Without dead ends: 150 [2018-09-26 08:06:39,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:39,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-26 08:06:39,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 96. [2018-09-26 08:06:39,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:06:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2018-09-26 08:06:39,929 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 11 [2018-09-26 08:06:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:39,929 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2018-09-26 08:06:39,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:39,929 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2018-09-26 08:06:39,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:06:39,931 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:39,931 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:39,932 INFO L423 AbstractCegarLoop]: === Iteration 6 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:39,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:39,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1150793287, now seen corresponding path program 1 times [2018-09-26 08:06:39,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:39,956 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:39,956 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:06:39,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:06:39,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:06:39,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:06:39,957 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand 6 states. [2018-09-26 08:06:40,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:40,060 INFO L93 Difference]: Finished difference Result 167 states and 245 transitions. [2018-09-26 08:06:40,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:06:40,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-09-26 08:06:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:40,062 INFO L225 Difference]: With dead ends: 167 [2018-09-26 08:06:40,063 INFO L226 Difference]: Without dead ends: 165 [2018-09-26 08:06:40,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:40,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-26 08:06:40,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 106. [2018-09-26 08:06:40,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 08:06:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2018-09-26 08:06:40,089 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 11 [2018-09-26 08:06:40,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:40,090 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2018-09-26 08:06:40,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:06:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2018-09-26 08:06:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:40,092 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:40,092 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:40,092 INFO L423 AbstractCegarLoop]: === Iteration 7 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:40,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:40,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1829652612, now seen corresponding path program 1 times [2018-09-26 08:06:40,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:40,128 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:40,128 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:06:40,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:40,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:40,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:40,130 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand 7 states. [2018-09-26 08:06:40,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:40,358 INFO L93 Difference]: Finished difference Result 241 states and 352 transitions. [2018-09-26 08:06:40,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:40,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-09-26 08:06:40,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:40,361 INFO L225 Difference]: With dead ends: 241 [2018-09-26 08:06:40,361 INFO L226 Difference]: Without dead ends: 239 [2018-09-26 08:06:40,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:40,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-26 08:06:40,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 151. [2018-09-26 08:06:40,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:06:40,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 221 transitions. [2018-09-26 08:06:40,399 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 221 transitions. Word has length 13 [2018-09-26 08:06:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:40,399 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 221 transitions. [2018-09-26 08:06:40,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:40,400 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 221 transitions. [2018-09-26 08:06:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:06:40,401 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:40,401 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:40,402 INFO L423 AbstractCegarLoop]: === Iteration 8 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:40,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:40,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1159232837, now seen corresponding path program 2 times [2018-09-26 08:06:40,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:40,444 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:40,444 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:40,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:40,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:40,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:40,446 INFO L87 Difference]: Start difference. First operand 151 states and 221 transitions. Second operand 8 states. [2018-09-26 08:06:40,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:40,705 INFO L93 Difference]: Finished difference Result 285 states and 419 transitions. [2018-09-26 08:06:40,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:40,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-09-26 08:06:40,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:40,708 INFO L225 Difference]: With dead ends: 285 [2018-09-26 08:06:40,709 INFO L226 Difference]: Without dead ends: 283 [2018-09-26 08:06:40,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:40,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-09-26 08:06:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 198. [2018-09-26 08:06:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-09-26 08:06:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 292 transitions. [2018-09-26 08:06:40,760 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 292 transitions. Word has length 13 [2018-09-26 08:06:40,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:40,760 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 292 transitions. [2018-09-26 08:06:40,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 292 transitions. [2018-09-26 08:06:40,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:06:40,762 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:40,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:40,762 INFO L423 AbstractCegarLoop]: === Iteration 9 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:40,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:40,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1433054771, now seen corresponding path program 1 times [2018-09-26 08:06:40,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:40,784 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:40,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:06:40,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:40,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:40,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:40,785 INFO L87 Difference]: Start difference. First operand 198 states and 292 transitions. Second operand 7 states. [2018-09-26 08:06:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:41,024 INFO L93 Difference]: Finished difference Result 374 states and 561 transitions. [2018-09-26 08:06:41,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:41,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-09-26 08:06:41,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:41,028 INFO L225 Difference]: With dead ends: 374 [2018-09-26 08:06:41,028 INFO L226 Difference]: Without dead ends: 372 [2018-09-26 08:06:41,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-09-26 08:06:41,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 242. [2018-09-26 08:06:41,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-09-26 08:06:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 361 transitions. [2018-09-26 08:06:41,102 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 361 transitions. Word has length 14 [2018-09-26 08:06:41,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:41,103 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 361 transitions. [2018-09-26 08:06:41,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:41,103 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 361 transitions. [2018-09-26 08:06:41,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:06:41,104 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:41,105 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:41,105 INFO L423 AbstractCegarLoop]: === Iteration 10 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:41,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:41,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1436992942, now seen corresponding path program 1 times [2018-09-26 08:06:41,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:41,147 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:41,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:41,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:41,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:41,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:41,149 INFO L87 Difference]: Start difference. First operand 242 states and 361 transitions. Second operand 8 states. [2018-09-26 08:06:41,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:41,472 INFO L93 Difference]: Finished difference Result 367 states and 555 transitions. [2018-09-26 08:06:41,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:41,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-26 08:06:41,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:41,477 INFO L225 Difference]: With dead ends: 367 [2018-09-26 08:06:41,478 INFO L226 Difference]: Without dead ends: 365 [2018-09-26 08:06:41,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-09-26 08:06:41,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 242. [2018-09-26 08:06:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-09-26 08:06:41,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 361 transitions. [2018-09-26 08:06:41,561 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 361 transitions. Word has length 14 [2018-09-26 08:06:41,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:41,562 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 361 transitions. [2018-09-26 08:06:41,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:41,562 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 361 transitions. [2018-09-26 08:06:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:06:41,563 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:41,563 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:41,564 INFO L423 AbstractCegarLoop]: === Iteration 11 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:41,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:41,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1436993326, now seen corresponding path program 1 times [2018-09-26 08:06:41,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:41,601 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:41,601 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:41,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:41,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:41,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:41,603 INFO L87 Difference]: Start difference. First operand 242 states and 361 transitions. Second operand 8 states. [2018-09-26 08:06:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:41,905 INFO L93 Difference]: Finished difference Result 408 states and 613 transitions. [2018-09-26 08:06:41,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:41,906 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-26 08:06:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:41,910 INFO L225 Difference]: With dead ends: 408 [2018-09-26 08:06:41,911 INFO L226 Difference]: Without dead ends: 406 [2018-09-26 08:06:41,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:41,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-09-26 08:06:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 274. [2018-09-26 08:06:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-09-26 08:06:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 411 transitions. [2018-09-26 08:06:42,011 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 411 transitions. Word has length 14 [2018-09-26 08:06:42,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:42,011 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 411 transitions. [2018-09-26 08:06:42,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 411 transitions. [2018-09-26 08:06:42,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:06:42,015 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:42,015 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:42,015 INFO L423 AbstractCegarLoop]: === Iteration 12 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:42,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:42,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1791986342, now seen corresponding path program 1 times [2018-09-26 08:06:42,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:42,048 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:42,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:42,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:42,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:42,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:42,051 INFO L87 Difference]: Start difference. First operand 274 states and 411 transitions. Second operand 8 states. [2018-09-26 08:06:42,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:42,411 INFO L93 Difference]: Finished difference Result 429 states and 646 transitions. [2018-09-26 08:06:42,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:42,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-26 08:06:42,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:42,417 INFO L225 Difference]: With dead ends: 429 [2018-09-26 08:06:42,417 INFO L226 Difference]: Without dead ends: 427 [2018-09-26 08:06:42,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:42,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-09-26 08:06:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 287. [2018-09-26 08:06:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-09-26 08:06:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 429 transitions. [2018-09-26 08:06:42,512 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 429 transitions. Word has length 14 [2018-09-26 08:06:42,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:42,513 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 429 transitions. [2018-09-26 08:06:42,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 429 transitions. [2018-09-26 08:06:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:06:42,514 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:42,515 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:42,515 INFO L423 AbstractCegarLoop]: === Iteration 13 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:42,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:42,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1412559370, now seen corresponding path program 1 times [2018-09-26 08:06:42,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 08:06:42,529 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:42,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:06:42,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:06:42,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:06:42,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:42,531 INFO L87 Difference]: Start difference. First operand 287 states and 429 transitions. Second operand 4 states. [2018-09-26 08:06:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:42,625 INFO L93 Difference]: Finished difference Result 428 states and 641 transitions. [2018-09-26 08:06:42,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:06:42,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-09-26 08:06:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:42,627 INFO L225 Difference]: With dead ends: 428 [2018-09-26 08:06:42,627 INFO L226 Difference]: Without dead ends: 273 [2018-09-26 08:06:42,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-09-26 08:06:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-09-26 08:06:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-09-26 08:06:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 399 transitions. [2018-09-26 08:06:42,721 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 399 transitions. Word has length 14 [2018-09-26 08:06:42,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:42,721 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 399 transitions. [2018-09-26 08:06:42,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:06:42,721 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 399 transitions. [2018-09-26 08:06:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:06:42,724 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:42,724 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:42,724 INFO L423 AbstractCegarLoop]: === Iteration 14 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:42,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:42,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1697430606, now seen corresponding path program 1 times [2018-09-26 08:06:42,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 08:06:42,741 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:06:42,741 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:06:42,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:06:42,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:06:42,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:06:42,745 INFO L87 Difference]: Start difference. First operand 273 states and 399 transitions. Second operand 4 states. [2018-09-26 08:06:42,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:42,833 INFO L93 Difference]: Finished difference Result 399 states and 584 transitions. [2018-09-26 08:06:42,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:06:42,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-09-26 08:06:42,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:42,836 INFO L225 Difference]: With dead ends: 399 [2018-09-26 08:06:42,836 INFO L226 Difference]: Without dead ends: 225 [2018-09-26 08:06:42,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:06:42,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-26 08:06:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-09-26 08:06:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-26 08:06:42,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 316 transitions. [2018-09-26 08:06:42,910 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 316 transitions. Word has length 14 [2018-09-26 08:06:42,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:42,910 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 316 transitions. [2018-09-26 08:06:42,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:06:42,910 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 316 transitions. [2018-09-26 08:06:42,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:06:42,911 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:42,911 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:42,911 INFO L423 AbstractCegarLoop]: === Iteration 15 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:42,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:42,912 INFO L82 PathProgramCache]: Analyzing trace with hash 844488035, now seen corresponding path program 1 times [2018-09-26 08:06:42,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:42,938 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:42,938 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:06:42,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:06:42,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:06:42,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:06:42,939 INFO L87 Difference]: Start difference. First operand 225 states and 316 transitions. Second operand 7 states. [2018-09-26 08:06:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:43,112 INFO L93 Difference]: Finished difference Result 297 states and 415 transitions. [2018-09-26 08:06:43,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:43,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-09-26 08:06:43,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:43,114 INFO L225 Difference]: With dead ends: 297 [2018-09-26 08:06:43,115 INFO L226 Difference]: Without dead ends: 295 [2018-09-26 08:06:43,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:06:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-09-26 08:06:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 262. [2018-09-26 08:06:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-09-26 08:06:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 371 transitions. [2018-09-26 08:06:43,197 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 371 transitions. Word has length 14 [2018-09-26 08:06:43,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:43,197 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 371 transitions. [2018-09-26 08:06:43,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:06:43,198 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 371 transitions. [2018-09-26 08:06:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:06:43,198 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:43,198 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:43,199 INFO L423 AbstractCegarLoop]: === Iteration 16 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:43,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:43,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1052420626, now seen corresponding path program 1 times [2018-09-26 08:06:43,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:43,221 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:43,221 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:43,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:43,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:43,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:43,222 INFO L87 Difference]: Start difference. First operand 262 states and 371 transitions. Second operand 8 states. [2018-09-26 08:06:43,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:43,401 INFO L93 Difference]: Finished difference Result 326 states and 461 transitions. [2018-09-26 08:06:43,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:43,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-26 08:06:43,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:43,404 INFO L225 Difference]: With dead ends: 326 [2018-09-26 08:06:43,404 INFO L226 Difference]: Without dead ends: 324 [2018-09-26 08:06:43,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:43,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-09-26 08:06:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 301. [2018-09-26 08:06:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-26 08:06:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 429 transitions. [2018-09-26 08:06:43,507 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 429 transitions. Word has length 14 [2018-09-26 08:06:43,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:43,507 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 429 transitions. [2018-09-26 08:06:43,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 429 transitions. [2018-09-26 08:06:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:06:43,508 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:43,508 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:43,509 INFO L423 AbstractCegarLoop]: === Iteration 17 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:43,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:43,509 INFO L82 PathProgramCache]: Analyzing trace with hash 697427610, now seen corresponding path program 1 times [2018-09-26 08:06:43,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:43,530 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:43,530 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:43,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:43,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:43,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:43,531 INFO L87 Difference]: Start difference. First operand 301 states and 429 transitions. Second operand 8 states. [2018-09-26 08:06:43,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:43,711 INFO L93 Difference]: Finished difference Result 319 states and 447 transitions. [2018-09-26 08:06:43,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:43,711 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-26 08:06:43,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:43,714 INFO L225 Difference]: With dead ends: 319 [2018-09-26 08:06:43,714 INFO L226 Difference]: Without dead ends: 317 [2018-09-26 08:06:43,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:43,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-09-26 08:06:43,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 303. [2018-09-26 08:06:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-09-26 08:06:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 431 transitions. [2018-09-26 08:06:43,810 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 431 transitions. Word has length 14 [2018-09-26 08:06:43,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:43,811 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 431 transitions. [2018-09-26 08:06:43,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 431 transitions. [2018-09-26 08:06:43,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:06:43,812 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:43,812 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:43,812 INFO L423 AbstractCegarLoop]: === Iteration 18 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:43,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:43,813 INFO L82 PathProgramCache]: Analyzing trace with hash 697427226, now seen corresponding path program 1 times [2018-09-26 08:06:43,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:43,841 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:43,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:43,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:43,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:43,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:43,842 INFO L87 Difference]: Start difference. First operand 303 states and 431 transitions. Second operand 8 states. [2018-09-26 08:06:44,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:44,061 INFO L93 Difference]: Finished difference Result 335 states and 474 transitions. [2018-09-26 08:06:44,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:44,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-26 08:06:44,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:44,064 INFO L225 Difference]: With dead ends: 335 [2018-09-26 08:06:44,064 INFO L226 Difference]: Without dead ends: 333 [2018-09-26 08:06:44,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-09-26 08:06:44,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 322. [2018-09-26 08:06:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-09-26 08:06:44,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 456 transitions. [2018-09-26 08:06:44,174 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 456 transitions. Word has length 14 [2018-09-26 08:06:44,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:44,176 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 456 transitions. [2018-09-26 08:06:44,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 456 transitions. [2018-09-26 08:06:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:06:44,177 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:44,178 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:44,178 INFO L423 AbstractCegarLoop]: === Iteration 19 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:44,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:44,178 INFO L82 PathProgramCache]: Analyzing trace with hash 406900684, now seen corresponding path program 1 times [2018-09-26 08:06:44,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:44,212 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:44,212 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:44,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:06:44,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:06:44,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:44,213 INFO L87 Difference]: Start difference. First operand 322 states and 456 transitions. Second operand 10 states. [2018-09-26 08:06:44,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:44,580 INFO L93 Difference]: Finished difference Result 482 states and 683 transitions. [2018-09-26 08:06:44,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:06:44,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-09-26 08:06:44,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:44,584 INFO L225 Difference]: With dead ends: 482 [2018-09-26 08:06:44,584 INFO L226 Difference]: Without dead ends: 480 [2018-09-26 08:06:44,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=242, Invalid=570, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:06:44,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-09-26 08:06:44,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 331. [2018-09-26 08:06:44,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-09-26 08:06:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 470 transitions. [2018-09-26 08:06:44,720 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 470 transitions. Word has length 17 [2018-09-26 08:06:44,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:44,721 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 470 transitions. [2018-09-26 08:06:44,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:06:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 470 transitions. [2018-09-26 08:06:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:06:44,722 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:44,723 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:44,723 INFO L423 AbstractCegarLoop]: === Iteration 20 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:44,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:44,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2143481530, now seen corresponding path program 1 times [2018-09-26 08:06:44,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:44,759 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:44,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:44,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:06:44,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:06:44,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:06:44,761 INFO L87 Difference]: Start difference. First operand 331 states and 470 transitions. Second operand 10 states. [2018-09-26 08:06:45,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:45,287 INFO L93 Difference]: Finished difference Result 507 states and 718 transitions. [2018-09-26 08:06:45,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:06:45,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-09-26 08:06:45,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:45,293 INFO L225 Difference]: With dead ends: 507 [2018-09-26 08:06:45,293 INFO L226 Difference]: Without dead ends: 505 [2018-09-26 08:06:45,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=242, Invalid=570, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:06:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-09-26 08:06:45,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 286. [2018-09-26 08:06:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-26 08:06:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 400 transitions. [2018-09-26 08:06:45,438 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 400 transitions. Word has length 17 [2018-09-26 08:06:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:45,438 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 400 transitions. [2018-09-26 08:06:45,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:06:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 400 transitions. [2018-09-26 08:06:45,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:45,440 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:45,440 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:45,441 INFO L423 AbstractCegarLoop]: === Iteration 21 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:45,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:45,441 INFO L82 PathProgramCache]: Analyzing trace with hash -649882737, now seen corresponding path program 2 times [2018-09-26 08:06:45,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:45,465 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:45,465 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:45,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:45,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:45,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:45,466 INFO L87 Difference]: Start difference. First operand 286 states and 400 transitions. Second operand 8 states. [2018-09-26 08:06:45,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:45,816 INFO L93 Difference]: Finished difference Result 487 states and 698 transitions. [2018-09-26 08:06:45,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:06:45,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-26 08:06:45,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:45,820 INFO L225 Difference]: With dead ends: 487 [2018-09-26 08:06:45,820 INFO L226 Difference]: Without dead ends: 485 [2018-09-26 08:06:45,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:06:45,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-09-26 08:06:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 437. [2018-09-26 08:06:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-09-26 08:06:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 636 transitions. [2018-09-26 08:06:46,049 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 636 transitions. Word has length 18 [2018-09-26 08:06:46,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:46,049 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 636 transitions. [2018-09-26 08:06:46,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:46,049 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 636 transitions. [2018-09-26 08:06:46,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:46,050 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:46,051 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:46,051 INFO L423 AbstractCegarLoop]: === Iteration 22 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:46,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:46,051 INFO L82 PathProgramCache]: Analyzing trace with hash -653820908, now seen corresponding path program 1 times [2018-09-26 08:06:46,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:46,093 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:46,093 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:46,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:46,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:46,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:46,094 INFO L87 Difference]: Start difference. First operand 437 states and 636 transitions. Second operand 8 states. [2018-09-26 08:06:46,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:46,467 INFO L93 Difference]: Finished difference Result 500 states and 719 transitions. [2018-09-26 08:06:46,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:46,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-26 08:06:46,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:46,473 INFO L225 Difference]: With dead ends: 500 [2018-09-26 08:06:46,473 INFO L226 Difference]: Without dead ends: 498 [2018-09-26 08:06:46,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-09-26 08:06:46,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 421. [2018-09-26 08:06:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-09-26 08:06:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 615 transitions. [2018-09-26 08:06:46,711 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 615 transitions. Word has length 18 [2018-09-26 08:06:46,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:46,711 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 615 transitions. [2018-09-26 08:06:46,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 615 transitions. [2018-09-26 08:06:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:46,712 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:46,713 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:46,713 INFO L423 AbstractCegarLoop]: === Iteration 23 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:46,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:46,713 INFO L82 PathProgramCache]: Analyzing trace with hash -653821292, now seen corresponding path program 1 times [2018-09-26 08:06:46,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:46,735 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:46,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:46,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:46,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:46,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:46,736 INFO L87 Difference]: Start difference. First operand 421 states and 615 transitions. Second operand 8 states. [2018-09-26 08:06:47,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:47,128 INFO L93 Difference]: Finished difference Result 535 states and 771 transitions. [2018-09-26 08:06:47,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:47,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-26 08:06:47,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:47,132 INFO L225 Difference]: With dead ends: 535 [2018-09-26 08:06:47,132 INFO L226 Difference]: Without dead ends: 533 [2018-09-26 08:06:47,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:47,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-09-26 08:06:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 447. [2018-09-26 08:06:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-09-26 08:06:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 651 transitions. [2018-09-26 08:06:47,372 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 651 transitions. Word has length 18 [2018-09-26 08:06:47,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:47,372 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 651 transitions. [2018-09-26 08:06:47,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 651 transitions. [2018-09-26 08:06:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:47,374 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:47,374 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:47,374 INFO L423 AbstractCegarLoop]: === Iteration 24 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:47,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:47,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1008814308, now seen corresponding path program 1 times [2018-09-26 08:06:47,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:47,400 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:47,400 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:47,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:47,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:47,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:47,401 INFO L87 Difference]: Start difference. First operand 447 states and 651 transitions. Second operand 8 states. [2018-09-26 08:06:47,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:47,873 INFO L93 Difference]: Finished difference Result 557 states and 803 transitions. [2018-09-26 08:06:47,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:06:47,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-26 08:06:47,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:47,878 INFO L225 Difference]: With dead ends: 557 [2018-09-26 08:06:47,878 INFO L226 Difference]: Without dead ends: 555 [2018-09-26 08:06:47,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:47,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-09-26 08:06:48,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 462. [2018-09-26 08:06:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-09-26 08:06:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 674 transitions. [2018-09-26 08:06:48,206 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 674 transitions. Word has length 18 [2018-09-26 08:06:48,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:48,206 INFO L480 AbstractCegarLoop]: Abstraction has 462 states and 674 transitions. [2018-09-26 08:06:48,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 674 transitions. [2018-09-26 08:06:48,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:48,208 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:48,208 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:48,208 INFO L423 AbstractCegarLoop]: === Iteration 25 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:48,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:48,209 INFO L82 PathProgramCache]: Analyzing trace with hash 199858329, now seen corresponding path program 2 times [2018-09-26 08:06:48,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:48,237 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:48,237 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:48,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:48,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:48,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:48,238 INFO L87 Difference]: Start difference. First operand 462 states and 674 transitions. Second operand 9 states. [2018-09-26 08:06:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:48,753 INFO L93 Difference]: Finished difference Result 562 states and 811 transitions. [2018-09-26 08:06:48,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:06:48,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-09-26 08:06:48,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:48,757 INFO L225 Difference]: With dead ends: 562 [2018-09-26 08:06:48,757 INFO L226 Difference]: Without dead ends: 560 [2018-09-26 08:06:48,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:06:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-09-26 08:06:49,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 495. [2018-09-26 08:06:49,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2018-09-26 08:06:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 721 transitions. [2018-09-26 08:06:49,065 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 721 transitions. Word has length 18 [2018-09-26 08:06:49,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:49,065 INFO L480 AbstractCegarLoop]: Abstraction has 495 states and 721 transitions. [2018-09-26 08:06:49,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:49,066 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 721 transitions. [2018-09-26 08:06:49,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:49,067 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:49,067 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:49,068 INFO L423 AbstractCegarLoop]: === Iteration 26 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:49,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:49,068 INFO L82 PathProgramCache]: Analyzing trace with hash -155134687, now seen corresponding path program 1 times [2018-09-26 08:06:49,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:49,096 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:49,096 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:49,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:49,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:49,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:49,097 INFO L87 Difference]: Start difference. First operand 495 states and 721 transitions. Second operand 8 states. [2018-09-26 08:06:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:49,484 INFO L93 Difference]: Finished difference Result 542 states and 779 transitions. [2018-09-26 08:06:49,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:49,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-26 08:06:49,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:49,488 INFO L225 Difference]: With dead ends: 542 [2018-09-26 08:06:49,488 INFO L226 Difference]: Without dead ends: 540 [2018-09-26 08:06:49,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:49,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-09-26 08:06:49,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 508. [2018-09-26 08:06:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-09-26 08:06:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 738 transitions. [2018-09-26 08:06:49,731 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 738 transitions. Word has length 18 [2018-09-26 08:06:49,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:49,731 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 738 transitions. [2018-09-26 08:06:49,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:49,731 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 738 transitions. [2018-09-26 08:06:49,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:49,732 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:49,733 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:49,733 INFO L423 AbstractCegarLoop]: === Iteration 27 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:49,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:49,733 INFO L82 PathProgramCache]: Analyzing trace with hash -155135071, now seen corresponding path program 1 times [2018-09-26 08:06:49,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:49,756 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:49,756 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:49,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:49,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:49,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:49,758 INFO L87 Difference]: Start difference. First operand 508 states and 738 transitions. Second operand 8 states. [2018-09-26 08:06:50,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:50,385 INFO L93 Difference]: Finished difference Result 840 states and 1224 transitions. [2018-09-26 08:06:50,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:06:50,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-26 08:06:50,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:50,391 INFO L225 Difference]: With dead ends: 840 [2018-09-26 08:06:50,391 INFO L226 Difference]: Without dead ends: 838 [2018-09-26 08:06:50,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-09-26 08:06:50,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 672. [2018-09-26 08:06:50,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2018-09-26 08:06:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 988 transitions. [2018-09-26 08:06:50,683 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 988 transitions. Word has length 18 [2018-09-26 08:06:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:50,683 INFO L480 AbstractCegarLoop]: Abstraction has 672 states and 988 transitions. [2018-09-26 08:06:50,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 988 transitions. [2018-09-26 08:06:50,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:50,685 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:50,685 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:50,686 INFO L423 AbstractCegarLoop]: === Iteration 28 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:50,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:50,686 INFO L82 PathProgramCache]: Analyzing trace with hash -216264415, now seen corresponding path program 2 times [2018-09-26 08:06:50,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:50,708 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:50,708 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:50,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:50,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:50,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:50,709 INFO L87 Difference]: Start difference. First operand 672 states and 988 transitions. Second operand 8 states. [2018-09-26 08:06:51,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:51,199 INFO L93 Difference]: Finished difference Result 733 states and 1065 transitions. [2018-09-26 08:06:51,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:06:51,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-26 08:06:51,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:51,204 INFO L225 Difference]: With dead ends: 733 [2018-09-26 08:06:51,204 INFO L226 Difference]: Without dead ends: 731 [2018-09-26 08:06:51,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:51,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-09-26 08:06:51,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 646. [2018-09-26 08:06:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-09-26 08:06:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 944 transitions. [2018-09-26 08:06:51,516 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 944 transitions. Word has length 18 [2018-09-26 08:06:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:51,516 INFO L480 AbstractCegarLoop]: Abstraction has 646 states and 944 transitions. [2018-09-26 08:06:51,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 944 transitions. [2018-09-26 08:06:51,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:51,518 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:51,518 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:51,518 INFO L423 AbstractCegarLoop]: === Iteration 29 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:51,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:51,519 INFO L82 PathProgramCache]: Analyzing trace with hash -216264799, now seen corresponding path program 2 times [2018-09-26 08:06:51,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:51,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:51,540 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:51,540 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:51,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:51,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:51,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:51,541 INFO L87 Difference]: Start difference. First operand 646 states and 944 transitions. Second operand 8 states. [2018-09-26 08:06:52,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:52,135 INFO L93 Difference]: Finished difference Result 780 states and 1131 transitions. [2018-09-26 08:06:52,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:06:52,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-26 08:06:52,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:52,140 INFO L225 Difference]: With dead ends: 780 [2018-09-26 08:06:52,140 INFO L226 Difference]: Without dead ends: 778 [2018-09-26 08:06:52,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:52,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-09-26 08:06:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 630. [2018-09-26 08:06:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-09-26 08:06:52,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 921 transitions. [2018-09-26 08:06:52,541 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 921 transitions. Word has length 18 [2018-09-26 08:06:52,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:52,541 INFO L480 AbstractCegarLoop]: Abstraction has 630 states and 921 transitions. [2018-09-26 08:06:52,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 921 transitions. [2018-09-26 08:06:52,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:52,543 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:52,543 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:52,543 INFO L423 AbstractCegarLoop]: === Iteration 30 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:52,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:52,544 INFO L82 PathProgramCache]: Analyzing trace with hash -571257815, now seen corresponding path program 2 times [2018-09-26 08:06:52,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:52,585 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:52,585 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:52,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:52,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:52,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:52,586 INFO L87 Difference]: Start difference. First operand 630 states and 921 transitions. Second operand 9 states. [2018-09-26 08:06:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:53,251 INFO L93 Difference]: Finished difference Result 745 states and 1087 transitions. [2018-09-26 08:06:53,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:53,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-09-26 08:06:53,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:53,255 INFO L225 Difference]: With dead ends: 745 [2018-09-26 08:06:53,256 INFO L226 Difference]: Without dead ends: 744 [2018-09-26 08:06:53,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:53,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-09-26 08:06:53,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 624. [2018-09-26 08:06:53,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-09-26 08:06:53,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 910 transitions. [2018-09-26 08:06:53,518 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 910 transitions. Word has length 18 [2018-09-26 08:06:53,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:53,518 INFO L480 AbstractCegarLoop]: Abstraction has 624 states and 910 transitions. [2018-09-26 08:06:53,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:53,519 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 910 transitions. [2018-09-26 08:06:53,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:53,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:53,520 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:53,520 INFO L423 AbstractCegarLoop]: === Iteration 31 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:53,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:53,521 INFO L82 PathProgramCache]: Analyzing trace with hash -571168152, now seen corresponding path program 1 times [2018-09-26 08:06:53,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:53,541 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:53,541 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:53,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:53,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:53,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:53,542 INFO L87 Difference]: Start difference. First operand 624 states and 910 transitions. Second operand 8 states. [2018-09-26 08:06:54,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:54,111 INFO L93 Difference]: Finished difference Result 767 states and 1100 transitions. [2018-09-26 08:06:54,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:54,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-26 08:06:54,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:54,115 INFO L225 Difference]: With dead ends: 767 [2018-09-26 08:06:54,116 INFO L226 Difference]: Without dead ends: 765 [2018-09-26 08:06:54,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:06:54,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-09-26 08:06:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 650. [2018-09-26 08:06:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-09-26 08:06:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 947 transitions. [2018-09-26 08:06:54,422 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 947 transitions. Word has length 18 [2018-09-26 08:06:54,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:54,423 INFO L480 AbstractCegarLoop]: Abstraction has 650 states and 947 transitions. [2018-09-26 08:06:54,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:54,423 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 947 transitions. [2018-09-26 08:06:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:54,424 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:54,424 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:54,424 INFO L423 AbstractCegarLoop]: === Iteration 32 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:54,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:54,425 INFO L82 PathProgramCache]: Analyzing trace with hash 948617211, now seen corresponding path program 2 times [2018-09-26 08:06:54,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:54,445 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:54,446 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:54,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:54,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:54,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:54,448 INFO L87 Difference]: Start difference. First operand 650 states and 947 transitions. Second operand 8 states. [2018-09-26 08:06:54,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:54,956 INFO L93 Difference]: Finished difference Result 705 states and 1013 transitions. [2018-09-26 08:06:54,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:06:54,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-26 08:06:54,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:54,960 INFO L225 Difference]: With dead ends: 705 [2018-09-26 08:06:54,961 INFO L226 Difference]: Without dead ends: 703 [2018-09-26 08:06:54,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:06:54,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-09-26 08:06:55,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 672. [2018-09-26 08:06:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2018-09-26 08:06:55,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 976 transitions. [2018-09-26 08:06:55,440 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 976 transitions. Word has length 18 [2018-09-26 08:06:55,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:55,441 INFO L480 AbstractCegarLoop]: Abstraction has 672 states and 976 transitions. [2018-09-26 08:06:55,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 976 transitions. [2018-09-26 08:06:55,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:55,443 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:55,443 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:55,444 INFO L423 AbstractCegarLoop]: === Iteration 33 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:55,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:55,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1156549802, now seen corresponding path program 1 times [2018-09-26 08:06:55,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:55,470 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:55,470 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:55,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:55,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:55,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:55,471 INFO L87 Difference]: Start difference. First operand 672 states and 976 transitions. Second operand 8 states. [2018-09-26 08:06:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:56,015 INFO L93 Difference]: Finished difference Result 766 states and 1106 transitions. [2018-09-26 08:06:56,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:06:56,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-26 08:06:56,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:56,020 INFO L225 Difference]: With dead ends: 766 [2018-09-26 08:06:56,020 INFO L226 Difference]: Without dead ends: 764 [2018-09-26 08:06:56,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:06:56,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-09-26 08:06:56,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 686. [2018-09-26 08:06:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-09-26 08:06:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 997 transitions. [2018-09-26 08:06:56,432 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 997 transitions. Word has length 18 [2018-09-26 08:06:56,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:56,433 INFO L480 AbstractCegarLoop]: Abstraction has 686 states and 997 transitions. [2018-09-26 08:06:56,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:56,433 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 997 transitions. [2018-09-26 08:06:56,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:56,434 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:56,434 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:56,435 INFO L423 AbstractCegarLoop]: === Iteration 34 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:56,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:56,435 INFO L82 PathProgramCache]: Analyzing trace with hash 801556786, now seen corresponding path program 1 times [2018-09-26 08:06:56,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:56,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:56,452 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:56,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:56,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:56,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:56,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:56,453 INFO L87 Difference]: Start difference. First operand 686 states and 997 transitions. Second operand 8 states. [2018-09-26 08:06:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:57,022 INFO L93 Difference]: Finished difference Result 781 states and 1129 transitions. [2018-09-26 08:06:57,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:06:57,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-26 08:06:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:57,027 INFO L225 Difference]: With dead ends: 781 [2018-09-26 08:06:57,027 INFO L226 Difference]: Without dead ends: 779 [2018-09-26 08:06:57,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:06:57,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-09-26 08:06:57,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 707. [2018-09-26 08:06:57,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2018-09-26 08:06:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1026 transitions. [2018-09-26 08:06:57,405 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1026 transitions. Word has length 18 [2018-09-26 08:06:57,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:57,405 INFO L480 AbstractCegarLoop]: Abstraction has 707 states and 1026 transitions. [2018-09-26 08:06:57,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1026 transitions. [2018-09-26 08:06:57,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:57,406 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:57,407 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:57,407 INFO L423 AbstractCegarLoop]: === Iteration 35 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:57,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:57,407 INFO L82 PathProgramCache]: Analyzing trace with hash 801556402, now seen corresponding path program 1 times [2018-09-26 08:06:57,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:57,435 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:57,436 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:06:57,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:57,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:57,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:57,437 INFO L87 Difference]: Start difference. First operand 707 states and 1026 transitions. Second operand 8 states. [2018-09-26 08:06:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:58,021 INFO L93 Difference]: Finished difference Result 774 states and 1115 transitions. [2018-09-26 08:06:58,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:06:58,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-26 08:06:58,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:58,026 INFO L225 Difference]: With dead ends: 774 [2018-09-26 08:06:58,026 INFO L226 Difference]: Without dead ends: 772 [2018-09-26 08:06:58,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-09-26 08:06:58,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 683. [2018-09-26 08:06:58,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2018-09-26 08:06:58,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 993 transitions. [2018-09-26 08:06:58,456 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 993 transitions. Word has length 18 [2018-09-26 08:06:58,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:58,457 INFO L480 AbstractCegarLoop]: Abstraction has 683 states and 993 transitions. [2018-09-26 08:06:58,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:06:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 993 transitions. [2018-09-26 08:06:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:58,458 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:58,458 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:58,459 INFO L423 AbstractCegarLoop]: === Iteration 36 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:58,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:58,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1011848743, now seen corresponding path program 2 times [2018-09-26 08:06:58,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:58,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:58,485 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:58,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:06:58,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:06:58,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:06:58,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:06:58,486 INFO L87 Difference]: Start difference. First operand 683 states and 993 transitions. Second operand 9 states. [2018-09-26 08:06:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:06:59,290 INFO L93 Difference]: Finished difference Result 907 states and 1338 transitions. [2018-09-26 08:06:59,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:06:59,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-09-26 08:06:59,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:06:59,294 INFO L225 Difference]: With dead ends: 907 [2018-09-26 08:06:59,295 INFO L226 Difference]: Without dead ends: 906 [2018-09-26 08:06:59,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:06:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-09-26 08:06:59,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 746. [2018-09-26 08:06:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-09-26 08:06:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1095 transitions. [2018-09-26 08:06:59,759 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1095 transitions. Word has length 18 [2018-09-26 08:06:59,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:06:59,759 INFO L480 AbstractCegarLoop]: Abstraction has 746 states and 1095 transitions. [2018-09-26 08:06:59,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:06:59,759 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1095 transitions. [2018-09-26 08:06:59,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:06:59,760 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:06:59,760 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:06:59,761 INFO L423 AbstractCegarLoop]: === Iteration 37 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:06:59,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:06:59,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1011759784, now seen corresponding path program 1 times [2018-09-26 08:06:59,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:06:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:06:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:06:59,777 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:06:59,777 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:06:59,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:06:59,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:06:59,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:06:59,778 INFO L87 Difference]: Start difference. First operand 746 states and 1095 transitions. Second operand 8 states. [2018-09-26 08:07:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:00,465 INFO L93 Difference]: Finished difference Result 914 states and 1326 transitions. [2018-09-26 08:07:00,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:07:00,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-26 08:07:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:00,470 INFO L225 Difference]: With dead ends: 914 [2018-09-26 08:07:00,471 INFO L226 Difference]: Without dead ends: 912 [2018-09-26 08:07:00,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:07:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2018-09-26 08:07:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 761. [2018-09-26 08:07:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-09-26 08:07:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1117 transitions. [2018-09-26 08:07:00,865 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1117 transitions. Word has length 18 [2018-09-26 08:07:00,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:00,865 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 1117 transitions. [2018-09-26 08:07:00,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:00,865 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1117 transitions. [2018-09-26 08:07:00,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:00,867 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:00,867 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:00,867 INFO L423 AbstractCegarLoop]: === Iteration 38 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:00,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:00,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1366841759, now seen corresponding path program 1 times [2018-09-26 08:07:00,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:00,885 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:00,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:00,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:00,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:00,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:00,886 INFO L87 Difference]: Start difference. First operand 761 states and 1117 transitions. Second operand 8 states. [2018-09-26 08:07:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:01,625 INFO L93 Difference]: Finished difference Result 933 states and 1368 transitions. [2018-09-26 08:07:01,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:07:01,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-26 08:07:01,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:01,630 INFO L225 Difference]: With dead ends: 933 [2018-09-26 08:07:01,631 INFO L226 Difference]: Without dead ends: 931 [2018-09-26 08:07:01,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:07:01,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2018-09-26 08:07:02,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 781. [2018-09-26 08:07:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2018-09-26 08:07:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1145 transitions. [2018-09-26 08:07:02,094 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1145 transitions. Word has length 18 [2018-09-26 08:07:02,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:02,094 INFO L480 AbstractCegarLoop]: Abstraction has 781 states and 1145 transitions. [2018-09-26 08:07:02,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:02,095 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1145 transitions. [2018-09-26 08:07:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:02,095 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:02,095 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:02,096 INFO L423 AbstractCegarLoop]: === Iteration 39 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:02,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:02,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1366842143, now seen corresponding path program 1 times [2018-09-26 08:07:02,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:02,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:02,112 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:02,112 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:07:02,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:02,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:02,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:02,113 INFO L87 Difference]: Start difference. First operand 781 states and 1145 transitions. Second operand 8 states. [2018-09-26 08:07:02,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:02,737 INFO L93 Difference]: Finished difference Result 821 states and 1189 transitions. [2018-09-26 08:07:02,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:07:02,737 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-26 08:07:02,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:02,741 INFO L225 Difference]: With dead ends: 821 [2018-09-26 08:07:02,741 INFO L226 Difference]: Without dead ends: 819 [2018-09-26 08:07:02,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:07:02,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-09-26 08:07:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 741. [2018-09-26 08:07:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-09-26 08:07:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1081 transitions. [2018-09-26 08:07:03,250 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1081 transitions. Word has length 18 [2018-09-26 08:07:03,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:03,250 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 1081 transitions. [2018-09-26 08:07:03,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:03,250 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1081 transitions. [2018-09-26 08:07:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:03,251 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:03,252 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:03,252 INFO L423 AbstractCegarLoop]: === Iteration 40 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:03,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:03,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1427971487, now seen corresponding path program 2 times [2018-09-26 08:07:03,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:03,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:03,268 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:03,268 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:03,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:03,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:03,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:03,269 INFO L87 Difference]: Start difference. First operand 741 states and 1081 transitions. Second operand 8 states. [2018-09-26 08:07:03,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:03,951 INFO L93 Difference]: Finished difference Result 941 states and 1359 transitions. [2018-09-26 08:07:03,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:07:03,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-26 08:07:03,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:03,955 INFO L225 Difference]: With dead ends: 941 [2018-09-26 08:07:03,955 INFO L226 Difference]: Without dead ends: 939 [2018-09-26 08:07:03,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:07:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2018-09-26 08:07:04,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 792. [2018-09-26 08:07:04,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-09-26 08:07:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1155 transitions. [2018-09-26 08:07:04,284 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1155 transitions. Word has length 18 [2018-09-26 08:07:04,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:04,284 INFO L480 AbstractCegarLoop]: Abstraction has 792 states and 1155 transitions. [2018-09-26 08:07:04,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1155 transitions. [2018-09-26 08:07:04,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:07:04,285 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:04,285 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:04,286 INFO L423 AbstractCegarLoop]: === Iteration 41 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:04,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:04,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1782964887, now seen corresponding path program 2 times [2018-09-26 08:07:04,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:04,300 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:04,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:04,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:04,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:04,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:04,301 INFO L87 Difference]: Start difference. First operand 792 states and 1155 transitions. Second operand 9 states. [2018-09-26 08:07:04,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:04,830 INFO L93 Difference]: Finished difference Result 936 states and 1355 transitions. [2018-09-26 08:07:04,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:07:04,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-09-26 08:07:04,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:04,835 INFO L225 Difference]: With dead ends: 936 [2018-09-26 08:07:04,836 INFO L226 Difference]: Without dead ends: 934 [2018-09-26 08:07:04,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:07:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2018-09-26 08:07:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 827. [2018-09-26 08:07:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2018-09-26 08:07:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1202 transitions. [2018-09-26 08:07:05,177 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1202 transitions. Word has length 18 [2018-09-26 08:07:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:05,177 INFO L480 AbstractCegarLoop]: Abstraction has 827 states and 1202 transitions. [2018-09-26 08:07:05,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1202 transitions. [2018-09-26 08:07:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:07:05,179 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:05,179 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:05,179 INFO L423 AbstractCegarLoop]: === Iteration 42 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:05,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:05,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1622613706, now seen corresponding path program 1 times [2018-09-26 08:07:05,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:05,202 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:05,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:05,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:05,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:05,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:05,203 INFO L87 Difference]: Start difference. First operand 827 states and 1202 transitions. Second operand 12 states. [2018-09-26 08:07:06,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:06,509 INFO L93 Difference]: Finished difference Result 1574 states and 2302 transitions. [2018-09-26 08:07:06,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:07:06,509 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:07:06,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:06,518 INFO L225 Difference]: With dead ends: 1574 [2018-09-26 08:07:06,518 INFO L226 Difference]: Without dead ends: 1572 [2018-09-26 08:07:06,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=390, Invalid=1092, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:07:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2018-09-26 08:07:07,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1454. [2018-09-26 08:07:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2018-09-26 08:07:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2142 transitions. [2018-09-26 08:07:07,280 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2142 transitions. Word has length 21 [2018-09-26 08:07:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:07,280 INFO L480 AbstractCegarLoop]: Abstraction has 1454 states and 2142 transitions. [2018-09-26 08:07:07,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:07,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2142 transitions. [2018-09-26 08:07:07,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:07:07,282 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:07,282 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:07,283 INFO L423 AbstractCegarLoop]: === Iteration 43 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:07,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:07,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1005591262, now seen corresponding path program 1 times [2018-09-26 08:07:07,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:07,304 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:07,305 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:07,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:07:07,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:07:07,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:07:07,305 INFO L87 Difference]: Start difference. First operand 1454 states and 2142 transitions. Second operand 12 states. [2018-09-26 08:07:09,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:09,037 INFO L93 Difference]: Finished difference Result 2649 states and 3932 transitions. [2018-09-26 08:07:09,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:07:09,038 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:07:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:09,063 INFO L225 Difference]: With dead ends: 2649 [2018-09-26 08:07:09,063 INFO L226 Difference]: Without dead ends: 2647 [2018-09-26 08:07:09,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=390, Invalid=1092, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:07:09,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2018-09-26 08:07:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2484. [2018-09-26 08:07:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2484 states. [2018-09-26 08:07:09,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2484 states and 3704 transitions. [2018-09-26 08:07:09,913 INFO L78 Accepts]: Start accepts. Automaton has 2484 states and 3704 transitions. Word has length 21 [2018-09-26 08:07:09,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:09,914 INFO L480 AbstractCegarLoop]: Abstraction has 2484 states and 3704 transitions. [2018-09-26 08:07:09,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:07:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 3704 transitions. [2018-09-26 08:07:09,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:07:09,916 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:09,916 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:09,916 INFO L423 AbstractCegarLoop]: === Iteration 44 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:09,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:09,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1621422890, now seen corresponding path program 2 times [2018-09-26 08:07:09,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:09,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:09,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:09,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:09,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:09,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:09,937 INFO L87 Difference]: Start difference. First operand 2484 states and 3704 transitions. Second operand 9 states. [2018-09-26 08:07:11,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:11,248 INFO L93 Difference]: Finished difference Result 2521 states and 3747 transitions. [2018-09-26 08:07:11,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:07:11,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-09-26 08:07:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:11,257 INFO L225 Difference]: With dead ends: 2521 [2018-09-26 08:07:11,257 INFO L226 Difference]: Without dead ends: 2520 [2018-09-26 08:07:11,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:07:11,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2018-09-26 08:07:12,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 2484. [2018-09-26 08:07:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2484 states. [2018-09-26 08:07:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2484 states and 3700 transitions. [2018-09-26 08:07:12,062 INFO L78 Accepts]: Start accepts. Automaton has 2484 states and 3700 transitions. Word has length 22 [2018-09-26 08:07:12,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:12,062 INFO L480 AbstractCegarLoop]: Abstraction has 2484 states and 3700 transitions. [2018-09-26 08:07:12,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 3700 transitions. [2018-09-26 08:07:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:07:12,064 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:12,064 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:12,064 INFO L423 AbstractCegarLoop]: === Iteration 45 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:12,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:12,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1982566808, now seen corresponding path program 1 times [2018-09-26 08:07:12,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:12,082 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:12,082 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:12,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:12,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:12,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:12,083 INFO L87 Difference]: Start difference. First operand 2484 states and 3700 transitions. Second operand 9 states. [2018-09-26 08:07:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:13,124 INFO L93 Difference]: Finished difference Result 2741 states and 4062 transitions. [2018-09-26 08:07:13,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:07:13,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-09-26 08:07:13,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:13,132 INFO L225 Difference]: With dead ends: 2741 [2018-09-26 08:07:13,132 INFO L226 Difference]: Without dead ends: 2739 [2018-09-26 08:07:13,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:07:13,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2739 states. [2018-09-26 08:07:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2739 to 2594. [2018-09-26 08:07:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2594 states. [2018-09-26 08:07:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 3858 transitions. [2018-09-26 08:07:14,157 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 3858 transitions. Word has length 22 [2018-09-26 08:07:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:14,158 INFO L480 AbstractCegarLoop]: Abstraction has 2594 states and 3858 transitions. [2018-09-26 08:07:14,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3858 transitions. [2018-09-26 08:07:14,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:07:14,160 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:14,160 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:14,160 INFO L423 AbstractCegarLoop]: === Iteration 46 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:14,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:14,160 INFO L82 PathProgramCache]: Analyzing trace with hash -767743653, now seen corresponding path program 2 times [2018-09-26 08:07:14,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:14,178 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:14,179 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:14,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:14,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:14,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:14,179 INFO L87 Difference]: Start difference. First operand 2594 states and 3858 transitions. Second operand 10 states. [2018-09-26 08:07:15,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:15,850 INFO L93 Difference]: Finished difference Result 3321 states and 4947 transitions. [2018-09-26 08:07:15,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:07:15,850 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-09-26 08:07:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:15,859 INFO L225 Difference]: With dead ends: 3321 [2018-09-26 08:07:15,859 INFO L226 Difference]: Without dead ends: 3319 [2018-09-26 08:07:15,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=336, Invalid=854, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:07:15,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2018-09-26 08:07:17,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 2735. [2018-09-26 08:07:17,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2735 states. [2018-09-26 08:07:17,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 4072 transitions. [2018-09-26 08:07:17,112 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 4072 transitions. Word has length 22 [2018-09-26 08:07:17,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:17,113 INFO L480 AbstractCegarLoop]: Abstraction has 2735 states and 4072 transitions. [2018-09-26 08:07:17,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 4072 transitions. [2018-09-26 08:07:17,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:07:17,115 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:17,115 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:17,115 INFO L423 AbstractCegarLoop]: === Iteration 47 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:17,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:17,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1122647006, now seen corresponding path program 1 times [2018-09-26 08:07:17,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:17,131 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:17,131 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:17,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:17,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:17,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:17,132 INFO L87 Difference]: Start difference. First operand 2735 states and 4072 transitions. Second operand 8 states. [2018-09-26 08:07:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:18,204 INFO L93 Difference]: Finished difference Result 2960 states and 4385 transitions. [2018-09-26 08:07:18,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:07:18,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-09-26 08:07:18,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:18,212 INFO L225 Difference]: With dead ends: 2960 [2018-09-26 08:07:18,213 INFO L226 Difference]: Without dead ends: 2958 [2018-09-26 08:07:18,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:07:18,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2018-09-26 08:07:19,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2737. [2018-09-26 08:07:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2737 states. [2018-09-26 08:07:19,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2737 states and 4072 transitions. [2018-09-26 08:07:19,259 INFO L78 Accepts]: Start accepts. Automaton has 2737 states and 4072 transitions. Word has length 22 [2018-09-26 08:07:19,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:19,259 INFO L480 AbstractCegarLoop]: Abstraction has 2737 states and 4072 transitions. [2018-09-26 08:07:19,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:19,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 4072 transitions. [2018-09-26 08:07:19,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:07:19,261 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:19,261 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:19,261 INFO L423 AbstractCegarLoop]: === Iteration 48 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:19,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:19,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1183866397, now seen corresponding path program 1 times [2018-09-26 08:07:19,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:19,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:19,281 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:19,281 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:19,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:19,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:19,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:19,282 INFO L87 Difference]: Start difference. First operand 2737 states and 4072 transitions. Second operand 9 states. [2018-09-26 08:07:20,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:20,433 INFO L93 Difference]: Finished difference Result 2904 states and 4306 transitions. [2018-09-26 08:07:20,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:07:20,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-09-26 08:07:20,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:20,441 INFO L225 Difference]: With dead ends: 2904 [2018-09-26 08:07:20,442 INFO L226 Difference]: Without dead ends: 2903 [2018-09-26 08:07:20,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:07:20,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2018-09-26 08:07:21,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2719. [2018-09-26 08:07:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2719 states. [2018-09-26 08:07:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 4036 transitions. [2018-09-26 08:07:21,760 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 4036 transitions. Word has length 22 [2018-09-26 08:07:21,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:21,761 INFO L480 AbstractCegarLoop]: Abstraction has 2719 states and 4036 transitions. [2018-09-26 08:07:21,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:21,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 4036 transitions. [2018-09-26 08:07:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:07:21,763 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:21,763 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:21,763 INFO L423 AbstractCegarLoop]: === Iteration 49 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:21,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:21,763 INFO L82 PathProgramCache]: Analyzing trace with hash 15880131, now seen corresponding path program 1 times [2018-09-26 08:07:21,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:21,778 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:21,779 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:21,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:21,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:21,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:21,779 INFO L87 Difference]: Start difference. First operand 2719 states and 4036 transitions. Second operand 8 states. [2018-09-26 08:07:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:22,877 INFO L93 Difference]: Finished difference Result 3086 states and 4558 transitions. [2018-09-26 08:07:22,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:07:22,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-09-26 08:07:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:22,886 INFO L225 Difference]: With dead ends: 3086 [2018-09-26 08:07:22,886 INFO L226 Difference]: Without dead ends: 3084 [2018-09-26 08:07:22,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:07:22,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2018-09-26 08:07:23,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 2747. [2018-09-26 08:07:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2747 states. [2018-09-26 08:07:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2747 states to 2747 states and 4080 transitions. [2018-09-26 08:07:23,957 INFO L78 Accepts]: Start accepts. Automaton has 2747 states and 4080 transitions. Word has length 22 [2018-09-26 08:07:23,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:23,957 INFO L480 AbstractCegarLoop]: Abstraction has 2747 states and 4080 transitions. [2018-09-26 08:07:23,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 4080 transitions. [2018-09-26 08:07:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:07:23,959 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:23,959 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:23,960 INFO L423 AbstractCegarLoop]: === Iteration 50 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:23,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:23,960 INFO L82 PathProgramCache]: Analyzing trace with hash 627807824, now seen corresponding path program 1 times [2018-09-26 08:07:23,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:23,982 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:23,982 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:23,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:23,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:23,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:23,983 INFO L87 Difference]: Start difference. First operand 2747 states and 4080 transitions. Second operand 10 states. [2018-09-26 08:07:25,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:25,435 INFO L93 Difference]: Finished difference Result 3253 states and 4807 transitions. [2018-09-26 08:07:25,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:07:25,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-09-26 08:07:25,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:25,442 INFO L225 Difference]: With dead ends: 3253 [2018-09-26 08:07:25,443 INFO L226 Difference]: Without dead ends: 3251 [2018-09-26 08:07:25,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:07:25,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3251 states. [2018-09-26 08:07:26,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3251 to 2802. [2018-09-26 08:07:26,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2802 states. [2018-09-26 08:07:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 4162 transitions. [2018-09-26 08:07:26,486 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 4162 transitions. Word has length 22 [2018-09-26 08:07:26,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:26,486 INFO L480 AbstractCegarLoop]: Abstraction has 2802 states and 4162 transitions. [2018-09-26 08:07:26,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:26,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 4162 transitions. [2018-09-26 08:07:26,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:07:26,488 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:26,488 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:26,489 INFO L423 AbstractCegarLoop]: === Iteration 51 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:26,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:26,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1964547658, now seen corresponding path program 2 times [2018-09-26 08:07:26,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:26,503 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:26,504 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:26,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:26,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:26,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:26,504 INFO L87 Difference]: Start difference. First operand 2802 states and 4162 transitions. Second operand 9 states. [2018-09-26 08:07:27,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:27,496 INFO L93 Difference]: Finished difference Result 2833 states and 4197 transitions. [2018-09-26 08:07:27,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:07:27,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-09-26 08:07:27,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:27,502 INFO L225 Difference]: With dead ends: 2833 [2018-09-26 08:07:27,502 INFO L226 Difference]: Without dead ends: 2832 [2018-09-26 08:07:27,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:07:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2018-09-26 08:07:28,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2802. [2018-09-26 08:07:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2802 states. [2018-09-26 08:07:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 4158 transitions. [2018-09-26 08:07:28,554 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 4158 transitions. Word has length 22 [2018-09-26 08:07:28,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:28,554 INFO L480 AbstractCegarLoop]: Abstraction has 2802 states and 4158 transitions. [2018-09-26 08:07:28,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:28,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 4158 transitions. [2018-09-26 08:07:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:07:28,557 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:28,557 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:28,557 INFO L423 AbstractCegarLoop]: === Iteration 52 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:28,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:28,558 INFO L82 PathProgramCache]: Analyzing trace with hash -430310174, now seen corresponding path program 1 times [2018-09-26 08:07:28,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:28,583 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:28,583 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:28,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:28,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:28,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:28,585 INFO L87 Difference]: Start difference. First operand 2802 states and 4158 transitions. Second operand 9 states. [2018-09-26 08:07:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:29,943 INFO L93 Difference]: Finished difference Result 3077 states and 4552 transitions. [2018-09-26 08:07:29,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:07:29,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-09-26 08:07:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:29,948 INFO L225 Difference]: With dead ends: 3077 [2018-09-26 08:07:29,948 INFO L226 Difference]: Without dead ends: 3075 [2018-09-26 08:07:29,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:07:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2018-09-26 08:07:30,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2917. [2018-09-26 08:07:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2917 states. [2018-09-26 08:07:30,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 4324 transitions. [2018-09-26 08:07:30,981 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 4324 transitions. Word has length 22 [2018-09-26 08:07:30,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:30,982 INFO L480 AbstractCegarLoop]: Abstraction has 2917 states and 4324 transitions. [2018-09-26 08:07:30,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:30,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 4324 transitions. [2018-09-26 08:07:30,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:07:30,983 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:30,983 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:30,983 INFO L423 AbstractCegarLoop]: === Iteration 53 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:30,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:30,984 INFO L82 PathProgramCache]: Analyzing trace with hash -203850887, now seen corresponding path program 1 times [2018-09-26 08:07:30,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:31,000 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:31,000 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:31,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:07:31,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:07:31,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:07:31,001 INFO L87 Difference]: Start difference. First operand 2917 states and 4324 transitions. Second operand 9 states. [2018-09-26 08:07:32,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:32,157 INFO L93 Difference]: Finished difference Result 3087 states and 4560 transitions. [2018-09-26 08:07:32,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:07:32,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-09-26 08:07:32,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:32,161 INFO L225 Difference]: With dead ends: 3087 [2018-09-26 08:07:32,161 INFO L226 Difference]: Without dead ends: 3086 [2018-09-26 08:07:32,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:07:32,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3086 states. [2018-09-26 08:07:33,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3086 to 2915. [2018-09-26 08:07:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2915 states. [2018-09-26 08:07:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 4314 transitions. [2018-09-26 08:07:33,285 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 4314 transitions. Word has length 22 [2018-09-26 08:07:33,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:33,286 INFO L480 AbstractCegarLoop]: Abstraction has 2915 states and 4314 transitions. [2018-09-26 08:07:33,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:07:33,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 4314 transitions. [2018-09-26 08:07:33,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:07:33,287 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:33,287 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:33,288 INFO L423 AbstractCegarLoop]: === Iteration 54 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:33,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:33,288 INFO L82 PathProgramCache]: Analyzing trace with hash 345073063, now seen corresponding path program 1 times [2018-09-26 08:07:33,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:33,303 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:33,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:07:33,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:07:33,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:07:33,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:07:33,304 INFO L87 Difference]: Start difference. First operand 2915 states and 4314 transitions. Second operand 8 states. [2018-09-26 08:07:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:34,611 INFO L93 Difference]: Finished difference Result 3266 states and 4816 transitions. [2018-09-26 08:07:34,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:07:34,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-09-26 08:07:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:34,615 INFO L225 Difference]: With dead ends: 3266 [2018-09-26 08:07:34,616 INFO L226 Difference]: Without dead ends: 3264 [2018-09-26 08:07:34,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:07:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2018-09-26 08:07:35,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 2934. [2018-09-26 08:07:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2934 states. [2018-09-26 08:07:35,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 4340 transitions. [2018-09-26 08:07:35,674 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 4340 transitions. Word has length 22 [2018-09-26 08:07:35,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:35,674 INFO L480 AbstractCegarLoop]: Abstraction has 2934 states and 4340 transitions. [2018-09-26 08:07:35,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:07:35,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 4340 transitions. [2018-09-26 08:07:35,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:07:35,676 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:35,676 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:35,676 INFO L423 AbstractCegarLoop]: === Iteration 55 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:35,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:35,676 INFO L82 PathProgramCache]: Analyzing trace with hash -619973631, now seen corresponding path program 2 times [2018-09-26 08:07:35,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:35,689 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:35,689 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:35,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:35,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:35,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:35,689 INFO L87 Difference]: Start difference. First operand 2934 states and 4340 transitions. Second operand 10 states. [2018-09-26 08:07:37,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:37,373 INFO L93 Difference]: Finished difference Result 3688 states and 5467 transitions. [2018-09-26 08:07:37,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:07:37,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-09-26 08:07:37,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:37,378 INFO L225 Difference]: With dead ends: 3688 [2018-09-26 08:07:37,378 INFO L226 Difference]: Without dead ends: 3686 [2018-09-26 08:07:37,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=336, Invalid=854, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:07:37,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2018-09-26 08:07:38,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3074. [2018-09-26 08:07:38,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3074 states. [2018-09-26 08:07:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 4552 transitions. [2018-09-26 08:07:38,472 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 4552 transitions. Word has length 22 [2018-09-26 08:07:38,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:38,472 INFO L480 AbstractCegarLoop]: Abstraction has 3074 states and 4552 transitions. [2018-09-26 08:07:38,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:38,472 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 4552 transitions. [2018-09-26 08:07:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:07:38,475 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:38,475 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:38,475 INFO L423 AbstractCegarLoop]: === Iteration 56 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:38,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:38,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1613894486, now seen corresponding path program 1 times [2018-09-26 08:07:38,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:38,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:38,496 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:38,497 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:38,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:38,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:38,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:38,497 INFO L87 Difference]: Start difference. First operand 3074 states and 4552 transitions. Second operand 10 states. [2018-09-26 08:07:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:40,195 INFO L93 Difference]: Finished difference Result 3608 states and 5324 transitions. [2018-09-26 08:07:40,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:07:40,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-09-26 08:07:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:40,200 INFO L225 Difference]: With dead ends: 3608 [2018-09-26 08:07:40,200 INFO L226 Difference]: Without dead ends: 3606 [2018-09-26 08:07:40,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:07:40,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2018-09-26 08:07:41,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 3133. [2018-09-26 08:07:41,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2018-09-26 08:07:41,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 4640 transitions. [2018-09-26 08:07:41,389 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 4640 transitions. Word has length 22 [2018-09-26 08:07:41,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:41,389 INFO L480 AbstractCegarLoop]: Abstraction has 3133 states and 4640 transitions. [2018-09-26 08:07:41,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:41,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 4640 transitions. [2018-09-26 08:07:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:07:41,391 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:41,391 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:41,391 INFO L423 AbstractCegarLoop]: === Iteration 57 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:41,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:41,391 INFO L82 PathProgramCache]: Analyzing trace with hash -682508600, now seen corresponding path program 2 times [2018-09-26 08:07:41,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 08:07:41,412 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:41,412 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:41,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:41,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:41,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:41,413 INFO L87 Difference]: Start difference. First operand 3133 states and 4640 transitions. Second operand 11 states. [2018-09-26 08:07:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:42,647 INFO L93 Difference]: Finished difference Result 3236 states and 4771 transitions. [2018-09-26 08:07:42,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:07:42,647 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-09-26 08:07:42,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:42,651 INFO L225 Difference]: With dead ends: 3236 [2018-09-26 08:07:42,651 INFO L226 Difference]: Without dead ends: 3235 [2018-09-26 08:07:42,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:07:42,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2018-09-26 08:07:43,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 3144. [2018-09-26 08:07:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3144 states. [2018-09-26 08:07:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3144 states to 3144 states and 4654 transitions. [2018-09-26 08:07:43,809 INFO L78 Accepts]: Start accepts. Automaton has 3144 states and 4654 transitions. Word has length 25 [2018-09-26 08:07:43,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:43,810 INFO L480 AbstractCegarLoop]: Abstraction has 3144 states and 4654 transitions. [2018-09-26 08:07:43,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:43,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 4654 transitions. [2018-09-26 08:07:43,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:07:43,812 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:43,813 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:43,813 INFO L423 AbstractCegarLoop]: === Iteration 58 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:43,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:43,813 INFO L82 PathProgramCache]: Analyzing trace with hash -548371823, now seen corresponding path program 1 times [2018-09-26 08:07:43,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:43,832 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:43,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:07:43,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:43,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:43,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:43,832 INFO L87 Difference]: Start difference. First operand 3144 states and 4654 transitions. Second operand 11 states. [2018-09-26 08:07:45,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:45,390 INFO L93 Difference]: Finished difference Result 3658 states and 5404 transitions. [2018-09-26 08:07:45,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:07:45,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-09-26 08:07:45,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:45,395 INFO L225 Difference]: With dead ends: 3658 [2018-09-26 08:07:45,395 INFO L226 Difference]: Without dead ends: 3656 [2018-09-26 08:07:45,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:07:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2018-09-26 08:07:46,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3270. [2018-09-26 08:07:46,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2018-09-26 08:07:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 4837 transitions. [2018-09-26 08:07:46,725 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 4837 transitions. Word has length 25 [2018-09-26 08:07:46,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:46,726 INFO L480 AbstractCegarLoop]: Abstraction has 3270 states and 4837 transitions. [2018-09-26 08:07:46,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:46,726 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 4837 transitions. [2018-09-26 08:07:46,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:07:46,729 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:46,729 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:46,729 INFO L423 AbstractCegarLoop]: === Iteration 59 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:46,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:46,730 INFO L82 PathProgramCache]: Analyzing trace with hash -843643870, now seen corresponding path program 1 times [2018-09-26 08:07:46,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:07:46,754 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:46,754 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:46,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:46,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:46,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:46,755 INFO L87 Difference]: Start difference. First operand 3270 states and 4837 transitions. Second operand 10 states. [2018-09-26 08:07:48,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:48,372 INFO L93 Difference]: Finished difference Result 3411 states and 5033 transitions. [2018-09-26 08:07:48,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:07:48,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-09-26 08:07:48,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:48,376 INFO L225 Difference]: With dead ends: 3411 [2018-09-26 08:07:48,377 INFO L226 Difference]: Without dead ends: 3410 [2018-09-26 08:07:48,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:07:48,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states. [2018-09-26 08:07:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 3284. [2018-09-26 08:07:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3284 states. [2018-09-26 08:07:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3284 states to 3284 states and 4859 transitions. [2018-09-26 08:07:49,706 INFO L78 Accepts]: Start accepts. Automaton has 3284 states and 4859 transitions. Word has length 25 [2018-09-26 08:07:49,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:49,707 INFO L480 AbstractCegarLoop]: Abstraction has 3284 states and 4859 transitions. [2018-09-26 08:07:49,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3284 states and 4859 transitions. [2018-09-26 08:07:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:07:49,710 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:49,710 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:49,710 INFO L423 AbstractCegarLoop]: === Iteration 60 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:49,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:49,710 INFO L82 PathProgramCache]: Analyzing trace with hash -843554207, now seen corresponding path program 1 times [2018-09-26 08:07:49,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:49,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:49,723 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:49,723 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:07:49,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:07:49,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:07:49,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:07:49,724 INFO L87 Difference]: Start difference. First operand 3284 states and 4859 transitions. Second operand 10 states. [2018-09-26 08:07:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:51,383 INFO L93 Difference]: Finished difference Result 3561 states and 5284 transitions. [2018-09-26 08:07:51,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:07:51,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-09-26 08:07:51,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:51,390 INFO L225 Difference]: With dead ends: 3561 [2018-09-26 08:07:51,390 INFO L226 Difference]: Without dead ends: 3559 [2018-09-26 08:07:51,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:07:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2018-09-26 08:07:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 3286. [2018-09-26 08:07:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3286 states. [2018-09-26 08:07:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3286 states to 3286 states and 4860 transitions. [2018-09-26 08:07:52,803 INFO L78 Accepts]: Start accepts. Automaton has 3286 states and 4860 transitions. Word has length 25 [2018-09-26 08:07:52,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:52,803 INFO L480 AbstractCegarLoop]: Abstraction has 3286 states and 4860 transitions. [2018-09-26 08:07:52,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:07:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3286 states and 4860 transitions. [2018-09-26 08:07:52,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:07:52,806 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:52,806 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:52,806 INFO L423 AbstractCegarLoop]: === Iteration 61 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:52,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:52,806 INFO L82 PathProgramCache]: Analyzing trace with hash -760804007, now seen corresponding path program 1 times [2018-09-26 08:07:52,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:52,827 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:52,827 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:52,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:52,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:52,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:52,828 INFO L87 Difference]: Start difference. First operand 3286 states and 4860 transitions. Second operand 11 states. [2018-09-26 08:07:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:54,525 INFO L93 Difference]: Finished difference Result 3882 states and 5733 transitions. [2018-09-26 08:07:54,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:07:54,525 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-09-26 08:07:54,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:54,530 INFO L225 Difference]: With dead ends: 3882 [2018-09-26 08:07:54,530 INFO L226 Difference]: Without dead ends: 3880 [2018-09-26 08:07:54,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:07:54,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3880 states. [2018-09-26 08:07:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3880 to 3586. [2018-09-26 08:07:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3586 states. [2018-09-26 08:07:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 5319 transitions. [2018-09-26 08:07:55,995 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 5319 transitions. Word has length 25 [2018-09-26 08:07:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:55,995 INFO L480 AbstractCegarLoop]: Abstraction has 3586 states and 5319 transitions. [2018-09-26 08:07:55,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 5319 transitions. [2018-09-26 08:07:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:07:55,997 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:55,997 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:55,997 INFO L423 AbstractCegarLoop]: === Iteration 62 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:55,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:55,997 INFO L82 PathProgramCache]: Analyzing trace with hash -764742562, now seen corresponding path program 1 times [2018-09-26 08:07:55,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:56,012 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:56,012 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:56,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:56,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:56,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:56,013 INFO L87 Difference]: Start difference. First operand 3586 states and 5319 transitions. Second operand 11 states. [2018-09-26 08:07:57,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:07:57,542 INFO L93 Difference]: Finished difference Result 3739 states and 5530 transitions. [2018-09-26 08:07:57,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:07:57,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-09-26 08:07:57,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:07:57,547 INFO L225 Difference]: With dead ends: 3739 [2018-09-26 08:07:57,547 INFO L226 Difference]: Without dead ends: 3737 [2018-09-26 08:07:57,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:07:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2018-09-26 08:07:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 3565. [2018-09-26 08:07:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3565 states. [2018-09-26 08:07:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 5287 transitions. [2018-09-26 08:07:58,931 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 5287 transitions. Word has length 25 [2018-09-26 08:07:58,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:07:58,931 INFO L480 AbstractCegarLoop]: Abstraction has 3565 states and 5287 transitions. [2018-09-26 08:07:58,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:07:58,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 5287 transitions. [2018-09-26 08:07:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:07:58,933 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:07:58,933 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:07:58,933 INFO L423 AbstractCegarLoop]: === Iteration 63 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:07:58,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:07:58,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1119735578, now seen corresponding path program 2 times [2018-09-26 08:07:58,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:07:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:07:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:07:58,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:07:58,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:07:58,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:07:58,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:07:58,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:07:58,955 INFO L87 Difference]: Start difference. First operand 3565 states and 5287 transitions. Second operand 11 states. [2018-09-26 08:08:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:00,540 INFO L93 Difference]: Finished difference Result 3781 states and 5599 transitions. [2018-09-26 08:08:00,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:08:00,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-09-26 08:08:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:00,544 INFO L225 Difference]: With dead ends: 3781 [2018-09-26 08:08:00,544 INFO L226 Difference]: Without dead ends: 3779 [2018-09-26 08:08:00,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:08:00,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3779 states. [2018-09-26 08:08:01,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3779 to 3649. [2018-09-26 08:08:01,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2018-09-26 08:08:01,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 5423 transitions. [2018-09-26 08:08:01,938 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 5423 transitions. Word has length 25 [2018-09-26 08:08:01,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:01,938 INFO L480 AbstractCegarLoop]: Abstraction has 3649 states and 5423 transitions. [2018-09-26 08:08:01,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:01,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 5423 transitions. [2018-09-26 08:08:01,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:08:01,940 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:01,940 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:01,941 INFO L423 AbstractCegarLoop]: === Iteration 64 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:01,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:01,941 INFO L82 PathProgramCache]: Analyzing trace with hash -266056341, now seen corresponding path program 1 times [2018-09-26 08:08:01,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:01,957 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:01,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:08:01,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:01,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:01,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:01,958 INFO L87 Difference]: Start difference. First operand 3649 states and 5423 transitions. Second operand 11 states. [2018-09-26 08:08:03,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:03,603 INFO L93 Difference]: Finished difference Result 3933 states and 5840 transitions. [2018-09-26 08:08:03,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:08:03,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-09-26 08:08:03,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:03,608 INFO L225 Difference]: With dead ends: 3933 [2018-09-26 08:08:03,608 INFO L226 Difference]: Without dead ends: 3931 [2018-09-26 08:08:03,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:08:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2018-09-26 08:08:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 3390. [2018-09-26 08:08:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3390 states. [2018-09-26 08:08:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 5040 transitions. [2018-09-26 08:08:05,040 INFO L78 Accepts]: Start accepts. Automaton has 3390 states and 5040 transitions. Word has length 25 [2018-09-26 08:08:05,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:05,041 INFO L480 AbstractCegarLoop]: Abstraction has 3390 states and 5040 transitions. [2018-09-26 08:08:05,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 5040 transitions. [2018-09-26 08:08:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:08:05,044 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:05,044 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:05,044 INFO L423 AbstractCegarLoop]: === Iteration 65 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:05,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:05,044 INFO L82 PathProgramCache]: Analyzing trace with hash -327186069, now seen corresponding path program 2 times [2018-09-26 08:08:05,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:05,059 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:05,059 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:08:05,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:05,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:05,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:05,060 INFO L87 Difference]: Start difference. First operand 3390 states and 5040 transitions. Second operand 11 states. [2018-09-26 08:08:06,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:06,737 INFO L93 Difference]: Finished difference Result 3713 states and 5498 transitions. [2018-09-26 08:08:06,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:08:06,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-09-26 08:08:06,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:06,741 INFO L225 Difference]: With dead ends: 3713 [2018-09-26 08:08:06,742 INFO L226 Difference]: Without dead ends: 3711 [2018-09-26 08:08:06,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:08:06,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2018-09-26 08:08:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3317. [2018-09-26 08:08:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3317 states. [2018-09-26 08:08:08,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4921 transitions. [2018-09-26 08:08:08,200 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4921 transitions. Word has length 25 [2018-09-26 08:08:08,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:08,200 INFO L480 AbstractCegarLoop]: Abstraction has 3317 states and 4921 transitions. [2018-09-26 08:08:08,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:08,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4921 transitions. [2018-09-26 08:08:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:08:08,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:08,203 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:08,204 INFO L423 AbstractCegarLoop]: === Iteration 66 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:08,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:08,204 INFO L82 PathProgramCache]: Analyzing trace with hash -682179085, now seen corresponding path program 1 times [2018-09-26 08:08:08,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:08,226 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:08,227 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:08,227 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:08:08,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:08,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:08,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:08,228 INFO L87 Difference]: Start difference. First operand 3317 states and 4921 transitions. Second operand 12 states. [2018-09-26 08:08:09,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:09,930 INFO L93 Difference]: Finished difference Result 3507 states and 5215 transitions. [2018-09-26 08:08:09,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:08:09,930 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-09-26 08:08:09,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:09,934 INFO L225 Difference]: With dead ends: 3507 [2018-09-26 08:08:09,934 INFO L226 Difference]: Without dead ends: 3506 [2018-09-26 08:08:09,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=242, Invalid=570, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:08:09,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2018-09-26 08:08:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3311. [2018-09-26 08:08:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3311 states. [2018-09-26 08:08:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 4896 transitions. [2018-09-26 08:08:11,356 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 4896 transitions. Word has length 25 [2018-09-26 08:08:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:11,356 INFO L480 AbstractCegarLoop]: Abstraction has 3311 states and 4896 transitions. [2018-09-26 08:08:11,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 4896 transitions. [2018-09-26 08:08:11,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:08:11,358 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:11,358 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:11,358 INFO L423 AbstractCegarLoop]: === Iteration 67 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:11,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:11,359 INFO L82 PathProgramCache]: Analyzing trace with hash -682089422, now seen corresponding path program 1 times [2018-09-26 08:08:11,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:11,376 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:11,376 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:08:11,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:11,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:11,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:11,377 INFO L87 Difference]: Start difference. First operand 3311 states and 4896 transitions. Second operand 11 states. [2018-09-26 08:08:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:13,121 INFO L93 Difference]: Finished difference Result 3779 states and 5560 transitions. [2018-09-26 08:08:13,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:08:13,121 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-09-26 08:08:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:13,125 INFO L225 Difference]: With dead ends: 3779 [2018-09-26 08:08:13,126 INFO L226 Difference]: Without dead ends: 3777 [2018-09-26 08:08:13,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=241, Invalid=571, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:08:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2018-09-26 08:08:14,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 3309. [2018-09-26 08:08:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3309 states. [2018-09-26 08:08:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3309 states to 3309 states and 4898 transitions. [2018-09-26 08:08:14,584 INFO L78 Accepts]: Start accepts. Automaton has 3309 states and 4898 transitions. Word has length 25 [2018-09-26 08:08:14,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:14,585 INFO L480 AbstractCegarLoop]: Abstraction has 3309 states and 4898 transitions. [2018-09-26 08:08:14,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3309 states and 4898 transitions. [2018-09-26 08:08:14,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:08:14,587 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:14,587 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:14,587 INFO L423 AbstractCegarLoop]: === Iteration 68 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:14,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:14,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1834260598, now seen corresponding path program 2 times [2018-09-26 08:08:14,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:14,602 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 08:08:14,602 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:14,602 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:08:14,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:14,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:14,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:14,603 INFO L87 Difference]: Start difference. First operand 3309 states and 4898 transitions. Second operand 11 states. [2018-09-26 08:08:16,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:16,137 INFO L93 Difference]: Finished difference Result 3453 states and 5091 transitions. [2018-09-26 08:08:16,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:08:16,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-09-26 08:08:16,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:16,141 INFO L225 Difference]: With dead ends: 3453 [2018-09-26 08:08:16,142 INFO L226 Difference]: Without dead ends: 3452 [2018-09-26 08:08:16,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:08:16,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2018-09-26 08:08:17,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 3335. [2018-09-26 08:08:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3335 states. [2018-09-26 08:08:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 4934 transitions. [2018-09-26 08:08:17,587 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 4934 transitions. Word has length 25 [2018-09-26 08:08:17,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:17,588 INFO L480 AbstractCegarLoop]: Abstraction has 3335 states and 4934 transitions. [2018-09-26 08:08:17,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:17,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4934 transitions. [2018-09-26 08:08:17,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:08:17,590 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:17,590 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:17,590 INFO L423 AbstractCegarLoop]: === Iteration 69 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:17,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:17,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1045899279, now seen corresponding path program 1 times [2018-09-26 08:08:17,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:17,614 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:17,614 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:08:17,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:17,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:17,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:17,615 INFO L87 Difference]: Start difference. First operand 3335 states and 4934 transitions. Second operand 11 states. [2018-09-26 08:08:20,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:20,170 INFO L93 Difference]: Finished difference Result 3881 states and 5736 transitions. [2018-09-26 08:08:20,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:08:20,170 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-09-26 08:08:20,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:20,174 INFO L225 Difference]: With dead ends: 3881 [2018-09-26 08:08:20,174 INFO L226 Difference]: Without dead ends: 3879 [2018-09-26 08:08:20,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:08:20,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3879 states. [2018-09-26 08:08:21,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3879 to 3492. [2018-09-26 08:08:21,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3492 states. [2018-09-26 08:08:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 3492 states and 5163 transitions. [2018-09-26 08:08:21,731 INFO L78 Accepts]: Start accepts. Automaton has 3492 states and 5163 transitions. Word has length 25 [2018-09-26 08:08:21,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:21,731 INFO L480 AbstractCegarLoop]: Abstraction has 3492 states and 5163 transitions. [2018-09-26 08:08:21,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3492 states and 5163 transitions. [2018-09-26 08:08:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:08:21,733 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:21,733 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:21,734 INFO L423 AbstractCegarLoop]: === Iteration 70 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:21,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:21,734 INFO L82 PathProgramCache]: Analyzing trace with hash -746629056, now seen corresponding path program 1 times [2018-09-26 08:08:21,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:21,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:08:21,749 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:21,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:08:21,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:08:21,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:08:21,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:08:21,750 INFO L87 Difference]: Start difference. First operand 3492 states and 5163 transitions. Second operand 10 states. [2018-09-26 08:08:23,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:23,521 INFO L93 Difference]: Finished difference Result 3625 states and 5347 transitions. [2018-09-26 08:08:23,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:08:23,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-09-26 08:08:23,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:23,526 INFO L225 Difference]: With dead ends: 3625 [2018-09-26 08:08:23,526 INFO L226 Difference]: Without dead ends: 3624 [2018-09-26 08:08:23,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:08:23,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3624 states. [2018-09-26 08:08:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3624 to 3506. [2018-09-26 08:08:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3506 states. [2018-09-26 08:08:25,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3506 states to 3506 states and 5185 transitions. [2018-09-26 08:08:25,189 INFO L78 Accepts]: Start accepts. Automaton has 3506 states and 5185 transitions. Word has length 25 [2018-09-26 08:08:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:25,190 INFO L480 AbstractCegarLoop]: Abstraction has 3506 states and 5185 transitions. [2018-09-26 08:08:25,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:08:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3506 states and 5185 transitions. [2018-09-26 08:08:25,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:08:25,192 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:25,192 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:25,192 INFO L423 AbstractCegarLoop]: === Iteration 71 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:25,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:25,193 INFO L82 PathProgramCache]: Analyzing trace with hash -746540097, now seen corresponding path program 1 times [2018-09-26 08:08:25,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:25,208 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:25,208 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:08:25,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:08:25,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:08:25,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:08:25,209 INFO L87 Difference]: Start difference. First operand 3506 states and 5185 transitions. Second operand 10 states. [2018-09-26 08:08:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:27,284 INFO L93 Difference]: Finished difference Result 3779 states and 5600 transitions. [2018-09-26 08:08:27,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:08:27,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-09-26 08:08:27,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:27,288 INFO L225 Difference]: With dead ends: 3779 [2018-09-26 08:08:27,289 INFO L226 Difference]: Without dead ends: 3777 [2018-09-26 08:08:27,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:08:27,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2018-09-26 08:08:28,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 3508. [2018-09-26 08:08:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3508 states. [2018-09-26 08:08:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3508 states to 3508 states and 5186 transitions. [2018-09-26 08:08:28,951 INFO L78 Accepts]: Start accepts. Automaton has 3508 states and 5186 transitions. Word has length 25 [2018-09-26 08:08:28,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:28,951 INFO L480 AbstractCegarLoop]: Abstraction has 3508 states and 5186 transitions. [2018-09-26 08:08:28,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:08:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3508 states and 5186 transitions. [2018-09-26 08:08:28,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:08:28,953 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:28,953 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:28,954 INFO L423 AbstractCegarLoop]: === Iteration 72 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:28,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:28,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2007923005, now seen corresponding path program 1 times [2018-09-26 08:08:28,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:28,975 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:28,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:08:28,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:28,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:28,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:28,975 INFO L87 Difference]: Start difference. First operand 3508 states and 5186 transitions. Second operand 11 states. [2018-09-26 08:08:30,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:30,974 INFO L93 Difference]: Finished difference Result 4106 states and 6063 transitions. [2018-09-26 08:08:30,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:08:30,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-09-26 08:08:30,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:30,979 INFO L225 Difference]: With dead ends: 4106 [2018-09-26 08:08:30,979 INFO L226 Difference]: Without dead ends: 4104 [2018-09-26 08:08:30,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:08:30,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4104 states. [2018-09-26 08:08:32,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4104 to 3808. [2018-09-26 08:08:32,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3808 states. [2018-09-26 08:08:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3808 states to 3808 states and 5645 transitions. [2018-09-26 08:08:32,715 INFO L78 Accepts]: Start accepts. Automaton has 3808 states and 5645 transitions. Word has length 25 [2018-09-26 08:08:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:32,715 INFO L480 AbstractCegarLoop]: Abstraction has 3808 states and 5645 transitions. [2018-09-26 08:08:32,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3808 states and 5645 transitions. [2018-09-26 08:08:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:08:32,718 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:32,718 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:32,718 INFO L423 AbstractCegarLoop]: === Iteration 73 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:32,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:32,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1294788559, now seen corresponding path program 2 times [2018-09-26 08:08:32,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:32,736 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:32,737 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:32,737 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:08:32,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:32,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:32,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:32,738 INFO L87 Difference]: Start difference. First operand 3808 states and 5645 transitions. Second operand 11 states. [2018-09-26 08:08:34,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:34,678 INFO L93 Difference]: Finished difference Result 4020 states and 5953 transitions. [2018-09-26 08:08:34,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:08:34,678 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-09-26 08:08:34,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:34,682 INFO L225 Difference]: With dead ends: 4020 [2018-09-26 08:08:34,682 INFO L226 Difference]: Without dead ends: 4018 [2018-09-26 08:08:34,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:08:34,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4018 states. [2018-09-26 08:08:36,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4018 to 3902. [2018-09-26 08:08:36,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3902 states. [2018-09-26 08:08:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3902 states to 3902 states and 5795 transitions. [2018-09-26 08:08:36,440 INFO L78 Accepts]: Start accepts. Automaton has 3902 states and 5795 transitions. Word has length 25 [2018-09-26 08:08:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:36,440 INFO L480 AbstractCegarLoop]: Abstraction has 3902 states and 5795 transitions. [2018-09-26 08:08:36,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:36,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3902 states and 5795 transitions. [2018-09-26 08:08:36,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:08:36,442 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:36,442 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:36,443 INFO L423 AbstractCegarLoop]: === Iteration 74 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:36,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:36,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1649781575, now seen corresponding path program 1 times [2018-09-26 08:08:36,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:36,461 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:36,461 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:08:36,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:36,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:36,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:36,462 INFO L87 Difference]: Start difference. First operand 3902 states and 5795 transitions. Second operand 11 states. [2018-09-26 08:08:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:38,416 INFO L93 Difference]: Finished difference Result 4050 states and 5999 transitions. [2018-09-26 08:08:38,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:08:38,416 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-09-26 08:08:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:38,420 INFO L225 Difference]: With dead ends: 4050 [2018-09-26 08:08:38,420 INFO L226 Difference]: Without dead ends: 4048 [2018-09-26 08:08:38,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:08:38,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4048 states. [2018-09-26 08:08:40,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4048 to 3881. [2018-09-26 08:08:40,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3881 states. [2018-09-26 08:08:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3881 states to 3881 states and 5763 transitions. [2018-09-26 08:08:40,149 INFO L78 Accepts]: Start accepts. Automaton has 3881 states and 5763 transitions. Word has length 25 [2018-09-26 08:08:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:40,150 INFO L480 AbstractCegarLoop]: Abstraction has 3881 states and 5763 transitions. [2018-09-26 08:08:40,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3881 states and 5763 transitions. [2018-09-26 08:08:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:08:40,152 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:40,152 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:40,152 INFO L423 AbstractCegarLoop]: === Iteration 75 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:40,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:40,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1238220129, now seen corresponding path program 3 times [2018-09-26 08:08:40,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:40,176 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:40,176 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:08:40,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:08:40,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:08:40,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:08:40,177 INFO L87 Difference]: Start difference. First operand 3881 states and 5763 transitions. Second operand 12 states. [2018-09-26 08:08:42,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:42,767 INFO L93 Difference]: Finished difference Result 4100 states and 6121 transitions. [2018-09-26 08:08:42,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:08:42,768 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-09-26 08:08:42,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:42,772 INFO L225 Difference]: With dead ends: 4100 [2018-09-26 08:08:42,773 INFO L226 Difference]: Without dead ends: 4099 [2018-09-26 08:08:42,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:08:42,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2018-09-26 08:08:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 3881. [2018-09-26 08:08:44,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3881 states. [2018-09-26 08:08:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3881 states to 3881 states and 5751 transitions. [2018-09-26 08:08:44,584 INFO L78 Accepts]: Start accepts. Automaton has 3881 states and 5751 transitions. Word has length 25 [2018-09-26 08:08:44,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:44,584 INFO L480 AbstractCegarLoop]: Abstraction has 3881 states and 5751 transitions. [2018-09-26 08:08:44,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:08:44,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3881 states and 5751 transitions. [2018-09-26 08:08:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:08:44,586 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:44,586 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:44,587 INFO L423 AbstractCegarLoop]: === Iteration 76 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:44,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:44,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1238131170, now seen corresponding path program 1 times [2018-09-26 08:08:44,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:44,605 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:44,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:08:44,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:44,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:44,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:44,606 INFO L87 Difference]: Start difference. First operand 3881 states and 5751 transitions. Second operand 11 states. [2018-09-26 08:08:46,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:46,728 INFO L93 Difference]: Finished difference Result 4334 states and 6405 transitions. [2018-09-26 08:08:46,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:08:46,728 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-09-26 08:08:46,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:46,733 INFO L225 Difference]: With dead ends: 4334 [2018-09-26 08:08:46,733 INFO L226 Difference]: Without dead ends: 4332 [2018-09-26 08:08:46,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=241, Invalid=571, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:08:46,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4332 states. [2018-09-26 08:08:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4332 to 3884. [2018-09-26 08:08:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3884 states. [2018-09-26 08:08:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3884 states to 3884 states and 5761 transitions. [2018-09-26 08:08:48,551 INFO L78 Accepts]: Start accepts. Automaton has 3884 states and 5761 transitions. Word has length 25 [2018-09-26 08:08:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:48,552 INFO L480 AbstractCegarLoop]: Abstraction has 3884 states and 5761 transitions. [2018-09-26 08:08:48,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:48,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3884 states and 5761 transitions. [2018-09-26 08:08:48,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:08:48,554 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:48,554 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:48,554 INFO L423 AbstractCegarLoop]: === Iteration 77 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:48,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:48,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1593213145, now seen corresponding path program 2 times [2018-09-26 08:08:48,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:48,573 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:48,573 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:08:48,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:48,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:48,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:48,574 INFO L87 Difference]: Start difference. First operand 3884 states and 5761 transitions. Second operand 11 states. [2018-09-26 08:08:50,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:50,683 INFO L93 Difference]: Finished difference Result 4233 states and 6284 transitions. [2018-09-26 08:08:50,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:08:50,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-09-26 08:08:50,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:50,689 INFO L225 Difference]: With dead ends: 4233 [2018-09-26 08:08:50,690 INFO L226 Difference]: Without dead ends: 4231 [2018-09-26 08:08:50,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:08:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2018-09-26 08:08:52,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 3898. [2018-09-26 08:08:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3898 states. [2018-09-26 08:08:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 5767 transitions. [2018-09-26 08:08:52,564 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 5767 transitions. Word has length 25 [2018-09-26 08:08:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:52,565 INFO L480 AbstractCegarLoop]: Abstraction has 3898 states and 5767 transitions. [2018-09-26 08:08:52,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 5767 transitions. [2018-09-26 08:08:52,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:08:52,567 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:52,567 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:52,567 INFO L423 AbstractCegarLoop]: === Iteration 78 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:52,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:52,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1654342873, now seen corresponding path program 3 times [2018-09-26 08:08:52,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:08:52,586 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:52,586 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:08:52,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:08:52,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:08:52,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:08:52,587 INFO L87 Difference]: Start difference. First operand 3898 states and 5767 transitions. Second operand 11 states. [2018-09-26 08:08:54,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:54,727 INFO L93 Difference]: Finished difference Result 4193 states and 6183 transitions. [2018-09-26 08:08:54,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:08:54,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-09-26 08:08:54,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:54,732 INFO L225 Difference]: With dead ends: 4193 [2018-09-26 08:08:54,732 INFO L226 Difference]: Without dead ends: 4191 [2018-09-26 08:08:54,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:08:54,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4191 states. [2018-09-26 08:08:56,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4191 to 3545. [2018-09-26 08:08:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3545 states. [2018-09-26 08:08:56,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3545 states to 3545 states and 5244 transitions. [2018-09-26 08:08:56,450 INFO L78 Accepts]: Start accepts. Automaton has 3545 states and 5244 transitions. Word has length 25 [2018-09-26 08:08:56,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:08:56,451 INFO L480 AbstractCegarLoop]: Abstraction has 3545 states and 5244 transitions. [2018-09-26 08:08:56,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:08:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3545 states and 5244 transitions. [2018-09-26 08:08:56,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:08:56,453 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:08:56,453 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:08:56,453 INFO L423 AbstractCegarLoop]: === Iteration 79 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:08:56,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:08:56,454 INFO L82 PathProgramCache]: Analyzing trace with hash 787908893, now seen corresponding path program 3 times [2018-09-26 08:08:56,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:08:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:08:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 08:08:56,467 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:08:56,467 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:08:56,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:08:56,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:08:56,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:08:56,467 INFO L87 Difference]: Start difference. First operand 3545 states and 5244 transitions. Second operand 9 states. [2018-09-26 08:08:58,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:08:58,489 INFO L93 Difference]: Finished difference Result 3941 states and 5794 transitions. [2018-09-26 08:08:58,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:08:58,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-09-26 08:08:58,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:08:58,494 INFO L225 Difference]: With dead ends: 3941 [2018-09-26 08:08:58,494 INFO L226 Difference]: Without dead ends: 3939 [2018-09-26 08:08:58,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:08:58,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2018-09-26 08:09:00,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 3561. [2018-09-26 08:09:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3561 states. [2018-09-26 08:09:00,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 5266 transitions. [2018-09-26 08:09:00,195 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 5266 transitions. Word has length 26 [2018-09-26 08:09:00,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:00,195 INFO L480 AbstractCegarLoop]: Abstraction has 3561 states and 5266 transitions. [2018-09-26 08:09:00,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:09:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 5266 transitions. [2018-09-26 08:09:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:09:00,199 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:00,199 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:00,199 INFO L423 AbstractCegarLoop]: === Iteration 80 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:00,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:00,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1399836586, now seen corresponding path program 1 times [2018-09-26 08:09:00,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:09:00,216 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:00,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:09:00,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:09:00,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:09:00,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:09:00,217 INFO L87 Difference]: Start difference. First operand 3561 states and 5266 transitions. Second operand 9 states. [2018-09-26 08:09:02,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:02,720 INFO L93 Difference]: Finished difference Result 4069 states and 5985 transitions. [2018-09-26 08:09:02,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:09:02,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-09-26 08:09:02,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:02,724 INFO L225 Difference]: With dead ends: 4069 [2018-09-26 08:09:02,725 INFO L226 Difference]: Without dead ends: 4067 [2018-09-26 08:09:02,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:09:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2018-09-26 08:09:04,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 3477. [2018-09-26 08:09:04,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3477 states. [2018-09-26 08:09:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3477 states to 3477 states and 5132 transitions. [2018-09-26 08:09:04,425 INFO L78 Accepts]: Start accepts. Automaton has 3477 states and 5132 transitions. Word has length 26 [2018-09-26 08:09:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:04,426 INFO L480 AbstractCegarLoop]: Abstraction has 3477 states and 5132 transitions. [2018-09-26 08:09:04,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:09:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3477 states and 5132 transitions. [2018-09-26 08:09:04,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:09:04,427 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:04,427 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:04,428 INFO L423 AbstractCegarLoop]: === Iteration 81 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:04,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:04,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2111506926, now seen corresponding path program 1 times [2018-09-26 08:09:04,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:09:04,440 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:04,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:09:04,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:09:04,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:09:04,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:09:04,441 INFO L87 Difference]: Start difference. First operand 3477 states and 5132 transitions. Second operand 9 states. [2018-09-26 08:09:06,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:06,660 INFO L93 Difference]: Finished difference Result 4012 states and 5890 transitions. [2018-09-26 08:09:06,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:09:06,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-09-26 08:09:06,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:06,664 INFO L225 Difference]: With dead ends: 4012 [2018-09-26 08:09:06,664 INFO L226 Difference]: Without dead ends: 4010 [2018-09-26 08:09:06,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:09:06,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4010 states. [2018-09-26 08:09:08,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4010 to 3427. [2018-09-26 08:09:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3427 states. [2018-09-26 08:09:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 5054 transitions. [2018-09-26 08:09:08,398 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 5054 transitions. Word has length 26 [2018-09-26 08:09:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:08,399 INFO L480 AbstractCegarLoop]: Abstraction has 3427 states and 5054 transitions. [2018-09-26 08:09:08,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:09:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 5054 transitions. [2018-09-26 08:09:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:09:08,400 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:08,400 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:08,401 INFO L423 AbstractCegarLoop]: === Iteration 82 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:08,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:08,401 INFO L82 PathProgramCache]: Analyzing trace with hash -538919271, now seen corresponding path program 3 times [2018-09-26 08:09:08,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 08:09:08,413 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:08,413 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:09:08,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:09:08,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:09:08,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:09:08,414 INFO L87 Difference]: Start difference. First operand 3427 states and 5054 transitions. Second operand 9 states. [2018-09-26 08:09:10,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:10,483 INFO L93 Difference]: Finished difference Result 3823 states and 5604 transitions. [2018-09-26 08:09:10,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:09:10,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-09-26 08:09:10,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:10,487 INFO L225 Difference]: With dead ends: 3823 [2018-09-26 08:09:10,488 INFO L226 Difference]: Without dead ends: 3821 [2018-09-26 08:09:10,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:09:10,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2018-09-26 08:09:12,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 3443. [2018-09-26 08:09:12,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3443 states. [2018-09-26 08:09:12,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 5076 transitions. [2018-09-26 08:09:12,274 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 5076 transitions. Word has length 26 [2018-09-26 08:09:12,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:12,275 INFO L480 AbstractCegarLoop]: Abstraction has 3443 states and 5076 transitions. [2018-09-26 08:09:12,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:09:12,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 5076 transitions. [2018-09-26 08:09:12,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:09:12,276 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:12,276 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:12,277 INFO L423 AbstractCegarLoop]: === Iteration 83 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:12,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:12,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1694948846, now seen corresponding path program 1 times [2018-09-26 08:09:12,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:12,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:09:12,291 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:12,291 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:09:12,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:09:12,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:09:12,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:09:12,292 INFO L87 Difference]: Start difference. First operand 3443 states and 5076 transitions. Second operand 9 states. [2018-09-26 08:09:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:14,512 INFO L93 Difference]: Finished difference Result 3990 states and 5852 transitions. [2018-09-26 08:09:14,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:09:14,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-09-26 08:09:14,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:14,516 INFO L225 Difference]: With dead ends: 3990 [2018-09-26 08:09:14,517 INFO L226 Difference]: Without dead ends: 3988 [2018-09-26 08:09:14,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:09:14,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3988 states. [2018-09-26 08:09:16,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3988 to 3412. [2018-09-26 08:09:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3412 states. [2018-09-26 08:09:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 5028 transitions. [2018-09-26 08:09:16,338 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 5028 transitions. Word has length 26 [2018-09-26 08:09:16,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:16,339 INFO L480 AbstractCegarLoop]: Abstraction has 3412 states and 5028 transitions. [2018-09-26 08:09:16,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:09:16,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 5028 transitions. [2018-09-26 08:09:16,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:09:16,340 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:16,340 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:16,341 INFO L423 AbstractCegarLoop]: === Iteration 84 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:16,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:16,341 INFO L82 PathProgramCache]: Analyzing trace with hash 729902152, now seen corresponding path program 1 times [2018-09-26 08:09:16,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:09:16,354 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:16,354 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:09:16,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:09:16,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:09:16,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:09:16,355 INFO L87 Difference]: Start difference. First operand 3412 states and 5028 transitions. Second operand 9 states. [2018-09-26 08:09:18,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:18,533 INFO L93 Difference]: Finished difference Result 3873 states and 5676 transitions. [2018-09-26 08:09:18,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:09:18,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-09-26 08:09:18,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:18,538 INFO L225 Difference]: With dead ends: 3873 [2018-09-26 08:09:18,538 INFO L226 Difference]: Without dead ends: 3871 [2018-09-26 08:09:18,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:09:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2018-09-26 08:09:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 3309. [2018-09-26 08:09:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3309 states. [2018-09-26 08:09:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3309 states to 3309 states and 4864 transitions. [2018-09-26 08:09:20,333 INFO L78 Accepts]: Start accepts. Automaton has 3309 states and 4864 transitions. Word has length 26 [2018-09-26 08:09:20,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:20,333 INFO L480 AbstractCegarLoop]: Abstraction has 3309 states and 4864 transitions. [2018-09-26 08:09:20,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:09:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3309 states and 4864 transitions. [2018-09-26 08:09:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:09:20,335 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:20,335 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:20,335 INFO L423 AbstractCegarLoop]: === Iteration 85 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:20,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:20,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1263161747, now seen corresponding path program 2 times [2018-09-26 08:09:20,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:20,353 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:20,353 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:09:20,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:09:20,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:09:20,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:09:20,354 INFO L87 Difference]: Start difference. First operand 3309 states and 4864 transitions. Second operand 10 states. [2018-09-26 08:09:22,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:22,520 INFO L93 Difference]: Finished difference Result 3625 states and 5291 transitions. [2018-09-26 08:09:22,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:09:22,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-09-26 08:09:22,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:22,524 INFO L225 Difference]: With dead ends: 3625 [2018-09-26 08:09:22,524 INFO L226 Difference]: Without dead ends: 3623 [2018-09-26 08:09:22,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:09:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2018-09-26 08:09:24,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3411. [2018-09-26 08:09:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3411 states. [2018-09-26 08:09:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3411 states to 3411 states and 5008 transitions. [2018-09-26 08:09:24,382 INFO L78 Accepts]: Start accepts. Automaton has 3411 states and 5008 transitions. Word has length 29 [2018-09-26 08:09:24,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:24,382 INFO L480 AbstractCegarLoop]: Abstraction has 3411 states and 5008 transitions. [2018-09-26 08:09:24,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:09:24,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3411 states and 5008 transitions. [2018-09-26 08:09:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:09:24,385 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:24,385 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:24,386 INFO L423 AbstractCegarLoop]: === Iteration 86 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:24,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:24,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1259223192, now seen corresponding path program 2 times [2018-09-26 08:09:24,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:24,401 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:24,401 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:09:24,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:09:24,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:09:24,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:09:24,402 INFO L87 Difference]: Start difference. First operand 3411 states and 5008 transitions. Second operand 10 states. [2018-09-26 08:09:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:26,827 INFO L93 Difference]: Finished difference Result 3682 states and 5400 transitions. [2018-09-26 08:09:26,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:09:26,828 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-09-26 08:09:26,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:26,833 INFO L225 Difference]: With dead ends: 3682 [2018-09-26 08:09:26,833 INFO L226 Difference]: Without dead ends: 3680 [2018-09-26 08:09:26,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:09:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2018-09-26 08:09:28,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3422. [2018-09-26 08:09:28,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3422 states. [2018-09-26 08:09:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 5023 transitions. [2018-09-26 08:09:28,730 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 5023 transitions. Word has length 29 [2018-09-26 08:09:28,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:28,731 INFO L480 AbstractCegarLoop]: Abstraction has 3422 states and 5023 transitions. [2018-09-26 08:09:28,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:09:28,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 5023 transitions. [2018-09-26 08:09:28,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:09:28,733 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:28,733 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:28,734 INFO L423 AbstractCegarLoop]: === Iteration 87 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:28,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:28,734 INFO L82 PathProgramCache]: Analyzing trace with hash 904319839, now seen corresponding path program 2 times [2018-09-26 08:09:28,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 08:09:28,748 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:28,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:09:28,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:09:28,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:09:28,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:09:28,749 INFO L87 Difference]: Start difference. First operand 3422 states and 5023 transitions. Second operand 9 states. [2018-09-26 08:09:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:30,833 INFO L93 Difference]: Finished difference Result 3641 states and 5314 transitions. [2018-09-26 08:09:30,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:09:30,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-09-26 08:09:30,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:30,837 INFO L225 Difference]: With dead ends: 3641 [2018-09-26 08:09:30,837 INFO L226 Difference]: Without dead ends: 3639 [2018-09-26 08:09:30,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:09:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2018-09-26 08:09:32,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 3420. [2018-09-26 08:09:32,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3420 states. [2018-09-26 08:09:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3420 states to 3420 states and 5021 transitions. [2018-09-26 08:09:32,713 INFO L78 Accepts]: Start accepts. Automaton has 3420 states and 5021 transitions. Word has length 29 [2018-09-26 08:09:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:32,713 INFO L480 AbstractCegarLoop]: Abstraction has 3420 states and 5021 transitions. [2018-09-26 08:09:32,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:09:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3420 states and 5021 transitions. [2018-09-26 08:09:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:09:32,715 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:32,715 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:32,716 INFO L423 AbstractCegarLoop]: === Iteration 88 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:32,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:32,716 INFO L82 PathProgramCache]: Analyzing trace with hash 987070039, now seen corresponding path program 3 times [2018-09-26 08:09:32,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:32,732 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:32,732 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:09:32,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:09:32,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:09:32,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:09:32,732 INFO L87 Difference]: Start difference. First operand 3420 states and 5021 transitions. Second operand 12 states. [2018-09-26 08:09:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:35,053 INFO L93 Difference]: Finished difference Result 3801 states and 5543 transitions. [2018-09-26 08:09:35,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:09:35,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-09-26 08:09:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:35,058 INFO L225 Difference]: With dead ends: 3801 [2018-09-26 08:09:35,058 INFO L226 Difference]: Without dead ends: 3799 [2018-09-26 08:09:35,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:09:35,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3799 states. [2018-09-26 08:09:37,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3799 to 3547. [2018-09-26 08:09:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3547 states. [2018-09-26 08:09:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 5208 transitions. [2018-09-26 08:09:37,126 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 5208 transitions. Word has length 29 [2018-09-26 08:09:37,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:37,126 INFO L480 AbstractCegarLoop]: Abstraction has 3547 states and 5208 transitions. [2018-09-26 08:09:37,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:09:37,126 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 5208 transitions. [2018-09-26 08:09:37,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:09:37,129 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:37,129 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:37,129 INFO L423 AbstractCegarLoop]: === Iteration 89 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:37,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:37,129 INFO L82 PathProgramCache]: Analyzing trace with hash 983131868, now seen corresponding path program 1 times [2018-09-26 08:09:37,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:09:37,145 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:37,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:09:37,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:09:37,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:09:37,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:09:37,146 INFO L87 Difference]: Start difference. First operand 3547 states and 5208 transitions. Second operand 11 states. [2018-09-26 08:09:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:39,917 INFO L93 Difference]: Finished difference Result 3952 states and 5785 transitions. [2018-09-26 08:09:39,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:09:39,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-09-26 08:09:39,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:39,921 INFO L225 Difference]: With dead ends: 3952 [2018-09-26 08:09:39,921 INFO L226 Difference]: Without dead ends: 3950 [2018-09-26 08:09:39,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=227, Invalid=585, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:09:39,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2018-09-26 08:09:42,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 3525. [2018-09-26 08:09:42,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3525 states. [2018-09-26 08:09:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 5180 transitions. [2018-09-26 08:09:42,033 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 5180 transitions. Word has length 29 [2018-09-26 08:09:42,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:42,033 INFO L480 AbstractCegarLoop]: Abstraction has 3525 states and 5180 transitions. [2018-09-26 08:09:42,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:09:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 5180 transitions. [2018-09-26 08:09:42,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:09:42,035 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:42,035 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:42,035 INFO L423 AbstractCegarLoop]: === Iteration 90 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:42,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:42,036 INFO L82 PathProgramCache]: Analyzing trace with hash 983131484, now seen corresponding path program 3 times [2018-09-26 08:09:42,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:42,051 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:09:42,051 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:42,051 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:09:42,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:09:42,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:09:42,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:09:42,051 INFO L87 Difference]: Start difference. First operand 3525 states and 5180 transitions. Second operand 11 states. [2018-09-26 08:09:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:44,613 INFO L93 Difference]: Finished difference Result 3893 states and 5708 transitions. [2018-09-26 08:09:44,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:09:44,613 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-09-26 08:09:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:44,617 INFO L225 Difference]: With dead ends: 3893 [2018-09-26 08:09:44,617 INFO L226 Difference]: Without dead ends: 3891 [2018-09-26 08:09:44,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:09:44,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3891 states. [2018-09-26 08:09:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3891 to 3651. [2018-09-26 08:09:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3651 states. [2018-09-26 08:09:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 5369 transitions. [2018-09-26 08:09:46,759 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 5369 transitions. Word has length 29 [2018-09-26 08:09:46,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:46,759 INFO L480 AbstractCegarLoop]: Abstraction has 3651 states and 5369 transitions. [2018-09-26 08:09:46,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:09:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 5369 transitions. [2018-09-26 08:09:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:09:46,762 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:46,762 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:46,762 INFO L423 AbstractCegarLoop]: === Iteration 91 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:46,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:46,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1481907752, now seen corresponding path program 1 times [2018-09-26 08:09:46,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:09:46,776 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:46,776 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:09:46,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:09:46,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:09:46,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:09:46,777 INFO L87 Difference]: Start difference. First operand 3651 states and 5369 transitions. Second operand 11 states. [2018-09-26 08:09:50,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:50,101 INFO L93 Difference]: Finished difference Result 4812 states and 7078 transitions. [2018-09-26 08:09:50,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:09:50,101 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-09-26 08:09:50,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:50,108 INFO L225 Difference]: With dead ends: 4812 [2018-09-26 08:09:50,108 INFO L226 Difference]: Without dead ends: 4810 [2018-09-26 08:09:50,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:09:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2018-09-26 08:09:52,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4121. [2018-09-26 08:09:52,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4121 states. [2018-09-26 08:09:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 6087 transitions. [2018-09-26 08:09:52,527 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 6087 transitions. Word has length 29 [2018-09-26 08:09:52,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:52,527 INFO L480 AbstractCegarLoop]: Abstraction has 4121 states and 6087 transitions. [2018-09-26 08:09:52,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:09:52,527 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 6087 transitions. [2018-09-26 08:09:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:09:52,530 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:52,530 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:52,530 INFO L423 AbstractCegarLoop]: === Iteration 92 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:52,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:52,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1420688361, now seen corresponding path program 1 times [2018-09-26 08:09:52,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:09:52,550 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:52,550 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:09:52,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:09:52,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:09:52,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:09:52,551 INFO L87 Difference]: Start difference. First operand 4121 states and 6087 transitions. Second operand 11 states. [2018-09-26 08:09:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:09:56,096 INFO L93 Difference]: Finished difference Result 4922 states and 7248 transitions. [2018-09-26 08:09:56,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:09:56,096 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-09-26 08:09:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:09:56,102 INFO L225 Difference]: With dead ends: 4922 [2018-09-26 08:09:56,102 INFO L226 Difference]: Without dead ends: 4920 [2018-09-26 08:09:56,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=233, Invalid=579, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:09:56,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4920 states. [2018-09-26 08:09:58,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4920 to 4061. [2018-09-26 08:09:58,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4061 states. [2018-09-26 08:09:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4061 states to 4061 states and 5988 transitions. [2018-09-26 08:09:58,559 INFO L78 Accepts]: Start accepts. Automaton has 4061 states and 5988 transitions. Word has length 29 [2018-09-26 08:09:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:09:58,560 INFO L480 AbstractCegarLoop]: Abstraction has 4061 states and 5988 transitions. [2018-09-26 08:09:58,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:09:58,560 INFO L276 IsEmpty]: Start isEmpty. Operand 4061 states and 5988 transitions. [2018-09-26 08:09:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:09:58,563 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:09:58,563 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:09:58,563 INFO L423 AbstractCegarLoop]: === Iteration 93 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:09:58,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:09:58,563 INFO L82 PathProgramCache]: Analyzing trace with hash -474699493, now seen corresponding path program 4 times [2018-09-26 08:09:58,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:09:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:09:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-26 08:09:58,581 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:09:58,581 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:09:58,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:09:58,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:09:58,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:09:58,582 INFO L87 Difference]: Start difference. First operand 4061 states and 5988 transitions. Second operand 12 states. [2018-09-26 08:10:01,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:01,440 INFO L93 Difference]: Finished difference Result 4233 states and 6241 transitions. [2018-09-26 08:10:01,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:10:01,441 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-09-26 08:10:01,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:01,445 INFO L225 Difference]: With dead ends: 4233 [2018-09-26 08:10:01,446 INFO L226 Difference]: Without dead ends: 4232 [2018-09-26 08:10:01,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:10:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4232 states. [2018-09-26 08:10:03,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4232 to 3882. [2018-09-26 08:10:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3882 states. [2018-09-26 08:10:03,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3882 states to 3882 states and 5730 transitions. [2018-09-26 08:10:03,878 INFO L78 Accepts]: Start accepts. Automaton has 3882 states and 5730 transitions. Word has length 29 [2018-09-26 08:10:03,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:03,878 INFO L480 AbstractCegarLoop]: Abstraction has 3882 states and 5730 transitions. [2018-09-26 08:10:03,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:10:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3882 states and 5730 transitions. [2018-09-26 08:10:03,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:10:03,880 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:03,880 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:03,881 INFO L423 AbstractCegarLoop]: === Iteration 94 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:03,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:03,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2006031348, now seen corresponding path program 1 times [2018-09-26 08:10:03,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 08:10:03,897 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:03,898 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:10:03,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:10:03,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:10:03,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:03,898 INFO L87 Difference]: Start difference. First operand 3882 states and 5730 transitions. Second operand 11 states. [2018-09-26 08:10:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:06,856 INFO L93 Difference]: Finished difference Result 4266 states and 6268 transitions. [2018-09-26 08:10:06,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:10:06,856 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-09-26 08:10:06,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:06,861 INFO L225 Difference]: With dead ends: 4266 [2018-09-26 08:10:06,862 INFO L226 Difference]: Without dead ends: 4264 [2018-09-26 08:10:06,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:10:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4264 states. [2018-09-26 08:10:09,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4264 to 3417. [2018-09-26 08:10:09,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3417 states. [2018-09-26 08:10:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 5047 transitions. [2018-09-26 08:10:09,112 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 5047 transitions. Word has length 29 [2018-09-26 08:10:09,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:09,113 INFO L480 AbstractCegarLoop]: Abstraction has 3417 states and 5047 transitions. [2018-09-26 08:10:09,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:10:09,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5047 transitions. [2018-09-26 08:10:09,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:10:09,115 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:09,115 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:09,115 INFO L423 AbstractCegarLoop]: === Iteration 95 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:09,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:09,116 INFO L82 PathProgramCache]: Analyzing trace with hash -478637664, now seen corresponding path program 2 times [2018-09-26 08:10:09,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-26 08:10:09,139 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:09,139 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:10:09,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:10:09,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:10:09,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:09,140 INFO L87 Difference]: Start difference. First operand 3417 states and 5047 transitions. Second operand 12 states. [2018-09-26 08:10:12,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:12,568 INFO L93 Difference]: Finished difference Result 4483 states and 6607 transitions. [2018-09-26 08:10:12,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:10:12,568 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-09-26 08:10:12,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:12,574 INFO L225 Difference]: With dead ends: 4483 [2018-09-26 08:10:12,574 INFO L226 Difference]: Without dead ends: 4481 [2018-09-26 08:10:12,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:10:12,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4481 states. [2018-09-26 08:10:15,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4481 to 3901. [2018-09-26 08:10:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3901 states. [2018-09-26 08:10:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 5762 transitions. [2018-09-26 08:10:15,153 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 5762 transitions. Word has length 29 [2018-09-26 08:10:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:15,153 INFO L480 AbstractCegarLoop]: Abstraction has 3901 states and 5762 transitions. [2018-09-26 08:10:15,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:10:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 5762 transitions. [2018-09-26 08:10:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:10:15,155 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:15,155 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:15,156 INFO L423 AbstractCegarLoop]: === Iteration 96 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:15,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:15,156 INFO L82 PathProgramCache]: Analyzing trace with hash -478638048, now seen corresponding path program 4 times [2018-09-26 08:10:15,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:15,172 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:15,172 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:10:15,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:10:15,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:10:15,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:10:15,172 INFO L87 Difference]: Start difference. First operand 3901 states and 5762 transitions. Second operand 11 states. [2018-09-26 08:10:18,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:18,618 INFO L93 Difference]: Finished difference Result 4463 states and 6547 transitions. [2018-09-26 08:10:18,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:10:18,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-09-26 08:10:18,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:18,623 INFO L225 Difference]: With dead ends: 4463 [2018-09-26 08:10:18,623 INFO L226 Difference]: Without dead ends: 4461 [2018-09-26 08:10:18,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=321, Invalid=869, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:10:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4461 states. [2018-09-26 08:10:21,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4461 to 3965. [2018-09-26 08:10:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3965 states. [2018-09-26 08:10:21,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 5852 transitions. [2018-09-26 08:10:21,167 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 5852 transitions. Word has length 29 [2018-09-26 08:10:21,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:21,167 INFO L480 AbstractCegarLoop]: Abstraction has 3965 states and 5852 transitions. [2018-09-26 08:10:21,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:10:21,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 5852 transitions. [2018-09-26 08:10:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:10:21,169 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:21,169 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:21,170 INFO L423 AbstractCegarLoop]: === Iteration 97 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:21,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:21,170 INFO L82 PathProgramCache]: Analyzing trace with hash 570846522, now seen corresponding path program 1 times [2018-09-26 08:10:21,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:21,187 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:21,187 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:10:21,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:10:21,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:10:21,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:10:21,188 INFO L87 Difference]: Start difference. First operand 3965 states and 5852 transitions. Second operand 13 states. [2018-09-26 08:10:25,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:25,197 INFO L93 Difference]: Finished difference Result 5093 states and 7513 transitions. [2018-09-26 08:10:25,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:10:25,198 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-09-26 08:10:25,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:25,203 INFO L225 Difference]: With dead ends: 5093 [2018-09-26 08:10:25,203 INFO L226 Difference]: Without dead ends: 5091 [2018-09-26 08:10:25,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=246, Invalid=684, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:10:25,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5091 states. [2018-09-26 08:10:27,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5091 to 4401. [2018-09-26 08:10:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4401 states. [2018-09-26 08:10:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4401 states to 4401 states and 6510 transitions. [2018-09-26 08:10:27,997 INFO L78 Accepts]: Start accepts. Automaton has 4401 states and 6510 transitions. Word has length 29 [2018-09-26 08:10:27,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:27,997 INFO L480 AbstractCegarLoop]: Abstraction has 4401 states and 6510 transitions. [2018-09-26 08:10:27,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:10:27,997 INFO L276 IsEmpty]: Start isEmpty. Operand 4401 states and 6510 transitions. [2018-09-26 08:10:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:10:28,001 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:28,001 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:28,001 INFO L423 AbstractCegarLoop]: === Iteration 98 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:28,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:28,001 INFO L82 PathProgramCache]: Analyzing trace with hash -540945094, now seen corresponding path program 2 times [2018-09-26 08:10:28,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:28,022 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:28,022 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:10:28,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:10:28,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:10:28,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:10:28,023 INFO L87 Difference]: Start difference. First operand 4401 states and 6510 transitions. Second operand 10 states. [2018-09-26 08:10:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:31,259 INFO L93 Difference]: Finished difference Result 4721 states and 6944 transitions. [2018-09-26 08:10:31,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:10:31,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-09-26 08:10:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:31,265 INFO L225 Difference]: With dead ends: 4721 [2018-09-26 08:10:31,265 INFO L226 Difference]: Without dead ends: 4719 [2018-09-26 08:10:31,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:10:31,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4719 states. [2018-09-26 08:10:34,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4719 to 4507. [2018-09-26 08:10:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4507 states. [2018-09-26 08:10:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4507 states to 4507 states and 6661 transitions. [2018-09-26 08:10:34,256 INFO L78 Accepts]: Start accepts. Automaton has 4507 states and 6661 transitions. Word has length 29 [2018-09-26 08:10:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:34,256 INFO L480 AbstractCegarLoop]: Abstraction has 4507 states and 6661 transitions. [2018-09-26 08:10:34,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:10:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 4507 states and 6661 transitions. [2018-09-26 08:10:34,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:10:34,259 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:34,259 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:34,259 INFO L423 AbstractCegarLoop]: === Iteration 99 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:34,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:34,259 INFO L82 PathProgramCache]: Analyzing trace with hash 172278311, now seen corresponding path program 2 times [2018-09-26 08:10:34,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-26 08:10:34,274 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:34,274 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:10:34,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:10:34,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:10:34,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:10:34,275 INFO L87 Difference]: Start difference. First operand 4507 states and 6661 transitions. Second operand 9 states. [2018-09-26 08:10:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:37,383 INFO L93 Difference]: Finished difference Result 4725 states and 6951 transitions. [2018-09-26 08:10:37,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:10:37,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-09-26 08:10:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:37,389 INFO L225 Difference]: With dead ends: 4725 [2018-09-26 08:10:37,390 INFO L226 Difference]: Without dead ends: 4723 [2018-09-26 08:10:37,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:10:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4723 states. [2018-09-26 08:10:40,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4723 to 4504. [2018-09-26 08:10:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4504 states. [2018-09-26 08:10:40,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 6658 transitions. [2018-09-26 08:10:40,372 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 6658 transitions. Word has length 29 [2018-09-26 08:10:40,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:40,372 INFO L480 AbstractCegarLoop]: Abstraction has 4504 states and 6658 transitions. [2018-09-26 08:10:40,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:10:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 6658 transitions. [2018-09-26 08:10:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:10:40,375 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:40,375 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:40,375 INFO L423 AbstractCegarLoop]: === Iteration 100 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:40,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:40,376 INFO L82 PathProgramCache]: Analyzing trace with hash -182803664, now seen corresponding path program 1 times [2018-09-26 08:10:40,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:40,388 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:40,388 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:10:40,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:10:40,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:10:40,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:10:40,389 INFO L87 Difference]: Start difference. First operand 4504 states and 6658 transitions. Second operand 10 states. [2018-09-26 08:10:43,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:10:43,714 INFO L93 Difference]: Finished difference Result 4778 states and 7053 transitions. [2018-09-26 08:10:43,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:10:43,714 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-09-26 08:10:43,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:10:43,719 INFO L225 Difference]: With dead ends: 4778 [2018-09-26 08:10:43,719 INFO L226 Difference]: Without dead ends: 4776 [2018-09-26 08:10:43,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:10:43,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4776 states. [2018-09-26 08:10:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4776 to 4516. [2018-09-26 08:10:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4516 states. [2018-09-26 08:10:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4516 states to 4516 states and 6674 transitions. [2018-09-26 08:10:46,677 INFO L78 Accepts]: Start accepts. Automaton has 4516 states and 6674 transitions. Word has length 29 [2018-09-26 08:10:46,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:10:46,677 INFO L480 AbstractCegarLoop]: Abstraction has 4516 states and 6674 transitions. [2018-09-26 08:10:46,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:10:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 4516 states and 6674 transitions. [2018-09-26 08:10:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:10:46,680 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:10:46,680 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:10:46,680 INFO L423 AbstractCegarLoop]: === Iteration 101 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:10:46,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:10:46,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1089104597, now seen corresponding path program 3 times [2018-09-26 08:10:46,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:10:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:10:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:10:46,702 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:10:46,702 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:10:46,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:10:46,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:10:46,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:10:46,703 INFO L87 Difference]: Start difference. First operand 4516 states and 6674 transitions. Second operand 12 states. Received shutdown request... [2018-09-26 08:10:46,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:10:46,989 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:10:46,996 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:10:46,996 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:10:46 BoogieIcfgContainer [2018-09-26 08:10:46,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:10:46,997 INFO L168 Benchmark]: Toolchain (without parser) took 249216.60 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 3.4 GB in the end (delta: -1.9 GB). Peak memory consumption was 119.1 MB. Max. memory is 7.1 GB. [2018-09-26 08:10:47,000 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 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-09-26 08:10:47,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.61 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-09-26 08:10:47,000 INFO L168 Benchmark]: Boogie Preprocessor took 23.00 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-09-26 08:10:47,001 INFO L168 Benchmark]: RCFGBuilder took 276.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:10:47,001 INFO L168 Benchmark]: TraceAbstraction took 248866.31 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 3.4 GB in the end (delta: -1.9 GB). Peak memory consumption was 108.5 MB. Max. memory is 7.1 GB. [2018-09-26 08:10:47,004 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.17 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 41.61 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 23.00 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 276.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248866.31 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 3.4 GB in the end (delta: -1.9 GB). Peak memory consumption was 108.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 66). Cancelled while BasicCegarLoop was constructing difference of abstraction (4516states) and FLOYD_HOARE automaton (currently 14 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (71 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 99). Cancelled while BasicCegarLoop was constructing difference of abstraction (4516states) and FLOYD_HOARE automaton (currently 14 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (71 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 121). Cancelled while BasicCegarLoop was constructing difference of abstraction (4516states) and FLOYD_HOARE automaton (currently 14 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (71 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 112). Cancelled while BasicCegarLoop was constructing difference of abstraction (4516states) and FLOYD_HOARE automaton (currently 14 states, 12 states before enhancement), while ReachableStatesComputation was computing reachable states (71 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 48 locations, 4 error locations. TIMEOUT Result, 248.7s OverallTime, 101 OverallIterations, 3 TraceHistogramMax, 138.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6396 SDtfs, 12142 SDslu, 9501 SDs, 0 SdLazy, 41693 SolverSat, 11008 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2490 GetRequests, 537 SyntacticMatches, 0 SemanticMatches, 1953 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8588 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4516occurred in iteration=100, 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: 107.2s AutomataMinimizationTime, 100 MinimizatonAttempts, 23576 StatesRemovedByMinimization, 98 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2161 NumberOfCodeBlocks, 2161 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 2060 ConstructedInterpolants, 0 QuantifiedInterpolants, 202234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 101 InterpolantComputations, 5 PerfectInterpolantSequences, 72/792 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_product_WithProcedures.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-10-47-016.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithProcedures.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-10-47-016.csv Completed graceful shutdown