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/toy/tooDifficultLoopInvariant/Luxembourg-ArraysIntegefied.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:22:43,604 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:22:43,606 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:22:43,621 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:22:43,622 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:22:43,623 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:22:43,624 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:22:43,626 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:22:43,627 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:22:43,628 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:22:43,629 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:22:43,629 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:22:43,630 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:22:43,631 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:22:43,633 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:22:43,633 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:22:43,634 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:22:43,636 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:22:43,638 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:22:43,640 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:22:43,641 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:22:43,642 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:22:43,644 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:22:43,644 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:22:43,645 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:22:43,646 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:22:43,647 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:22:43,647 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:22:43,648 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:22:43,649 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:22:43,649 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:22:43,650 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:22:43,650 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:22:43,650 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:22:43,652 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:22:43,652 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:22:43,653 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:22:43,666 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:22:43,666 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:22:43,669 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:22:43,669 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:22:43,670 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:22:43,670 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:22:43,670 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:22:43,670 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:22:43,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:22:43,739 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:22:43,742 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:22:43,744 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:22:43,745 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:22:43,745 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-ArraysIntegefied.bpl [2018-09-26 08:22:43,746 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-ArraysIntegefied.bpl' [2018-09-26 08:22:43,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:22:43,795 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:22:43,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:22:43,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:22:43,796 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:22:43,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:22:43" (1/1) ... [2018-09-26 08:22:43,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:22:43" (1/1) ... [2018-09-26 08:22:43,835 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:22:43,836 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:22:43,836 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:22:43,838 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:22:43,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:22:43,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:22:43,840 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:22:43,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:22:43" (1/1) ... [2018-09-26 08:22:43,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:22:43" (1/1) ... [2018-09-26 08:22:43,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:22:43" (1/1) ... [2018-09-26 08:22:43,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:22:43" (1/1) ... [2018-09-26 08:22:43,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:22:43" (1/1) ... [2018-09-26 08:22:43,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:22:43" (1/1) ... [2018-09-26 08:22:43,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:22:43" (1/1) ... [2018-09-26 08:22:43,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:22:43,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:22:43,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:22:43,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:22:43,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:22:43" (1/1) ... [2018-09-26 08:22:43,951 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-26 08:22:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-26 08:22:43,952 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-26 08:22:44,212 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:22:44,213 INFO L202 PluginConnector]: Adding new model Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:22:44 BoogieIcfgContainer [2018-09-26 08:22:44,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:22:44,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:22:44,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:22:44,218 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:22:44,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:22:43" (1/2) ... [2018-09-26 08:22:44,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9bc7ff and model type Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:22:44, skipping insertion in model container [2018-09-26 08:22:44,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:22:44" (2/2) ... [2018-09-26 08:22:44,223 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-ArraysIntegefied.bpl [2018-09-26 08:22:44,234 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:22:44,243 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:22:44,292 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:22:44,292 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:22:44,292 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:22:44,293 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:22:44,293 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:22:44,293 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:22:44,293 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:22:44,294 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:22:44,294 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:22:44,306 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-26 08:22:44,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:22:44,313 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:44,314 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:22:44,316 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:44,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:44,322 INFO L82 PathProgramCache]: Analyzing trace with hash 75054, now seen corresponding path program 1 times [2018-09-26 08:22:44,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:44,405 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:22:44,406 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:22:44,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:22:44,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:22:44,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:22:44,428 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-09-26 08:22:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:44,454 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-09-26 08:22:44,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:22:44,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-26 08:22:44,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:44,468 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:22:44,468 INFO L226 Difference]: Without dead ends: 5 [2018-09-26 08:22:44,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:22:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-26 08:22:44,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-26 08:22:44,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-26 08:22:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-26 08:22:44,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-26 08:22:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:44,509 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-26 08:22:44,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:22:44,510 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-26 08:22:44,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:22:44,510 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:44,510 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:22:44,511 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:44,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2342053, now seen corresponding path program 1 times [2018-09-26 08:22:44,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:44,555 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:22:44,555 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:44,555 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:22:44,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:22:44,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:22:44,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:22:44,558 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-09-26 08:22:44,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:44,596 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-26 08:22:44,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:22:44,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-26 08:22:44,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:44,598 INFO L225 Difference]: With dead ends: 8 [2018-09-26 08:22:44,598 INFO L226 Difference]: Without dead ends: 6 [2018-09-26 08:22:44,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:22:44,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-26 08:22:44,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-26 08:22:44,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:22:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 08:22:44,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-26 08:22:44,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:44,603 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 08:22:44,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:22:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 08:22:44,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:22:44,604 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:44,604 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-26 08:22:44,604 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:44,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:44,605 INFO L82 PathProgramCache]: Analyzing trace with hash 72619022, now seen corresponding path program 2 times [2018-09-26 08:22:44,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:44,694 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:22:44,695 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:44,695 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:22:44,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:22:44,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:22:44,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:22:44,699 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-09-26 08:22:44,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:44,819 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:22:44,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:22:44,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 08:22:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:44,825 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:22:44,825 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:22:44,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:22:44,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:22:44,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:22:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:22:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:22:44,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-26 08:22:44,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:44,837 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:22:44,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:22:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:22:44,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:22:44,837 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:44,837 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-09-26 08:22:44,838 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:44,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:44,839 INFO L82 PathProgramCache]: Analyzing trace with hash -2043762235, now seen corresponding path program 3 times [2018-09-26 08:22:44,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:44,943 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:22:44,944 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:44,944 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:22:44,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:22:44,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:22:44,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:22:44,946 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-09-26 08:22:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:45,091 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-26 08:22:45,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:22:45,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:22:45,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:45,092 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:22:45,092 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:22:45,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:22:45,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:22:45,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:22:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:22:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:22:45,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-26 08:22:45,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:45,106 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:22:45,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:22:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:22:45,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:22:45,107 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:45,107 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-09-26 08:22:45,107 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:45,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:45,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1067895534, now seen corresponding path program 4 times [2018-09-26 08:22:45,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:45,170 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:45,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:22:45,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:22:45,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:22:45,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:22:45,172 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-09-26 08:22:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:45,276 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:22:45,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:22:45,277 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-09-26 08:22:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:45,278 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:22:45,278 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:22:45,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:22:45,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:22:45,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:22:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:22:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:22:45,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-26 08:22:45,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:45,285 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:22:45,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:22:45,285 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:22:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:22:45,285 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:45,286 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-09-26 08:22:45,286 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:45,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:45,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1254961435, now seen corresponding path program 5 times [2018-09-26 08:22:45,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:45,378 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:22:45,379 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:45,379 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:22:45,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:22:45,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:22:45,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:22:45,382 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-09-26 08:22:45,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:45,537 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:22:45,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:22:45,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:22:45,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:45,538 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:22:45,539 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:22:45,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:22:45,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:22:45,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:22:45,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:22:45,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 08:22:45,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-26 08:22:45,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:45,546 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 08:22:45,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:22:45,547 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 08:22:45,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:22:45,547 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:45,547 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-09-26 08:22:45,548 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:45,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:45,548 INFO L82 PathProgramCache]: Analyzing trace with hash -249083442, now seen corresponding path program 6 times [2018-09-26 08:22:45,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:45,618 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:45,618 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:22:45,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:22:45,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:22:45,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:22:45,620 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-09-26 08:22:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:45,736 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:22:45,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:22:45,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-26 08:22:45,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:45,738 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:22:45,738 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:22:45,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:22:45,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:22:45,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:22:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:22:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:22:45,745 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-26 08:22:45,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:45,745 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:22:45,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:22:45,746 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:22:45,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:22:45,746 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:45,747 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-09-26 08:22:45,747 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:45,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:45,748 INFO L82 PathProgramCache]: Analyzing trace with hash 868363269, now seen corresponding path program 7 times [2018-09-26 08:22:45,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:45,819 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:45,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:22:45,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:22:45,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:22:45,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:22:45,825 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-09-26 08:22:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:45,984 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:22:45,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:22:45,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-09-26 08:22:45,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:45,987 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:22:45,987 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:22:45,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:22:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:22:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:22:45,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:22:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 08:22:45,999 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-26 08:22:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:46,004 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 08:22:46,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:22:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 08:22:46,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:22:46,005 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:46,005 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-09-26 08:22:46,005 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:46,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:46,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1149472942, now seen corresponding path program 8 times [2018-09-26 08:22:46,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:46,110 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:46,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:22:46,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:22:46,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:22:46,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:22:46,114 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-09-26 08:22:46,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:46,344 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:22:46,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:22:46,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-09-26 08:22:46,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:46,346 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:22:46,346 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:22:46,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:22:46,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:22:46,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:22:46,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:22:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:22:46,356 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-26 08:22:46,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:46,361 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:22:46,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:22:46,362 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:22:46,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:22:46,363 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:46,363 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-09-26 08:22:46,363 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:46,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:46,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1273938213, now seen corresponding path program 9 times [2018-09-26 08:22:46,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:46,472 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:46,472 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:22:46,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:22:46,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:22:46,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:22:46,473 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-09-26 08:22:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:46,704 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 08:22:46,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:22:46,704 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-09-26 08:22:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:46,707 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:22:46,707 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:22:46,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:22:46,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:22:46,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:22:46,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:22:46,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:22:46,716 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-09-26 08:22:46,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:46,716 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:22:46,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:22:46,717 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:22:46,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:22:46,717 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:46,718 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-09-26 08:22:46,718 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:46,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:46,719 INFO L82 PathProgramCache]: Analyzing trace with hash 837394318, now seen corresponding path program 10 times [2018-09-26 08:22:46,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:46,831 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:46,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:22:46,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:22:46,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:22:46,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:22:46,833 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-09-26 08:22:47,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:47,154 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:22:47,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:22:47,155 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-09-26 08:22:47,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:47,156 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:22:47,156 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:22:47,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:22:47,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:22:47,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:22:47,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:22:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:22:47,172 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-09-26 08:22:47,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:47,172 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:22:47,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:22:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:22:47,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:22:47,176 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:47,176 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-09-26 08:22:47,176 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:47,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:47,177 INFO L82 PathProgramCache]: Analyzing trace with hash 189435461, now seen corresponding path program 11 times [2018-09-26 08:22:47,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:47,287 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:47,287 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:22:47,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:22:47,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:22:47,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:22:47,288 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-09-26 08:22:47,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:47,567 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:22:47,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:22:47,567 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-26 08:22:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:47,568 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:22:47,568 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:22:47,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:22:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:22:47,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:22:47,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:22:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 08:22:47,578 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-09-26 08:22:47,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:47,579 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 08:22:47,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:22:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 08:22:47,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:22:47,580 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:47,580 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-09-26 08:22:47,580 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:47,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:47,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1577547374, now seen corresponding path program 12 times [2018-09-26 08:22:47,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:47,698 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:47,698 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:22:47,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:22:47,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:22:47,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:22:47,700 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-09-26 08:22:48,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:48,030 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:22:48,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:22:48,031 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-26 08:22:48,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:48,031 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:22:48,032 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:22:48,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:22:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:22:48,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:22:48,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:22:48,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:22:48,043 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-09-26 08:22:48,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:48,043 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:22:48,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:22:48,044 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:22:48,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:22:48,044 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:48,045 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-09-26 08:22:48,045 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:48,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:48,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1659343717, now seen corresponding path program 13 times [2018-09-26 08:22:48,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:48,225 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:48,228 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:22:48,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:22:48,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:22:48,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:22:48,230 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-09-26 08:22:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:48,624 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:22:48,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:22:48,625 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-09-26 08:22:48,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:48,625 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:22:48,625 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:22:48,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=575, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:22:48,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:22:48,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-26 08:22:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:22:48,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-26 08:22:48,636 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-09-26 08:22:48,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:48,637 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-26 08:22:48,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:22:48,637 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-26 08:22:48,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:22:48,638 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:48,638 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-09-26 08:22:48,638 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:48,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:48,639 INFO L82 PathProgramCache]: Analyzing trace with hash -99936946, now seen corresponding path program 14 times [2018-09-26 08:22:48,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:48,781 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:48,782 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:48,782 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:22:48,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:22:48,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:22:48,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:22:48,783 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-09-26 08:22:49,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:49,140 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:22:49,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:22:49,140 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-09-26 08:22:49,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:49,141 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:22:49,141 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:22:49,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:22:49,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:22:49,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:22:49,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:22:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:22:49,158 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-09-26 08:22:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:49,158 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:22:49,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:22:49,160 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:22:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:22:49,161 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:49,161 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-09-26 08:22:49,161 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:49,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:49,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1196937349, now seen corresponding path program 15 times [2018-09-26 08:22:49,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:49,323 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:49,323 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:22:49,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:22:49,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:22:49,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:22:49,325 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-09-26 08:22:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:49,762 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-26 08:22:49,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:22:49,762 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-26 08:22:49,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:49,763 INFO L225 Difference]: With dead ends: 22 [2018-09-26 08:22:49,763 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:22:49,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=753, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:22:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:22:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 08:22:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:22:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-26 08:22:49,778 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-09-26 08:22:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:49,779 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-26 08:22:49,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:22:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-26 08:22:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:22:49,780 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:49,780 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-09-26 08:22:49,781 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:49,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:49,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1549632466, now seen corresponding path program 16 times [2018-09-26 08:22:49,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:49,935 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:49,935 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:22:49,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:22:49,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:22:49,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:22:49,936 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-09-26 08:22:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:50,411 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:22:50,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:22:50,411 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-09-26 08:22:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:50,412 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:22:50,412 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:22:50,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=339, Invalid=851, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:22:50,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:22:50,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:22:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:22:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:22:50,434 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-09-26 08:22:50,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:50,435 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:22:50,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:22:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:22:50,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:22:50,438 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:50,438 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-09-26 08:22:50,438 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:50,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:50,439 INFO L82 PathProgramCache]: Analyzing trace with hash -793950811, now seen corresponding path program 17 times [2018-09-26 08:22:50,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:50,617 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:50,617 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:22:50,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:22:50,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:22:50,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:22:50,618 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-09-26 08:22:51,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:51,190 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-26 08:22:51,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:22:51,190 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-09-26 08:22:51,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:51,196 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:22:51,196 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:22:51,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=377, Invalid=955, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:22:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:22:51,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 08:22:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:22:51,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-26 08:22:51,217 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-09-26 08:22:51,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:51,218 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-26 08:22:51,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:22:51,218 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-26 08:22:51,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:22:51,219 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:51,219 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-09-26 08:22:51,222 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:51,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:51,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1157344014, now seen corresponding path program 18 times [2018-09-26 08:22:51,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:51,418 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:51,419 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:22:51,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:22:51,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:22:51,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:22:51,421 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-09-26 08:22:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:52,013 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:22:52,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:22:52,014 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-09-26 08:22:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:52,014 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:22:52,015 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:22:52,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=417, Invalid=1065, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:22:52,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:22:52,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:22:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:22:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:22:52,036 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-09-26 08:22:52,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:52,037 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:22:52,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:22:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:22:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:22:52,039 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:52,039 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-09-26 08:22:52,039 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:52,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:52,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1517941445, now seen corresponding path program 19 times [2018-09-26 08:22:52,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:52,195 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:52,195 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:22:52,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:22:52,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:22:52,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:22:52,196 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-09-26 08:22:52,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:52,686 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 08:22:52,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:22:52,686 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-09-26 08:22:52,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:52,687 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:22:52,687 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:22:52,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=459, Invalid=1181, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:22:52,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:22:52,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-26 08:22:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 08:22:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-26 08:22:52,704 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-09-26 08:22:52,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:52,705 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-26 08:22:52,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:22:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-26 08:22:52,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:22:52,706 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:52,706 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-09-26 08:22:52,707 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:52,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:52,707 INFO L82 PathProgramCache]: Analyzing trace with hash -188440082, now seen corresponding path program 20 times [2018-09-26 08:22:52,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:52,890 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:52,890 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:22:52,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:22:52,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:22:52,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:22:52,893 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-09-26 08:22:53,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:53,452 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:22:53,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:22:53,452 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-09-26 08:22:53,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:53,453 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:22:53,453 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:22:53,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=503, Invalid=1303, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:22:53,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:22:53,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:22:53,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:22:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:22:53,477 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-09-26 08:22:53,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:53,480 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:22:53,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:22:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:22:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:22:53,481 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:53,481 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-09-26 08:22:53,482 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:53,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:53,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1546659867, now seen corresponding path program 21 times [2018-09-26 08:22:53,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:53,665 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:53,665 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:22:53,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:22:53,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:22:53,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:22:53,666 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-09-26 08:22:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:54,368 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-26 08:22:54,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:22:54,369 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-09-26 08:22:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:54,371 INFO L225 Difference]: With dead ends: 28 [2018-09-26 08:22:54,371 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:22:54,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=549, Invalid=1431, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:22:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:22:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-26 08:22:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:22:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 08:22:54,393 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-09-26 08:22:54,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:54,394 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 08:22:54,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:22:54,394 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 08:22:54,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:22:54,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:54,395 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-09-26 08:22:54,395 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:54,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:54,396 INFO L82 PathProgramCache]: Analyzing trace with hash -701800242, now seen corresponding path program 22 times [2018-09-26 08:22:54,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:54,622 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:54,622 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:54,623 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:22:54,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:22:54,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:22:54,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:22:54,624 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-09-26 08:22:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:55,278 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:22:55,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:22:55,279 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-09-26 08:22:55,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:55,279 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:22:55,279 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:22:55,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=597, Invalid=1565, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:22:55,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:22:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:22:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:22:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:22:55,300 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-09-26 08:22:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:55,300 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:22:55,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:22:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:22:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:22:55,301 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:55,301 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-09-26 08:22:55,302 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:55,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:55,302 INFO L82 PathProgramCache]: Analyzing trace with hash -280955643, now seen corresponding path program 23 times [2018-09-26 08:22:55,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:55,478 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:55,478 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:22:55,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:22:55,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:22:55,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:22:55,480 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-09-26 08:22:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:56,128 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 08:22:56,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:22:56,128 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-09-26 08:22:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:56,129 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:22:56,129 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:22:56,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=647, Invalid=1705, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:22:56,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:22:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-09-26 08:22:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:22:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-26 08:22:56,159 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-09-26 08:22:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:56,160 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-26 08:22:56,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:22:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-26 08:22:56,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:22:56,161 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:56,161 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-09-26 08:22:56,161 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:56,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:56,161 INFO L82 PathProgramCache]: Analyzing trace with hash -119674962, now seen corresponding path program 24 times [2018-09-26 08:22:56,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:56,361 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:56,361 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:22:56,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:22:56,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:22:56,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:22:56,362 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-09-26 08:22:57,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:57,120 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:22:57,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:22:57,121 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-09-26 08:22:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:57,121 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:22:57,121 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:22:57,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=699, Invalid=1851, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:22:57,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:22:57,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:22:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:22:57,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:22:57,144 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-09-26 08:22:57,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:57,144 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:22:57,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:22:57,144 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:22:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:22:57,145 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:57,145 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-09-26 08:22:57,145 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:57,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:57,146 INFO L82 PathProgramCache]: Analyzing trace with hash 585058853, now seen corresponding path program 25 times [2018-09-26 08:22:57,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:57,350 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:57,350 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:57,350 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:22:57,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:22:57,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:22:57,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:22:57,352 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-09-26 08:22:58,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:58,289 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-26 08:22:58,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:22:58,291 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-09-26 08:22:58,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:58,291 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:22:58,292 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:22:58,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=753, Invalid=2003, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:22:58,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:22:58,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-26 08:22:58,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:22:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-26 08:22:58,314 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-09-26 08:22:58,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:58,314 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-26 08:22:58,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:22:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-26 08:22:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:22:58,315 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:58,315 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-09-26 08:22:58,315 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:58,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:58,316 INFO L82 PathProgramCache]: Analyzing trace with hash 956970638, now seen corresponding path program 26 times [2018-09-26 08:22:58,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:58,498 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:58,498 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:22:58,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:22:58,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:22:58,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:22:58,500 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-09-26 08:22:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:59,243 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:22:59,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:22:59,243 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-09-26 08:22:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:59,244 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:22:59,244 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:22:59,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=809, Invalid=2161, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:22:59,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:22:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:22:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:22:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:22:59,265 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-09-26 08:22:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:59,266 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:22:59,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:22:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:22:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:22:59,266 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:59,267 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-09-26 08:22:59,267 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:59,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:59,267 INFO L82 PathProgramCache]: Analyzing trace with hash -398665915, now seen corresponding path program 27 times [2018-09-26 08:22:59,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:59,441 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:59,441 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:22:59,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:22:59,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:22:59,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:22:59,442 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-09-26 08:23:00,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:00,256 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-26 08:23:00,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:23:00,256 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-09-26 08:23:00,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:00,257 INFO L225 Difference]: With dead ends: 34 [2018-09-26 08:23:00,257 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:23:00,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=867, Invalid=2325, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:23:00,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:23:00,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-26 08:23:00,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:23:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-26 08:23:00,279 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-09-26 08:23:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:00,279 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-26 08:23:00,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:23:00,280 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-26 08:23:00,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:23:00,280 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:00,280 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-09-26 08:23:00,281 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:00,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:00,281 INFO L82 PathProgramCache]: Analyzing trace with hash 526273902, now seen corresponding path program 28 times [2018-09-26 08:23:00,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:00,464 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:00,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:23:00,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:23:00,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:23:00,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:23:00,466 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-09-26 08:23:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:01,308 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:23:01,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:23:01,308 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-09-26 08:23:01,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:01,309 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:23:01,309 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:23:01,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=927, Invalid=2495, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:23:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:23:01,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:23:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:23:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:23:01,333 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-09-26 08:23:01,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:01,333 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:23:01,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:23:01,334 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:23:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:23:01,334 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:01,334 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-09-26 08:23:01,335 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:01,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:01,335 INFO L82 PathProgramCache]: Analyzing trace with hash -865362843, now seen corresponding path program 29 times [2018-09-26 08:23:01,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:01,519 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:01,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:23:01,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:23:01,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:23:01,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:23:01,520 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-09-26 08:23:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:02,443 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 08:23:02,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:23:02,443 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-09-26 08:23:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:02,447 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:23:02,447 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:23:02,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=989, Invalid=2671, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:23:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:23:02,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 08:23:02,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:23:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-26 08:23:02,472 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-09-26 08:23:02,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:02,473 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-26 08:23:02,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:23:02,473 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-26 08:23:02,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:23:02,473 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:02,473 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-09-26 08:23:02,474 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:02,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:02,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1056428978, now seen corresponding path program 30 times [2018-09-26 08:23:02,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:02,682 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:02,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:23:02,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:23:02,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:23:02,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:23:02,683 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-09-26 08:23:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:03,885 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 08:23:03,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:23:03,885 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-09-26 08:23:03,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:03,886 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:23:03,886 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:23:03,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1053, Invalid=2853, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:23:03,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:23:03,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:23:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:23:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:23:03,912 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-09-26 08:23:03,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:03,912 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:23:03,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:23:03,912 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:23:03,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:23:03,913 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:03,913 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-09-26 08:23:03,913 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:03,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:03,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1610455429, now seen corresponding path program 31 times [2018-09-26 08:23:03,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:04,118 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:04,118 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:23:04,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:23:04,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:23:04,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:23:04,120 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-09-26 08:23:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:05,152 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-26 08:23:05,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:23:05,153 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-09-26 08:23:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:05,153 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:23:05,153 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:23:05,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1119, Invalid=3041, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:23:05,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:23:05,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-26 08:23:05,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:23:05,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-26 08:23:05,186 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-09-26 08:23:05,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:05,187 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-26 08:23:05,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:23:05,187 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-26 08:23:05,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:23:05,187 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:05,188 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-09-26 08:23:05,188 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:05,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:05,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1615473874, now seen corresponding path program 32 times [2018-09-26 08:23:05,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:05,384 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:05,385 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:23:05,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:23:05,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:23:05,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:23:05,386 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-09-26 08:23:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:06,388 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:23:06,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:23:06,388 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-09-26 08:23:06,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:06,389 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:23:06,389 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:23:06,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1187, Invalid=3235, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:23:06,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:23:06,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:23:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:23:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:23:06,412 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-09-26 08:23:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:06,412 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:23:06,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:23:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:23:06,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:23:06,413 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:06,413 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-09-26 08:23:06,413 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:06,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:06,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1459932837, now seen corresponding path program 33 times [2018-09-26 08:23:06,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:06,629 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:06,629 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:06,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:23:06,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:23:06,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:23:06,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:23:06,631 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-09-26 08:23:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:07,597 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 08:23:07,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:23:07,597 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-09-26 08:23:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:07,597 INFO L225 Difference]: With dead ends: 40 [2018-09-26 08:23:07,598 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:23:07,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1257, Invalid=3435, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:23:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:23:07,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-26 08:23:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:23:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-26 08:23:07,620 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-09-26 08:23:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:07,620 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-26 08:23:07,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:23:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-26 08:23:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:23:07,621 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:07,621 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-09-26 08:23:07,621 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:07,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:07,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1986706930, now seen corresponding path program 34 times [2018-09-26 08:23:07,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:07,839 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:07,839 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:23:07,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:23:07,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:23:07,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:23:07,840 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-09-26 08:23:08,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:08,967 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:23:08,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:23:08,967 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-09-26 08:23:08,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:08,968 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:23:08,968 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:23:08,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1329, Invalid=3641, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:23:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:23:08,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:23:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:23:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:23:08,994 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-09-26 08:23:08,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:08,994 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:23:08,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:23:08,994 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:23:08,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:23:08,994 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:08,995 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-09-26 08:23:08,995 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:08,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:08,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1458357307, now seen corresponding path program 35 times [2018-09-26 08:23:08,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:09,212 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:09,212 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:23:09,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:23:09,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:23:09,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:23:09,213 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-09-26 08:23:10,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:10,423 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-26 08:23:10,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:23:10,424 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-09-26 08:23:10,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:10,424 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:23:10,424 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:23:10,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1403, Invalid=3853, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:23:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:23:10,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 08:23:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:23:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-26 08:23:10,445 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-09-26 08:23:10,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:10,445 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-26 08:23:10,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:23:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-26 08:23:10,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:23:10,445 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:10,446 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-09-26 08:23:10,446 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:10,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:10,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2035579118, now seen corresponding path program 36 times [2018-09-26 08:23:10,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:10,633 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:10,633 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:23:10,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:23:10,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:23:10,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:23:10,634 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-09-26 08:23:11,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:11,643 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 08:23:11,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:23:11,643 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-09-26 08:23:11,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:11,643 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:23:11,643 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:23:11,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1479, Invalid=4071, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:23:11,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:23:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:23:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:23:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:23:11,665 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-09-26 08:23:11,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:11,665 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:23:11,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:23:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:23:11,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:23:11,666 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:11,666 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-09-26 08:23:11,666 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:11,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:11,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1321541403, now seen corresponding path program 37 times [2018-09-26 08:23:11,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:11,869 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:11,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:23:11,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:23:11,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:23:11,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:23:11,870 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-09-26 08:23:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:13,013 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-26 08:23:13,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:23:13,013 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-09-26 08:23:13,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:13,014 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:23:13,014 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 08:23:13,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1557, Invalid=4295, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:23:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 08:23:13,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-26 08:23:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 08:23:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-26 08:23:13,042 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-09-26 08:23:13,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:13,042 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-26 08:23:13,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:23:13,042 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-26 08:23:13,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:23:13,043 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:13,043 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-09-26 08:23:13,043 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:13,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:13,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1981904846, now seen corresponding path program 38 times [2018-09-26 08:23:13,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:13,253 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:13,253 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:23:13,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:23:13,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:23:13,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:23:13,254 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-09-26 08:23:14,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:14,368 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:23:14,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:23:14,368 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-09-26 08:23:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:14,369 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:23:14,369 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:23:14,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1637, Invalid=4525, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:23:14,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:23:14,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:23:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:23:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:23:14,395 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-09-26 08:23:14,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:14,396 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:23:14,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:23:14,396 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:23:14,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:23:14,396 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:14,396 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-09-26 08:23:14,396 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:14,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:14,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1309523461, now seen corresponding path program 39 times [2018-09-26 08:23:14,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:14,700 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:14,700 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:23:14,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:23:14,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:23:14,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:23:14,701 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-09-26 08:23:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:16,223 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-26 08:23:16,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:23:16,223 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-09-26 08:23:16,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:16,224 INFO L225 Difference]: With dead ends: 46 [2018-09-26 08:23:16,224 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:23:16,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1719, Invalid=4761, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:23:16,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:23:16,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-26 08:23:16,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 08:23:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-26 08:23:16,255 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-09-26 08:23:16,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:16,256 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-26 08:23:16,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:23:16,256 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-26 08:23:16,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 08:23:16,256 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:16,256 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-09-26 08:23:16,257 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:16,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:16,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1940537006, now seen corresponding path program 40 times [2018-09-26 08:23:16,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:16,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:16,514 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:23:16,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:23:16,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:23:16,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:23:16,514 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-09-26 08:23:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:17,887 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:23:17,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:23:17,887 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-09-26 08:23:17,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:17,887 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:23:17,887 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:23:17,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1803, Invalid=5003, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:23:17,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:23:17,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:23:17,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:23:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:23:17,920 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-09-26 08:23:17,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:17,920 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:23:17,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:23:17,920 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:23:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:23:17,921 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:17,921 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-09-26 08:23:17,921 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:17,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:17,921 INFO L82 PathProgramCache]: Analyzing trace with hash 27120421, now seen corresponding path program 41 times [2018-09-26 08:23:17,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:18,135 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:18,135 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:18,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:23:18,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:23:18,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:23:18,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:23:18,136 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-09-26 08:23:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:19,611 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-26 08:23:19,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:23:19,612 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-09-26 08:23:19,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:19,612 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:23:19,612 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:23:19,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1889, Invalid=5251, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:23:19,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:23:19,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-26 08:23:19,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:23:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-26 08:23:19,636 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-09-26 08:23:19,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:19,637 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-26 08:23:19,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:23:19,637 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-26 08:23:19,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:23:19,637 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:19,637 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-09-26 08:23:19,638 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:19,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:19,638 INFO L82 PathProgramCache]: Analyzing trace with hash 840748430, now seen corresponding path program 42 times [2018-09-26 08:23:19,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:19,951 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:19,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:23:19,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:23:19,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:23:19,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:23:19,953 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-09-26 08:23:21,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:21,442 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-26 08:23:21,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:23:21,442 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-09-26 08:23:21,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:21,443 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:23:21,443 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:23:21,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1977, Invalid=5505, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:23:21,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:23:21,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:23:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:23:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:23:21,469 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-09-26 08:23:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:21,470 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:23:21,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:23:21,470 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:23:21,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:23:21,470 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:21,470 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-09-26 08:23:21,471 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:21,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:21,471 INFO L82 PathProgramCache]: Analyzing trace with hash 293412933, now seen corresponding path program 43 times [2018-09-26 08:23:21,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:21,847 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:21,847 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:23:21,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:23:21,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:23:21,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:23:21,848 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-09-26 08:23:23,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:23,615 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 08:23:23,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:23:23,615 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-09-26 08:23:23,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:23,616 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:23:23,616 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 08:23:23,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2067, Invalid=5765, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:23:23,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 08:23:23,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-26 08:23:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 08:23:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-26 08:23:23,638 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-09-26 08:23:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:23,638 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-26 08:23:23,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:23:23,638 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-26 08:23:23,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 08:23:23,639 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:23,639 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-09-26 08:23:23,639 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:23,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:23,639 INFO L82 PathProgramCache]: Analyzing trace with hash 505881710, now seen corresponding path program 44 times [2018-09-26 08:23:23,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:23,956 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:23,956 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:23:23,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:23:23,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:23:23,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:23:23,957 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-09-26 08:23:25,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:25,738 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 08:23:25,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:23:25,738 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-09-26 08:23:25,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:25,739 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:23:25,739 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:23:25,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2159, Invalid=6031, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:23:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:23:25,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:23:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:23:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 08:23:25,768 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-09-26 08:23:25,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:25,769 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 08:23:25,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:23:25,769 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 08:23:25,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:23:25,769 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:25,769 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-09-26 08:23:25,769 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:25,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:25,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1497520795, now seen corresponding path program 45 times [2018-09-26 08:23:25,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:26,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:26,120 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:26,120 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:23:26,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:23:26,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:23:26,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:23:26,121 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-09-26 08:23:27,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:27,789 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-26 08:23:27,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:23:27,790 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-09-26 08:23:27,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:27,790 INFO L225 Difference]: With dead ends: 52 [2018-09-26 08:23:27,790 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 08:23:27,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2253, Invalid=6303, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:23:27,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 08:23:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-26 08:23:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 08:23:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-26 08:23:27,828 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-09-26 08:23:27,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:27,828 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-26 08:23:27,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:23:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-26 08:23:27,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 08:23:27,829 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:27,829 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-09-26 08:23:27,829 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:27,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:27,829 INFO L82 PathProgramCache]: Analyzing trace with hash 821510990, now seen corresponding path program 46 times [2018-09-26 08:23:27,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:28,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:28,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:23:28,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:23:28,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:23:28,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:23:28,150 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-09-26 08:23:30,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:30,330 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-26 08:23:30,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:23:30,331 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-09-26 08:23:30,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:30,331 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:23:30,331 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:23:30,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2349, Invalid=6581, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:23:30,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:23:30,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:23:30,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:23:30,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:23:30,356 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-09-26 08:23:30,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:30,357 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:23:30,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:23:30,357 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:23:30,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:23:30,357 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:30,357 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-09-26 08:23:30,357 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:30,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:30,357 INFO L82 PathProgramCache]: Analyzing trace with hash -302947707, now seen corresponding path program 47 times [2018-09-26 08:23:30,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:30,618 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:30,618 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:23:30,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:23:30,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:23:30,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:23:30,619 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-09-26 08:23:32,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:32,395 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-26 08:23:32,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:23:32,395 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-09-26 08:23:32,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:32,396 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:23:32,396 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:23:32,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2447, Invalid=6865, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:23:32,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:23:32,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-26 08:23:32,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 08:23:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-26 08:23:32,423 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-09-26 08:23:32,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:32,423 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-26 08:23:32,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:23:32,424 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-26 08:23:32,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 08:23:32,424 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:32,424 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-09-26 08:23:32,424 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:32,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:32,424 INFO L82 PathProgramCache]: Analyzing trace with hash -801428946, now seen corresponding path program 48 times [2018-09-26 08:23:32,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:32,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:32,723 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:32,723 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:23:32,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:23:32,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:23:32,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:23:32,724 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-09-26 08:23:34,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:34,796 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 08:23:34,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:23:34,796 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-09-26 08:23:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:34,797 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:23:34,797 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:23:34,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2547, Invalid=7155, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:23:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:23:34,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:23:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:23:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:23:34,823 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-09-26 08:23:34,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:34,823 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:23:34,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:23:34,823 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:23:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:23:34,823 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:34,823 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-09-26 08:23:34,824 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:34,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:34,824 INFO L82 PathProgramCache]: Analyzing trace with hash 925521829, now seen corresponding path program 49 times [2018-09-26 08:23:34,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:35,083 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:35,083 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:23:35,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:23:35,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:23:35,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:23:35,084 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-09-26 08:23:37,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:37,197 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-26 08:23:37,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:23:37,197 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-09-26 08:23:37,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:37,198 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:23:37,198 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:23:37,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2649, Invalid=7451, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:23:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:23:37,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-09-26 08:23:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 08:23:37,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-26 08:23:37,226 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-09-26 08:23:37,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:37,226 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-26 08:23:37,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:23:37,226 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-26 08:23:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 08:23:37,227 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:37,227 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-09-26 08:23:37,227 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:37,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:37,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1373578994, now seen corresponding path program 50 times [2018-09-26 08:23:37,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:37,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:37,652 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:37,652 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:23:37,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:23:37,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:23:37,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:23:37,653 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-09-26 08:23:37,874 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 23 [2018-09-26 08:23:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:39,885 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-26 08:23:39,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:23:39,886 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-09-26 08:23:39,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:39,886 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:23:39,886 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:23:39,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2753, Invalid=7753, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:23:39,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:23:39,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:23:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:23:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 08:23:39,917 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-09-26 08:23:39,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:39,917 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 08:23:39,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:23:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 08:23:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:23:39,918 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:39,918 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-09-26 08:23:39,918 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:39,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:39,919 INFO L82 PathProgramCache]: Analyzing trace with hash 368739525, now seen corresponding path program 51 times [2018-09-26 08:23:39,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:40,290 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:40,290 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:23:40,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:23:40,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:23:40,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:23:40,291 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-09-26 08:23:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:42,810 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-26 08:23:42,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:23:42,810 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-09-26 08:23:42,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:42,811 INFO L225 Difference]: With dead ends: 58 [2018-09-26 08:23:42,811 INFO L226 Difference]: Without dead ends: 56 [2018-09-26 08:23:42,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2859, Invalid=8061, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:23:42,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-26 08:23:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-09-26 08:23:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:23:42,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-26 08:23:42,844 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-09-26 08:23:42,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:42,844 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-26 08:23:42,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:23:42,844 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-26 08:23:42,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-26 08:23:42,845 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:42,845 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-09-26 08:23:42,845 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:42,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:42,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1453961234, now seen corresponding path program 52 times [2018-09-26 08:23:42,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:43,275 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:43,275 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:23:43,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:23:43,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:23:43,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:23:43,276 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-09-26 08:23:45,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:45,738 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 08:23:45,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:23:45,738 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-09-26 08:23:45,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:45,739 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:23:45,739 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:23:45,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2967, Invalid=8375, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:23:45,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:23:45,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:23:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:23:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 08:23:45,770 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-09-26 08:23:45,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:45,770 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 08:23:45,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:23:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 08:23:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:23:45,771 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:45,771 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-09-26 08:23:45,771 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:45,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:45,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2123109915, now seen corresponding path program 53 times [2018-09-26 08:23:45,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:46,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:46,137 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:46,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:23:46,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:23:46,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:23:46,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:23:46,138 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-09-26 08:23:48,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:48,585 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-26 08:23:48,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:23:48,585 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-09-26 08:23:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:48,586 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:23:48,586 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 08:23:48,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3077, Invalid=8695, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:23:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 08:23:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-09-26 08:23:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 08:23:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-09-26 08:23:48,623 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-09-26 08:23:48,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:48,623 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-09-26 08:23:48,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:23:48,623 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-09-26 08:23:48,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-26 08:23:48,624 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:48,624 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-09-26 08:23:48,624 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:48,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:48,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1391882546, now seen corresponding path program 54 times [2018-09-26 08:23:48,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:48,941 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:48,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:23:48,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:23:48,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:23:48,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:23:48,942 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-09-26 08:23:51,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:51,838 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-26 08:23:51,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:23:51,838 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-09-26 08:23:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:51,838 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:23:51,839 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:23:51,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3189, Invalid=9021, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:23:51,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:23:51,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:23:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:23:51,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:23:51,878 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-09-26 08:23:51,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:51,878 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:23:51,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:23:51,878 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:23:51,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:23:51,879 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:51,879 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-09-26 08:23:51,879 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:51,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:51,879 INFO L82 PathProgramCache]: Analyzing trace with hash -198670587, now seen corresponding path program 55 times [2018-09-26 08:23:51,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:52,196 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:52,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:23:52,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:23:52,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:23:52,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:23:52,197 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-09-26 08:23:55,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:55,013 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-26 08:23:55,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:23:55,013 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-09-26 08:23:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:55,014 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:23:55,014 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 08:23:55,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3303, Invalid=9353, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:23:55,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 08:23:55,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-09-26 08:23:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-26 08:23:55,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-26 08:23:55,047 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-09-26 08:23:55,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:55,047 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-26 08:23:55,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:23:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-26 08:23:55,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-26 08:23:55,048 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:55,048 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-09-26 08:23:55,048 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:55,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:55,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1863805522, now seen corresponding path program 56 times [2018-09-26 08:23:55,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:55,385 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:55,385 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:23:55,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:23:55,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:23:55,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:23:55,386 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-09-26 08:23:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:58,284 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 08:23:58,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:23:58,284 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-09-26 08:23:58,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:58,285 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:23:58,285 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:23:58,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3419, Invalid=9691, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:23:58,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:23:58,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:23:58,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:23:58,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:23:58,318 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-09-26 08:23:58,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:58,318 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:23:58,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:23:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:23:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:23:58,319 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:58,319 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-09-26 08:23:58,319 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:58,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:58,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1943380955, now seen corresponding path program 57 times [2018-09-26 08:23:58,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:58,723 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:58,723 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:23:58,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:23:58,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:23:58,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:23:58,723 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-09-26 08:24:01,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:01,830 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-26 08:24:01,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:24:01,831 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-09-26 08:24:01,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:01,831 INFO L225 Difference]: With dead ends: 64 [2018-09-26 08:24:01,832 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 08:24:01,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3537, Invalid=10035, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:24:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 08:24:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-09-26 08:24:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 08:24:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-26 08:24:01,880 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-09-26 08:24:01,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:01,880 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-26 08:24:01,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:24:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-26 08:24:01,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 08:24:01,881 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:01,881 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-09-26 08:24:01,881 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:01,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:01,881 INFO L82 PathProgramCache]: Analyzing trace with hash -115252082, now seen corresponding path program 58 times [2018-09-26 08:24:01,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:02,213 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:02,213 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:24:02,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:24:02,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:24:02,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:24:02,214 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-09-26 08:24:05,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:05,316 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 08:24:05,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:24:05,316 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-09-26 08:24:05,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:05,317 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:24:05,317 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:24:05,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3657, Invalid=10385, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:24:05,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:24:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:24:05,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:24:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-26 08:24:05,352 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-09-26 08:24:05,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:05,353 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-26 08:24:05,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:24:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-26 08:24:05,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:24:05,353 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:05,353 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-09-26 08:24:05,354 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:05,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:05,354 INFO L82 PathProgramCache]: Analyzing trace with hash 722168133, now seen corresponding path program 59 times [2018-09-26 08:24:05,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:05,994 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:05,994 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:24:05,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:24:05,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:24:05,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:24:05,995 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-09-26 08:24:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:09,443 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-26 08:24:09,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:24:09,443 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-09-26 08:24:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:09,444 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:24:09,444 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:24:09,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3779, Invalid=10741, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:24:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:24:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-26 08:24:09,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 08:24:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-26 08:24:09,486 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-09-26 08:24:09,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:09,486 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-26 08:24:09,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:24:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-26 08:24:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 08:24:09,487 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:09,487 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-09-26 08:24:09,488 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:09,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:09,488 INFO L82 PathProgramCache]: Analyzing trace with hash 912391022, now seen corresponding path program 60 times [2018-09-26 08:24:09,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:10,043 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:10,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:24:10,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:24:10,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:24:10,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:24:10,044 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-09-26 08:24:13,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:13,506 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-26 08:24:13,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:24:13,506 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-09-26 08:24:13,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:13,507 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:24:13,507 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:24:13,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3903, Invalid=11103, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:24:13,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:24:13,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:24:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:24:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:24:13,547 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-09-26 08:24:13,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:13,547 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:24:13,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:24:13,547 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:24:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:24:13,548 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:13,548 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-09-26 08:24:13,549 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:13,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:13,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1780634011, now seen corresponding path program 61 times [2018-09-26 08:24:13,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:13,988 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:13,989 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:24:13,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:24:13,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:24:13,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:24:13,990 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-09-26 08:24:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:17,575 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-26 08:24:17,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:24:17,575 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-09-26 08:24:17,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:17,576 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:24:17,576 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:24:17,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4029, Invalid=11471, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:24:17,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:24:17,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-09-26 08:24:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:24:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-26 08:24:17,615 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-09-26 08:24:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:17,615 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-26 08:24:17,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:24:17,615 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-26 08:24:17,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 08:24:17,616 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:17,616 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-09-26 08:24:17,616 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:17,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:17,617 INFO L82 PathProgramCache]: Analyzing trace with hash 634935886, now seen corresponding path program 62 times [2018-09-26 08:24:17,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:18,010 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:18,010 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:24:18,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:24:18,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:24:18,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:24:18,011 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-09-26 08:24:22,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:22,002 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-09-26 08:24:22,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:24:22,002 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-09-26 08:24:22,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:22,002 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:24:22,003 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:24:22,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4157, Invalid=11845, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:24:22,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:24:22,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:24:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:24:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 08:24:22,045 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-09-26 08:24:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:22,045 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 08:24:22,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:24:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 08:24:22,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:24:22,046 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:22,046 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-09-26 08:24:22,046 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:22,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:22,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1791808635, now seen corresponding path program 63 times [2018-09-26 08:24:22,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:22,454 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:22,454 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:24:22,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:24:22,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:24:22,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:24:22,455 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-09-26 08:24:26,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:26,360 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-26 08:24:26,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:24:26,360 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-09-26 08:24:26,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:26,361 INFO L225 Difference]: With dead ends: 70 [2018-09-26 08:24:26,361 INFO L226 Difference]: Without dead ends: 68 [2018-09-26 08:24:26,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4287, Invalid=12225, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:24:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-26 08:24:26,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-09-26 08:24:26,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-26 08:24:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-26 08:24:26,436 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-09-26 08:24:26,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:26,437 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-26 08:24:26,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:24:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-26 08:24:26,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-26 08:24:26,438 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:26,438 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-09-26 08:24:26,438 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:26,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:26,438 INFO L82 PathProgramCache]: Analyzing trace with hash 288522542, now seen corresponding path program 64 times [2018-09-26 08:24:26,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:26,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:26,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:24:26,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:24:26,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:24:26,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:24:26,965 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-09-26 08:24:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:30,962 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 08:24:30,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:24:30,962 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-09-26 08:24:30,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:30,963 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:24:30,963 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:24:30,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4419, Invalid=12611, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:24:30,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:24:31,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:24:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:24:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 08:24:31,006 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-09-26 08:24:31,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:31,006 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 08:24:31,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:24:31,007 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 08:24:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:24:31,007 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:31,007 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-09-26 08:24:31,008 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:31,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:31,008 INFO L82 PathProgramCache]: Analyzing trace with hash 354279589, now seen corresponding path program 65 times [2018-09-26 08:24:31,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:31,427 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:31,427 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:24:31,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:24:31,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:24:31,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:24:31,428 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-09-26 08:24:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:35,571 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-26 08:24:35,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:24:35,571 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-09-26 08:24:35,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:35,572 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:24:35,572 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:24:35,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4553, Invalid=13003, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:24:35,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:24:35,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-09-26 08:24:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:24:35,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-09-26 08:24:35,617 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-09-26 08:24:35,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:35,617 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-09-26 08:24:35,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:24:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-09-26 08:24:35,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-26 08:24:35,618 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:35,618 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-09-26 08:24:35,618 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:35,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:35,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1902219250, now seen corresponding path program 66 times [2018-09-26 08:24:35,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:36,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:36,075 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:36,076 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:24:36,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:24:36,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:24:36,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:24:36,077 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-09-26 08:24:40,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:40,671 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-09-26 08:24:40,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:24:40,672 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-09-26 08:24:40,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:40,672 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:24:40,672 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:24:40,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4689, Invalid=13401, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:24:40,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:24:40,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:24:40,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:24:40,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:24:40,743 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-09-26 08:24:40,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:40,743 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:24:40,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:24:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:24:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:24:40,744 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:40,744 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-09-26 08:24:40,744 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:40,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:40,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1160760773, now seen corresponding path program 67 times [2018-09-26 08:24:40,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:41,214 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:41,214 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:24:41,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:24:41,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:24:41,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:24:41,215 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-09-26 08:24:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:45,770 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-26 08:24:45,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:24:45,771 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-09-26 08:24:45,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:45,771 INFO L225 Difference]: With dead ends: 74 [2018-09-26 08:24:45,771 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:24:45,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4827, Invalid=13805, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:24:45,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:24:45,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-26 08:24:45,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:24:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-26 08:24:45,816 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-09-26 08:24:45,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:45,816 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-26 08:24:45,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:24:45,816 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-26 08:24:45,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-26 08:24:45,817 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:45,817 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-09-26 08:24:45,817 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:45,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:45,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1623860974, now seen corresponding path program 68 times [2018-09-26 08:24:45,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:46,267 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:46,268 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:24:46,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:24:46,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:24:46,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:24:46,269 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-09-26 08:24:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:51,194 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 08:24:51,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:24:51,194 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-09-26 08:24:51,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:51,195 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:24:51,195 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:24:51,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4967, Invalid=14215, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:24:51,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:24:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:24:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:24:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 08:24:51,281 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-09-26 08:24:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:51,282 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 08:24:51,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:24:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 08:24:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:24:51,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:51,283 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-09-26 08:24:51,283 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:51,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:51,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1199901979, now seen corresponding path program 69 times [2018-09-26 08:24:51,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:51,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:51,857 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:51,857 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:24:51,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:24:51,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:24:51,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:24:51,858 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-09-26 08:24:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:56,746 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-26 08:24:56,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:24:56,746 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-09-26 08:24:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:56,746 INFO L225 Difference]: With dead ends: 76 [2018-09-26 08:24:56,746 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:24:56,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5109, Invalid=14631, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:24:56,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:24:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-26 08:24:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:24:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-26 08:24:56,796 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-09-26 08:24:56,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:56,796 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-26 08:24:56,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:24:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-26 08:24:56,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:24:56,797 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:56,797 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-09-26 08:24:56,798 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:56,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:56,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1457759694, now seen corresponding path program 70 times [2018-09-26 08:24:56,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:57,303 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:57,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:24:57,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:24:57,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:24:57,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:24:57,305 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-09-26 08:25:02,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:02,260 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-09-26 08:25:02,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:25:02,260 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-09-26 08:25:02,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:02,261 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:25:02,261 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:25:02,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5253, Invalid=15053, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:25:02,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:25:02,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:25:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:25:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-26 08:25:02,310 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-09-26 08:25:02,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:02,310 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-26 08:25:02,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:25:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-26 08:25:02,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:25:02,311 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:02,311 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-09-26 08:25:02,311 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:02,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:02,311 INFO L82 PathProgramCache]: Analyzing trace with hash -2054074363, now seen corresponding path program 71 times [2018-09-26 08:25:02,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:03,013 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:03,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:25:03,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:25:03,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:25:03,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:25:03,015 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-09-26 08:25:08,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:08,179 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-26 08:25:08,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:25:08,179 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-09-26 08:25:08,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:08,179 INFO L225 Difference]: With dead ends: 78 [2018-09-26 08:25:08,179 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:25:08,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5399, Invalid=15481, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:25:08,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:25:08,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-26 08:25:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:25:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-26 08:25:08,233 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-09-26 08:25:08,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:08,233 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-26 08:25:08,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:25:08,234 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-26 08:25:08,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 08:25:08,234 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:08,234 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-09-26 08:25:08,234 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:08,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:08,235 INFO L82 PathProgramCache]: Analyzing trace with hash 748219566, now seen corresponding path program 72 times [2018-09-26 08:25:08,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:08,722 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:08,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:25:08,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:25:08,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:25:08,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:25:08,723 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-09-26 08:25:14,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:14,035 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-26 08:25:14,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:25:14,035 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-09-26 08:25:14,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:14,035 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:25:14,035 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:25:14,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5547, Invalid=15915, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:25:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:25:14,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:25:14,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:25:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:25:14,084 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-09-26 08:25:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:14,085 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:25:14,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:25:14,085 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:25:14,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:25:14,085 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:14,086 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-09-26 08:25:14,086 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:14,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:14,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1719985445, now seen corresponding path program 73 times [2018-09-26 08:25:14,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:14,616 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:14,616 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:25:14,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:25:14,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:25:14,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:25:14,617 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-09-26 08:25:20,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:20,138 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-26 08:25:20,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:25:20,138 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-09-26 08:25:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:20,139 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:25:20,139 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:25:20,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5697, Invalid=16355, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:25:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:25:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-09-26 08:25:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:25:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-09-26 08:25:20,189 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-09-26 08:25:20,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:20,189 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-09-26 08:25:20,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:25:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-09-26 08:25:20,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 08:25:20,190 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:20,190 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-09-26 08:25:20,190 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:20,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:20,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1779956622, now seen corresponding path program 74 times [2018-09-26 08:25:20,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:20,727 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:20,727 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:25:20,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:25:20,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:25:20,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:25:20,728 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-09-26 08:25:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:26,750 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-26 08:25:26,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:25:26,751 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-09-26 08:25:26,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:26,751 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:25:26,751 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:25:26,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5849, Invalid=16801, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:25:26,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:25:26,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:25:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:25:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-26 08:25:26,811 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-09-26 08:25:26,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:26,812 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-26 08:25:26,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:25:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-26 08:25:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:25:26,812 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:26,812 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-09-26 08:25:26,812 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:26,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:26,813 INFO L82 PathProgramCache]: Analyzing trace with hash -655904187, now seen corresponding path program 75 times [2018-09-26 08:25:26,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:27,442 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:27,442 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:25:27,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:25:27,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:25:27,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:25:27,443 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-09-26 08:25:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:33,390 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-26 08:25:33,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:25:33,391 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-09-26 08:25:33,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:33,391 INFO L225 Difference]: With dead ends: 82 [2018-09-26 08:25:33,391 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:25:33,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=6003, Invalid=17253, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:25:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:25:33,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-26 08:25:33,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 08:25:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-26 08:25:33,453 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-09-26 08:25:33,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:33,453 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-26 08:25:33,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:25:33,453 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-26 08:25:33,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-26 08:25:33,454 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:33,454 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-09-26 08:25:33,454 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:33,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:33,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1141822062, now seen corresponding path program 76 times [2018-09-26 08:25:33,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:34,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:34,075 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:34,075 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:25:34,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:25:34,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:25:34,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:25:34,076 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-09-26 08:25:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:40,549 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 08:25:40,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:25:40,549 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-09-26 08:25:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:40,550 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:25:40,550 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:25:40,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=6159, Invalid=17711, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:25:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:25:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:25:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:25:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:25:40,605 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-09-26 08:25:40,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:40,605 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:25:40,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:25:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:25:40,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:25:40,606 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:40,606 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-09-26 08:25:40,606 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:40,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:40,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1036760933, now seen corresponding path program 77 times [2018-09-26 08:25:40,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:41,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:41,200 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:41,200 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:25:41,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:25:41,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:25:41,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:25:41,201 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-09-26 08:25:47,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:47,539 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-26 08:25:47,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:25:47,539 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-09-26 08:25:47,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:47,539 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:25:47,539 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:25:47,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=6317, Invalid=18175, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:25:47,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:25:47,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-26 08:25:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 08:25:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-26 08:25:47,602 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-09-26 08:25:47,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:47,602 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-26 08:25:47,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:25:47,602 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-26 08:25:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-26 08:25:47,603 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:47,603 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-09-26 08:25:47,603 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:47,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:47,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2074833230, now seen corresponding path program 78 times [2018-09-26 08:25:47,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:48,212 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:48,212 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:25:48,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:25:48,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:25:48,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:25:48,213 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-09-26 08:25:54,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:54,803 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-26 08:25:54,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:25:54,803 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-09-26 08:25:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:54,804 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:25:54,804 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:25:54,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=6477, Invalid=18645, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:25:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:25:54,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:25:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:25:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:25:54,861 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-09-26 08:25:54,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:54,862 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:25:54,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:25:54,862 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:25:54,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:25:54,862 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:54,862 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-09-26 08:25:54,862 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:54,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:54,863 INFO L82 PathProgramCache]: Analyzing trace with hash -104663931, now seen corresponding path program 79 times [2018-09-26 08:25:54,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:55,457 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:55,457 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:25:55,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:25:55,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:25:55,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:25:55,458 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-09-26 08:26:02,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:02,259 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-26 08:26:02,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:26:02,260 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-09-26 08:26:02,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:02,260 INFO L225 Difference]: With dead ends: 86 [2018-09-26 08:26:02,260 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 08:26:02,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=6639, Invalid=19121, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:26:02,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 08:26:02,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-09-26 08:26:02,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-26 08:26:02,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-09-26 08:26:02,319 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-09-26 08:26:02,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:02,319 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-09-26 08:26:02,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:26:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-09-26 08:26:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-26 08:26:02,320 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:02,320 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-09-26 08:26:02,320 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:02,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:02,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1050400814, now seen corresponding path program 80 times [2018-09-26 08:26:02,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:02,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:02,973 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:02,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:26:02,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:26:02,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:26:02,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:26:02,974 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-09-26 08:26:05,731 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 375 DAG size of output: 23 [2018-09-26 08:26:10,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:10,192 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 08:26:10,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:26:10,192 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-09-26 08:26:10,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:10,193 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:26:10,193 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:26:10,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=6803, Invalid=19603, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:26:10,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:26:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:26:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:26:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 08:26:10,278 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-09-26 08:26:10,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:10,279 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 08:26:10,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:26:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 08:26:10,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:26:10,279 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:10,279 INFO L375 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-09-26 08:26:10,279 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:10,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:10,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1797297755, now seen corresponding path program 81 times [2018-09-26 08:26:10,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:10,995 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:10,995 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:26:10,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:26:10,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:26:10,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:26:10,996 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-09-26 08:26:19,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:19,276 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-26 08:26:19,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:26:19,277 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-09-26 08:26:19,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:19,277 INFO L225 Difference]: With dead ends: 88 [2018-09-26 08:26:19,277 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:26:19,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=6969, Invalid=20091, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:26:19,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:26:19,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-09-26 08:26:19,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:26:19,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-26 08:26:19,353 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-09-26 08:26:19,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:19,353 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-26 08:26:19,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:26:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-26 08:26:19,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 08:26:19,354 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:19,354 INFO L375 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-09-26 08:26:19,354 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:19,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:19,354 INFO L82 PathProgramCache]: Analyzing trace with hash 118359822, now seen corresponding path program 82 times [2018-09-26 08:26:19,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:20,113 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:20,113 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:26:20,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:26:20,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:26:20,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:26:20,114 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-09-26 08:26:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:28,283 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-09-26 08:26:28,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:26:28,283 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-09-26 08:26:28,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:28,283 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:26:28,284 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:26:28,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=7137, Invalid=20585, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:26:28,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:26:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:26:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:26:28,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 08:26:28,357 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-09-26 08:26:28,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:28,358 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 08:26:28,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:26:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 08:26:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:26:28,358 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:28,358 INFO L375 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-09-26 08:26:28,359 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:28,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:28,359 INFO L82 PathProgramCache]: Analyzing trace with hash -625797435, now seen corresponding path program 83 times [2018-09-26 08:26:28,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:29,231 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:29,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:26:29,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:26:29,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:26:29,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:26:29,232 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-09-26 08:26:37,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:37,269 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-26 08:26:37,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:26:37,270 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-09-26 08:26:37,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:37,270 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:26:37,270 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:26:37,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=7307, Invalid=21085, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:26:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:26:37,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-09-26 08:26:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 08:26:37,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-09-26 08:26:37,334 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-09-26 08:26:37,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:37,334 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-09-26 08:26:37,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:26:37,335 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-09-26 08:26:37,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 08:26:37,335 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:37,335 INFO L375 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-09-26 08:26:37,335 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:37,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:37,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2075131374, now seen corresponding path program 84 times [2018-09-26 08:26:37,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:38,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:38,069 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:38,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:26:38,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:26:38,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:26:38,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:26:38,070 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-09-26 08:26:46,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:46,112 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 08:26:46,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:26:46,112 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-09-26 08:26:46,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:46,112 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:26:46,113 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:26:46,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=7479, Invalid=21591, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:26:46,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:26:46,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:26:46,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:26:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:26:46,180 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-09-26 08:26:46,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:46,180 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:26:46,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:26:46,180 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:26:46,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:26:46,181 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:46,181 INFO L375 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-09-26 08:26:46,181 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:46,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:46,182 INFO L82 PathProgramCache]: Analyzing trace with hash -95421467, now seen corresponding path program 85 times [2018-09-26 08:26:46,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:46,909 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:46,909 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:26:46,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:26:46,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:26:46,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:26:46,911 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-09-26 08:26:55,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:55,263 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-26 08:26:55,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:26:55,264 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-09-26 08:26:55,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:55,264 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:26:55,264 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:26:55,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=7653, Invalid=22103, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:26:55,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:26:55,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-09-26 08:26:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-26 08:26:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-09-26 08:26:55,332 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-09-26 08:26:55,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:55,332 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-09-26 08:26:55,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:26:55,333 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-09-26 08:26:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-26 08:26:55,333 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:55,333 INFO L375 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-09-26 08:26:55,334 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:55,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:55,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1336917198, now seen corresponding path program 86 times [2018-09-26 08:26:55,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:56,037 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:56,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:26:56,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:26:56,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:26:56,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:26:56,039 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. Received shutdown request... [2018-09-26 08:27:00,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:27:00,868 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:27:00,872 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:27:00,873 INFO L202 PluginConnector]: Adding new model Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:27:00 BoogieIcfgContainer [2018-09-26 08:27:00,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:27:00,874 INFO L168 Benchmark]: Toolchain (without parser) took 257081.37 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -52.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-09-26 08:27:00,875 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:27:00,875 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.33 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:27:00,876 INFO L168 Benchmark]: Boogie Preprocessor took 24.30 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:27:00,876 INFO L168 Benchmark]: RCFGBuilder took 349.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:27:00,877 INFO L168 Benchmark]: TraceAbstraction took 256658.33 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -62.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-09-26 08:27:00,880 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.33 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 24.30 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 349.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 256658.33 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -62.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 41). Cancelled while BasicCegarLoop was constructing difference of abstraction (90states) and FLOYD_HOARE automaton (currently 45 states, 89 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 132 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. TIMEOUT Result, 256.5s OverallTime, 87 OverallIterations, 86 TraceHistogramMax, 224.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 261 SDtfs, 2 SDslu, 3743 SDs, 0 SdLazy, 7613 SolverSat, 3742 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7614 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7526 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103267 ImplicationChecksByTransitivity, 237.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=86, 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: 2.7s AutomataMinimizationTime, 86 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 25.7s InterpolantComputationTime, 4002 NumberOfCodeBlocks, 4002 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 3915 ConstructedInterpolants, 0 QuantifiedInterpolants, 3602722 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 87 InterpolantComputations, 1 PerfectInterpolantSequences, 0/109736 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/Luxembourg-ArraysIntegefied.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-27-00-897.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-ArraysIntegefied.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-27-00-897.csv Completed graceful shutdown