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/LuxembourgOctopus.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:24:07,758 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:24:07,760 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:24:07,774 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:24:07,774 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:24:07,775 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:24:07,777 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:24:07,779 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:24:07,781 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:24:07,782 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:24:07,783 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:24:07,783 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:24:07,784 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:24:07,785 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:24:07,787 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:24:07,788 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:24:07,789 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:24:07,791 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:24:07,793 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:24:07,795 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:24:07,796 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:24:07,798 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:24:07,801 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:24:07,801 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:24:07,801 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:24:07,802 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:24:07,803 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:24:07,804 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:24:07,805 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:24:07,807 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:24:07,807 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:24:07,808 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:24:07,808 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:24:07,808 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:24:07,809 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:24:07,810 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:24:07,811 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:24:07,820 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:24:07,820 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:24:07,822 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:24:07,822 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:24:07,822 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:24:07,823 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:24:07,823 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:24:07,823 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:24:07,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:24:07,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:24:07,912 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:24:07,914 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:24:07,915 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:24:07,916 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LuxembourgOctopus.bpl [2018-09-26 08:24:07,916 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LuxembourgOctopus.bpl' [2018-09-26 08:24:07,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:24:07,970 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:24:07,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:24:07,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:24:07,971 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:24:07,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:07" (1/1) ... [2018-09-26 08:24:08,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:07" (1/1) ... [2018-09-26 08:24:08,012 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:24:08,012 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:24:08,012 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:24:08,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:24:08,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:24:08,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:24:08,015 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:24:08,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:07" (1/1) ... [2018-09-26 08:24:08,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:07" (1/1) ... [2018-09-26 08:24:08,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:07" (1/1) ... [2018-09-26 08:24:08,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:07" (1/1) ... [2018-09-26 08:24:08,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:07" (1/1) ... [2018-09-26 08:24:08,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:07" (1/1) ... [2018-09-26 08:24:08,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:07" (1/1) ... [2018-09-26 08:24:08,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:24:08,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:24:08,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:24:08,039 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:24:08,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:07" (1/1) ... [2018-09-26 08:24:08,136 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-26 08:24:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-26 08:24:08,136 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-26 08:24:08,287 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:24:08,287 INFO L202 PluginConnector]: Adding new model LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:24:08 BoogieIcfgContainer [2018-09-26 08:24:08,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:24:08,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:24:08,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:24:08,293 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:24:08,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:07" (1/2) ... [2018-09-26 08:24:08,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c6bfa3 and model type LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:24:08, skipping insertion in model container [2018-09-26 08:24:08,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:24:08" (2/2) ... [2018-09-26 08:24:08,297 INFO L112 eAbstractionObserver]: Analyzing ICFG LuxembourgOctopus.bpl [2018-09-26 08:24:08,309 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:24:08,319 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:24:08,374 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:24:08,375 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:24:08,375 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:24:08,375 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:24:08,376 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:24:08,376 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:24:08,376 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:24:08,376 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:24:08,377 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:24:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-26 08:24:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:24:08,409 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:08,410 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:24:08,411 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:08,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:08,420 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-09-26 08:24:08,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:08,491 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:24:08,493 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:24:08,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:24:08,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:24:08,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:24:08,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:24:08,514 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-09-26 08:24:08,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:08,544 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-09-26 08:24:08,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:24:08,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-26 08:24:08,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:08,558 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:24:08,558 INFO L226 Difference]: Without dead ends: 5 [2018-09-26 08:24:08,562 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:24:08,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-26 08:24:08,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-26 08:24:08,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-26 08:24:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-26 08:24:08,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-26 08:24:08,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:08,621 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-26 08:24:08,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:24:08,621 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-26 08:24:08,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:24:08,621 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:08,622 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:24:08,622 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:08,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:08,623 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-09-26 08:24:08,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:08,652 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:24:08,652 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:08,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:24:08,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:24:08,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:24:08,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:24:08,656 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-09-26 08:24:08,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:08,673 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-26 08:24:08,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:24:08,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-26 08:24:08,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:08,674 INFO L225 Difference]: With dead ends: 8 [2018-09-26 08:24:08,674 INFO L226 Difference]: Without dead ends: 6 [2018-09-26 08:24:08,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:24:08,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-26 08:24:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-26 08:24:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:24:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 08:24:08,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-26 08:24:08,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:08,679 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 08:24:08,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:24:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 08:24:08,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:24:08,680 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:08,680 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-26 08:24:08,681 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:08,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:08,681 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-09-26 08:24:08,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:08,726 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:24:08,726 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:08,727 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:24:08,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:24:08,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:24:08,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:24:08,728 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-09-26 08:24:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:08,743 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:24:08,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:24:08,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 08:24:08,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:08,745 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:24:08,745 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:24:08,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:24:08,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:24:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:24:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:24:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:24:08,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-26 08:24:08,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:08,749 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:24:08,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:24:08,750 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:24:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:24:08,750 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:08,750 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-09-26 08:24:08,751 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:08,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:08,751 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-09-26 08:24:08,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:08,804 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:24:08,804 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:08,804 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:24:08,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:24:08,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:24:08,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:24:08,806 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-09-26 08:24:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:08,824 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-26 08:24:08,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:24:08,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:24:08,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:08,826 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:24:08,826 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:24:08,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:24:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:24:08,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:24:08,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:24:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:24:08,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-26 08:24:08,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:08,831 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:24:08,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:24:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:24:08,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:24:08,832 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:08,832 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-09-26 08:24:08,833 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:08,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:08,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-09-26 08:24:08,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:08,884 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:24:08,884 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:08,884 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:24:08,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:24:08,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:24:08,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:24:08,888 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-09-26 08:24:08,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:08,921 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:24:08,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:24:08,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-09-26 08:24:08,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:08,923 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:24:08,923 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:24:08,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:24:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:24:08,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:24:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:24:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:24:08,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-26 08:24:08,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:08,928 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:24:08,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:24:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:24:08,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:24:08,928 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:08,929 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-09-26 08:24:08,929 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:08,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:08,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-09-26 08:24:08,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:09,024 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:24:09,024 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:09,024 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:24:09,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:24:09,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:24:09,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:24:09,026 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-09-26 08:24:09,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:09,062 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:24:09,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:24:09,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:24:09,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:09,063 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:24:09,063 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:24:09,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:24:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:24:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:24:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:24:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 08:24:09,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-26 08:24:09,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:09,072 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 08:24:09,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:24:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 08:24:09,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:24:09,073 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:09,073 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-09-26 08:24:09,073 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:09,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:09,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-09-26 08:24:09,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:09,162 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:24:09,163 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:09,163 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:24:09,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:24:09,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:24:09,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:24:09,164 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-09-26 08:24:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:09,183 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:24:09,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:24:09,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-26 08:24:09,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:09,185 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:24:09,185 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:24:09,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:24:09,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:24:09,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:24:09,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:24:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:24:09,190 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-26 08:24:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:09,190 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:24:09,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:24:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:24:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:24:09,191 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:09,191 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-09-26 08:24:09,192 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:09,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:09,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-09-26 08:24:09,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:09,271 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:24:09,271 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:09,272 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:24:09,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:24:09,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:24:09,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:24:09,276 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-09-26 08:24:09,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:09,302 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:24:09,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:24:09,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-09-26 08:24:09,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:09,303 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:24:09,304 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:24:09,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:24:09,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:24:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:24:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:24:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 08:24:09,311 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-26 08:24:09,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:09,312 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 08:24:09,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:24:09,312 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 08:24:09,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:24:09,312 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:09,313 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-09-26 08:24:09,313 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:09,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:09,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-09-26 08:24:09,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:09,395 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:24:09,395 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:09,400 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:24:09,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:24:09,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:24:09,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:24:09,401 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-09-26 08:24:09,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:09,427 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:24:09,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:24:09,427 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-09-26 08:24:09,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:09,428 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:24:09,428 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:24:09,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:24:09,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:24:09,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:24:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:24:09,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:24:09,433 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-26 08:24:09,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:09,434 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:24:09,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:24:09,434 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:24:09,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:24:09,435 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:09,435 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-09-26 08:24:09,435 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:09,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:09,436 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-09-26 08:24:09,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:09,545 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:24:09,545 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:09,546 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:24:09,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:24:09,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:24:09,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:24:09,549 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-09-26 08:24:09,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:09,587 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 08:24:09,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:24:09,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-09-26 08:24:09,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:09,588 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:24:09,588 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:24:09,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:24:09,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:24:09,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:24:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:24:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:24:09,597 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-09-26 08:24:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:09,598 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:24:09,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:24:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:24:09,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:24:09,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:09,601 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-09-26 08:24:09,601 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:09,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:09,602 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-09-26 08:24:09,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:09,703 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:24:09,703 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:09,703 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:24:09,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:24:09,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:24:09,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:24:09,705 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-09-26 08:24:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:09,729 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:24:09,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:24:09,730 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-09-26 08:24:09,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:09,731 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:24:09,731 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:24:09,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:24:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:24:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:24:09,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:24:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:24:09,739 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-09-26 08:24:09,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:09,740 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:24:09,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:24:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:24:09,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:24:09,741 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:09,741 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-09-26 08:24:09,742 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:09,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:09,742 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-09-26 08:24:09,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:09,803 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:24:09,803 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:09,804 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:24:09,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:24:09,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:24:09,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:24:09,805 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-09-26 08:24:09,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:09,823 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:24:09,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:24:09,823 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-26 08:24:09,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:09,824 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:24:09,825 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:24:09,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:24:09,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:24:09,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:24:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:24:09,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 08:24:09,830 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-09-26 08:24:09,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:09,831 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 08:24:09,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:24:09,837 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 08:24:09,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:24:09,837 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:09,838 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-09-26 08:24:09,838 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:09,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:09,839 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-09-26 08:24:09,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:09,932 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:24:09,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:09,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:24:09,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:24:09,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:24:09,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:24:09,935 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-09-26 08:24:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:09,952 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:24:09,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:24:09,953 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-26 08:24:09,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:09,953 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:24:09,954 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:24:09,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:24:09,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:24:09,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:24:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:24:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:24:09,961 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-09-26 08:24:09,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:09,961 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:24:09,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:24:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:24:09,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:24:09,965 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:09,965 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-09-26 08:24:09,965 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:09,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:09,966 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-09-26 08:24:09,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:10,061 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:24:10,064 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:10,064 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:24:10,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:24:10,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:24:10,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:24:10,066 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-09-26 08:24:10,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:10,094 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:24:10,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:24:10,094 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-09-26 08:24:10,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:10,095 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:24:10,095 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:24:10,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:24:10,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:24:10,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-26 08:24:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:24:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-26 08:24:10,101 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-09-26 08:24:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:10,101 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-26 08:24:10,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:24:10,103 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-26 08:24:10,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:24:10,103 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:10,103 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-09-26 08:24:10,104 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:10,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:10,104 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-09-26 08:24:10,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:10,202 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:24:10,203 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:10,203 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:24:10,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:24:10,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:24:10,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:24:10,205 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-09-26 08:24:10,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:10,224 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:24:10,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:24:10,224 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-09-26 08:24:10,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:10,225 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:24:10,225 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:24:10,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:24:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:24:10,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:24:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:24:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:24:10,236 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-09-26 08:24:10,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:10,237 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:24:10,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:24:10,237 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:24:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:24:10,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:10,240 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-09-26 08:24:10,240 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:10,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:10,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-09-26 08:24:10,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:10,337 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:24:10,337 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:10,337 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:24:10,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:24:10,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:24:10,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:24:10,339 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-09-26 08:24:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:10,360 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-26 08:24:10,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:24:10,361 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-26 08:24:10,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:10,362 INFO L225 Difference]: With dead ends: 22 [2018-09-26 08:24:10,362 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:24:10,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:24:10,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:24:10,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 08:24:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:24:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-26 08:24:10,372 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-09-26 08:24:10,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:10,373 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-26 08:24:10,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:24:10,373 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-26 08:24:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:24:10,374 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:10,374 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-09-26 08:24:10,375 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:10,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:10,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2018-09-26 08:24:10,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:10,473 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:24:10,474 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:10,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:24:10,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:24:10,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:24:10,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:24:10,476 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-09-26 08:24:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:10,500 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:24:10,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:24:10,500 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-09-26 08:24:10,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:10,501 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:24:10,501 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:24:10,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:24:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:24:10,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:24:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:24:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:24:10,509 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-09-26 08:24:10,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:10,509 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:24:10,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:24:10,510 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:24:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:24:10,518 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:10,518 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-09-26 08:24:10,518 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:10,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:10,519 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2018-09-26 08:24:10,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:10,624 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:24:10,624 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:10,624 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:24:10,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:24:10,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:24:10,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:24:10,628 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-09-26 08:24:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:10,651 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-26 08:24:10,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:24:10,651 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-09-26 08:24:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:10,652 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:24:10,654 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:24:10,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:24:10,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:24:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 08:24:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:24:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-26 08:24:10,662 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-09-26 08:24:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:10,666 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-26 08:24:10,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:24:10,666 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-26 08:24:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:24:10,667 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:10,667 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-09-26 08:24:10,667 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:10,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:10,670 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2018-09-26 08:24:10,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:10,790 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:24:10,790 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:10,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:24:10,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:24:10,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:24:10,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:24:10,793 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-09-26 08:24:10,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:10,815 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:24:10,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:24:10,816 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-09-26 08:24:10,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:10,817 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:24:10,817 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:24:10,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:24:10,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:24:10,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:24:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:24:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:24:10,835 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-09-26 08:24:10,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:10,835 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:24:10,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:24:10,835 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:24:10,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:24:10,836 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:10,836 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-09-26 08:24:10,838 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:10,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:10,839 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2018-09-26 08:24:10,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:10,942 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:24:10,942 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:10,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:24:10,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:24:10,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:24:10,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:24:10,944 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-09-26 08:24:10,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:10,960 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 08:24:10,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:24:10,960 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-09-26 08:24:10,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:10,961 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:24:10,961 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:24:10,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:24:10,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:24:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-26 08:24:10,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 08:24:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-26 08:24:10,966 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-09-26 08:24:10,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:10,966 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-26 08:24:10,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:24:10,967 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-26 08:24:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:24:10,968 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:10,968 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-09-26 08:24:10,968 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:10,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:10,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2018-09-26 08:24:10,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:11,082 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:24:11,083 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:11,083 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:24:11,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:24:11,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:24:11,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:24:11,085 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-09-26 08:24:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:11,105 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:24:11,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:24:11,105 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-09-26 08:24:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:11,106 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:24:11,106 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:24:11,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:24:11,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:24:11,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:24:11,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:24:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:24:11,111 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-09-26 08:24:11,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:11,112 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:24:11,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:24:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:24:11,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:24:11,113 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:11,113 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-09-26 08:24:11,113 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:11,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:11,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2018-09-26 08:24:11,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:11,237 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:24:11,237 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:11,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:24:11,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:24:11,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:24:11,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:24:11,239 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-09-26 08:24:11,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:11,263 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-26 08:24:11,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:24:11,263 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-09-26 08:24:11,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:11,264 INFO L225 Difference]: With dead ends: 28 [2018-09-26 08:24:11,264 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:24:11,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:24:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:24:11,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-26 08:24:11,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:24:11,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 08:24:11,269 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-09-26 08:24:11,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:11,270 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 08:24:11,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:24:11,270 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 08:24:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:24:11,271 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:11,271 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-09-26 08:24:11,271 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:11,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:11,272 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2018-09-26 08:24:11,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:11,399 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:24:11,399 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:11,399 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:24:11,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:24:11,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:24:11,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:24:11,401 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-09-26 08:24:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:11,428 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:24:11,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:24:11,429 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-09-26 08:24:11,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:11,430 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:24:11,430 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:24:11,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:24:11,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:24:11,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:24:11,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:24:11,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:24:11,437 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-09-26 08:24:11,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:11,437 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:24:11,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:24:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:24:11,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:24:11,441 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:11,441 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-09-26 08:24:11,442 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:11,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:11,442 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2018-09-26 08:24:11,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:11,581 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:24:11,582 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:11,582 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:24:11,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:24:11,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:24:11,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:24:11,584 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-09-26 08:24:11,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:11,603 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 08:24:11,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:24:11,603 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-09-26 08:24:11,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:11,604 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:24:11,604 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:24:11,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:24:11,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:24:11,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-09-26 08:24:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:24:11,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-26 08:24:11,609 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-09-26 08:24:11,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:11,610 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-26 08:24:11,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:24:11,610 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-26 08:24:11,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:24:11,611 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:11,611 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-09-26 08:24:11,611 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:11,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:11,612 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2018-09-26 08:24:11,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:11,746 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:24:11,746 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:11,747 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:24:11,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:24:11,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:24:11,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:24:11,748 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-09-26 08:24:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:11,771 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:24:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:24:11,772 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-09-26 08:24:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:11,773 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:24:11,773 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:24:11,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:24:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:24:11,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:24:11,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:24:11,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:24:11,778 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-09-26 08:24:11,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:11,778 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:24:11,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:24:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:24:11,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:24:11,779 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:11,779 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-09-26 08:24:11,780 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:11,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:11,780 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2018-09-26 08:24:11,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:11,933 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:24:11,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:11,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:24:11,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:24:11,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:24:11,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:24:11,935 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-09-26 08:24:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:11,957 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-26 08:24:11,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:24:11,957 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-09-26 08:24:11,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:11,958 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:24:11,958 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:24:11,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:24:11,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:24:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-26 08:24:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:24:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-26 08:24:11,963 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-09-26 08:24:11,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:11,963 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-26 08:24:11,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:24:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-26 08:24:11,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:24:11,964 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:11,964 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-09-26 08:24:11,965 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:11,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:11,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2018-09-26 08:24:11,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:12,119 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:24:12,119 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:12,120 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:24:12,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:24:12,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:24:12,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:24:12,122 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-09-26 08:24:12,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:12,141 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:24:12,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:24:12,141 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-09-26 08:24:12,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:12,142 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:24:12,142 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:24:12,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:24:12,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:24:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:24:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:24:12,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:24:12,147 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-09-26 08:24:12,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:12,148 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:24:12,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:24:12,148 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:24:12,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:24:12,148 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:12,149 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-09-26 08:24:12,149 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:12,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:12,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2018-09-26 08:24:12,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:12,313 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:24:12,314 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:12,314 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:24:12,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:24:12,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:24:12,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:24:12,316 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-09-26 08:24:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:12,342 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-26 08:24:12,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:24:12,343 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-09-26 08:24:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:12,343 INFO L225 Difference]: With dead ends: 34 [2018-09-26 08:24:12,343 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:24:12,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:24:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:24:12,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-26 08:24:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:24:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-26 08:24:12,349 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-09-26 08:24:12,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:12,349 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-26 08:24:12,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:24:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-26 08:24:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:24:12,350 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:12,350 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-09-26 08:24:12,350 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:12,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:12,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2018-09-26 08:24:12,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:12,529 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:24:12,530 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:12,530 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:24:12,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:24:12,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:24:12,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:24:12,532 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-09-26 08:24:12,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:12,551 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:24:12,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:24:12,552 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-09-26 08:24:12,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:12,552 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:24:12,552 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:24:12,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:24:12,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:24:12,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:24:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:24:12,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:24:12,562 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-09-26 08:24:12,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:12,562 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:24:12,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:24:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:24:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:24:12,563 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:12,563 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-09-26 08:24:12,563 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:12,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:12,564 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2018-09-26 08:24:12,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:12,783 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:24:12,784 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:12,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:24:12,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:24:12,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:24:12,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:24:12,785 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-09-26 08:24:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:12,807 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 08:24:12,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:24:12,807 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-09-26 08:24:12,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:12,808 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:24:12,808 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:24:12,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:24:12,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:24:12,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 08:24:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:24:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-26 08:24:12,813 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-09-26 08:24:12,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:12,813 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-26 08:24:12,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:24:12,813 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-26 08:24:12,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:24:12,814 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:12,814 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-09-26 08:24:12,814 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:12,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:12,815 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2018-09-26 08:24:12,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:12,982 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:24:12,982 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:12,982 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:24:12,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:24:12,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:24:12,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:24:12,984 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-09-26 08:24:13,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:13,012 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 08:24:13,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:24:13,012 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-09-26 08:24:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:13,013 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:24:13,013 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:24:13,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:24:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:24:13,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:24:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:24:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:24:13,019 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-09-26 08:24:13,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:13,019 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:24:13,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:24:13,019 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:24:13,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:24:13,020 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:13,020 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-09-26 08:24:13,021 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:13,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:13,021 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2018-09-26 08:24:13,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:13,191 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:24:13,191 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:13,191 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:24:13,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:24:13,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:24:13,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:24:13,193 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-09-26 08:24:13,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:13,214 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-26 08:24:13,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:24:13,214 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-09-26 08:24:13,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:13,214 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:24:13,215 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:24:13,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:24:13,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:24:13,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-26 08:24:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:24:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-26 08:24:13,219 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-09-26 08:24:13,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:13,220 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-26 08:24:13,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:24:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-26 08:24:13,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:24:13,220 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:13,220 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-09-26 08:24:13,221 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:13,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:13,221 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2018-09-26 08:24:13,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:13,389 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:24:13,389 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:13,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:24:13,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:24:13,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:24:13,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:24:13,391 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-09-26 08:24:13,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:13,411 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:24:13,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:24:13,412 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-09-26 08:24:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:13,412 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:24:13,412 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:24:13,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:24:13,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:24:13,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:24:13,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:24:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:24:13,417 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-09-26 08:24:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:13,417 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:24:13,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:24:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:24:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:24:13,418 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:13,418 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-09-26 08:24:13,418 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:13,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:13,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2018-09-26 08:24:13,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:13,586 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:24:13,586 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:13,586 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:24:13,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:24:13,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:24:13,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:24:13,588 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-09-26 08:24:13,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:13,609 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 08:24:13,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:24:13,609 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-09-26 08:24:13,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:13,610 INFO L225 Difference]: With dead ends: 40 [2018-09-26 08:24:13,610 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:24:13,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:24:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:24:13,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-26 08:24:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:24:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-26 08:24:13,615 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-09-26 08:24:13,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:13,616 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-26 08:24:13,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:24:13,616 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-26 08:24:13,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:24:13,616 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:13,616 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-09-26 08:24:13,617 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:13,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:13,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2018-09-26 08:24:13,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:13,805 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:24:13,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:13,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:24:13,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:24:13,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:24:13,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:24:13,809 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-09-26 08:24:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:13,828 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:24:13,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:24:13,828 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-09-26 08:24:13,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:13,829 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:24:13,829 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:24:13,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:24:13,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:24:13,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:24:13,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:24:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:24:13,840 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-09-26 08:24:13,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:13,840 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:24:13,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:24:13,844 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:24:13,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:24:13,844 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:13,844 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-09-26 08:24:13,845 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:13,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:13,845 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2018-09-26 08:24:13,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:14,034 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:24:14,034 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:14,035 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:24:14,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:24:14,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:24:14,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:24:14,036 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-09-26 08:24:14,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:14,055 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-26 08:24:14,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:24:14,055 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-09-26 08:24:14,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:14,056 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:24:14,056 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:24:14,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:24:14,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:24:14,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 08:24:14,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:24:14,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-26 08:24:14,060 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-09-26 08:24:14,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:14,061 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-26 08:24:14,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:24:14,061 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-26 08:24:14,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:24:14,061 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:14,061 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-09-26 08:24:14,062 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:14,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:14,062 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2018-09-26 08:24:14,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:14,244 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:24:14,244 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:14,244 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:24:14,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:24:14,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:24:14,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:24:14,247 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-09-26 08:24:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:14,267 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 08:24:14,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:24:14,267 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-09-26 08:24:14,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:14,268 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:24:14,268 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:24:14,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:24:14,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:24:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:24:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:24:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:24:14,272 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-09-26 08:24:14,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:14,273 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:24:14,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:24:14,273 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:24:14,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:24:14,273 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:14,273 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-09-26 08:24:14,274 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:14,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:14,274 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2018-09-26 08:24:14,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:14,454 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:24:14,454 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:14,455 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:24:14,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:24:14,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:24:14,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:24:14,457 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-09-26 08:24:14,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:14,482 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-26 08:24:14,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:24:14,482 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-09-26 08:24:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:14,482 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:24:14,483 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 08:24:14,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:24:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 08:24:14,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-26 08:24:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 08:24:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-26 08:24:14,488 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-09-26 08:24:14,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:14,488 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-26 08:24:14,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:24:14,488 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-26 08:24:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:24:14,489 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:14,489 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-09-26 08:24:14,489 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:14,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:14,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2018-09-26 08:24:14,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:14,689 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:24:14,690 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:14,690 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:24:14,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:24:14,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:24:14,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:24:14,692 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-09-26 08:24:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:14,720 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:24:14,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:24:14,720 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-09-26 08:24:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:14,721 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:24:14,721 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:24:14,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:24:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:24:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:24:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:24:14,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:24:14,726 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-09-26 08:24:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:14,726 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:24:14,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:24:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:24:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:24:14,727 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:14,727 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-09-26 08:24:14,727 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:14,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:14,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2018-09-26 08:24:14,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:14,941 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:24:14,941 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:14,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:24:14,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:24:14,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:24:14,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:24:14,943 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-09-26 08:24:14,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:14,966 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-26 08:24:14,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:24:14,967 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-09-26 08:24:14,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:14,968 INFO L225 Difference]: With dead ends: 46 [2018-09-26 08:24:14,968 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:24:14,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:24:14,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:24:14,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-26 08:24:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 08:24:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-26 08:24:14,972 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-09-26 08:24:14,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:14,973 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-26 08:24:14,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:24:14,973 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-26 08:24:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 08:24:14,973 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:14,974 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-09-26 08:24:14,974 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:14,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:14,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2018-09-26 08:24:14,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:15,219 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:24:15,220 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:15,220 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:24:15,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:24:15,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:24:15,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:24:15,222 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-09-26 08:24:15,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:15,252 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:24:15,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:24:15,253 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-09-26 08:24:15,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:15,253 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:24:15,253 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:24:15,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:24:15,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:24:15,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:24:15,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:24:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:24:15,259 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-09-26 08:24:15,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:15,259 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:24:15,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:24:15,260 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:24:15,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:24:15,260 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:15,260 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-09-26 08:24:15,262 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:15,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:15,263 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2018-09-26 08:24:15,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:15,522 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:24:15,523 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:15,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:24:15,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:24:15,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:24:15,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:24:15,525 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-09-26 08:24:15,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:15,547 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-26 08:24:15,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:24:15,548 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-09-26 08:24:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:15,549 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:24:15,549 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:24:15,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:24:15,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:24:15,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-26 08:24:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:24:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-26 08:24:15,554 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-09-26 08:24:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:15,554 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-26 08:24:15,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:24:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-26 08:24:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:24:15,554 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:15,555 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-09-26 08:24:15,555 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:15,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:15,555 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2018-09-26 08:24:15,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:15,762 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:24:15,763 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:15,763 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:24:15,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:24:15,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:24:15,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:24:15,765 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-09-26 08:24:15,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:15,789 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-26 08:24:15,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:24:15,789 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-09-26 08:24:15,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:15,790 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:24:15,790 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:24:15,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:24:15,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:24:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:24:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:24:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:24:15,794 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-09-26 08:24:15,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:15,795 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:24:15,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:24:15,795 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:24:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:24:15,795 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:15,796 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-09-26 08:24:15,796 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:15,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:15,796 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2018-09-26 08:24:15,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:16,010 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:24:16,011 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:16,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:24:16,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:24:16,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:24:16,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:24:16,013 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-09-26 08:24:16,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:16,046 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 08:24:16,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:24:16,046 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-09-26 08:24:16,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:16,047 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:24:16,047 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 08:24:16,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:24:16,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 08:24:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-26 08:24:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 08:24:16,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-26 08:24:16,052 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-09-26 08:24:16,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:16,052 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-26 08:24:16,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:24:16,052 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-26 08:24:16,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 08:24:16,052 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:16,053 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-09-26 08:24:16,053 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:16,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:16,053 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2018-09-26 08:24:16,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:16,267 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:24:16,268 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:16,268 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:24:16,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:24:16,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:24:16,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:24:16,270 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-09-26 08:24:16,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:16,297 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 08:24:16,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:24:16,297 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-09-26 08:24:16,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:16,298 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:24:16,298 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:24:16,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:24:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:24:16,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:24:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:24:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 08:24:16,302 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-09-26 08:24:16,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:16,302 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 08:24:16,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:24:16,303 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 08:24:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:24:16,303 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:16,303 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-09-26 08:24:16,303 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:16,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:16,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2018-09-26 08:24:16,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:16,528 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:24:16,528 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:16,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:24:16,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:24:16,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:24:16,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:24:16,530 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-09-26 08:24:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:16,556 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-26 08:24:16,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:24:16,557 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-09-26 08:24:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:16,557 INFO L225 Difference]: With dead ends: 52 [2018-09-26 08:24:16,557 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 08:24:16,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:24:16,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 08:24:16,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-26 08:24:16,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 08:24:16,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-26 08:24:16,562 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-09-26 08:24:16,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:16,562 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-26 08:24:16,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:24:16,562 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-26 08:24:16,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 08:24:16,563 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:16,563 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-09-26 08:24:16,563 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:16,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:16,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2018-09-26 08:24:16,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:16,795 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:24:16,795 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:16,796 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:24:16,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:24:16,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:24:16,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:24:16,797 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-09-26 08:24:16,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:16,822 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-26 08:24:16,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:24:16,822 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-09-26 08:24:16,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:16,823 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:24:16,823 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:24:16,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:24:16,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:24:16,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:24:16,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:24:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:24:16,827 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-09-26 08:24:16,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:16,827 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:24:16,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:24:16,828 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:24:16,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:24:16,828 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:16,828 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-09-26 08:24:16,828 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:16,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:16,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2018-09-26 08:24:16,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:17,064 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:24:17,064 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:17,064 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:24:17,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:24:17,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:24:17,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:24:17,066 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-09-26 08:24:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:17,093 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-26 08:24:17,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:24:17,093 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-09-26 08:24:17,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:17,094 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:24:17,094 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:24:17,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:24:17,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:24:17,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-26 08:24:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 08:24:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-26 08:24:17,101 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-09-26 08:24:17,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:17,101 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-26 08:24:17,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:24:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-26 08:24:17,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 08:24:17,102 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:17,103 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-09-26 08:24:17,103 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:17,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:17,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2018-09-26 08:24:17,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:17,373 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:24:17,374 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:17,374 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:24:17,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:24:17,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:24:17,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:24:17,376 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-09-26 08:24:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:17,404 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 08:24:17,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:24:17,405 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-09-26 08:24:17,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:17,405 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:24:17,405 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:24:17,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:24:17,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:24:17,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:24:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:24:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:24:17,411 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-09-26 08:24:17,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:17,411 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:24:17,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:24:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:24:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:24:17,412 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:17,412 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-09-26 08:24:17,413 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:17,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:17,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2018-09-26 08:24:17,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:17,685 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:24:17,686 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:17,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:24:17,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:24:17,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:24:17,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:24:17,689 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-09-26 08:24:17,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:17,724 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-26 08:24:17,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:24:17,724 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-09-26 08:24:17,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:17,725 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:24:17,725 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:24:17,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:24:17,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:24:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-09-26 08:24:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 08:24:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-26 08:24:17,730 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-09-26 08:24:17,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:17,730 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-26 08:24:17,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:24:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-26 08:24:17,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 08:24:17,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:17,731 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-09-26 08:24:17,731 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:17,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:17,732 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2018-09-26 08:24:17,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:18,032 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:24:18,033 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:18,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:24:18,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:24:18,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:24:18,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:24:18,035 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-09-26 08:24:18,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:18,075 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-26 08:24:18,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:24:18,076 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-09-26 08:24:18,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:18,076 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:24:18,077 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:24:18,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:24:18,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:24:18,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:24:18,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:24:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 08:24:18,082 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-09-26 08:24:18,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:18,083 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 08:24:18,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:24:18,083 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 08:24:18,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:24:18,083 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:18,084 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-09-26 08:24:18,084 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:18,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:18,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125254, now seen corresponding path program 51 times [2018-09-26 08:24:18,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:18,365 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:24:18,365 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:18,366 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:24:18,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:24:18,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:24:18,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:24:18,368 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-09-26 08:24:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:18,393 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-26 08:24:18,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:24:18,393 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-09-26 08:24:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:18,394 INFO L225 Difference]: With dead ends: 58 [2018-09-26 08:24:18,394 INFO L226 Difference]: Without dead ends: 56 [2018-09-26 08:24:18,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:24:18,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-26 08:24:18,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-09-26 08:24:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:24:18,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-26 08:24:18,398 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-09-26 08:24:18,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:18,398 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-26 08:24:18,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:24:18,399 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-26 08:24:18,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-26 08:24:18,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:18,399 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-09-26 08:24:18,400 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:18,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:18,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107936, now seen corresponding path program 52 times [2018-09-26 08:24:18,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:18,649 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:24:18,649 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:18,650 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:24:18,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:24:18,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:24:18,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:24:18,653 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-09-26 08:24:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:18,684 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 08:24:18,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:24:18,685 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-09-26 08:24:18,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:18,685 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:24:18,685 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:24:18,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:24:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:24:18,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:24:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:24:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 08:24:18,690 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-09-26 08:24:18,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:18,690 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 08:24:18,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:24:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 08:24:18,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:24:18,695 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:18,696 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-09-26 08:24:18,696 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:18,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:18,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832710, now seen corresponding path program 53 times [2018-09-26 08:24:18,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:18,943 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:24:18,944 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:18,944 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:24:18,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:24:18,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:24:18,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:24:18,946 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-09-26 08:24:18,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:18,983 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-26 08:24:18,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:24:18,984 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-09-26 08:24:18,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:18,984 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:24:18,985 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 08:24:18,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:24:18,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 08:24:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-09-26 08:24:18,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 08:24:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-09-26 08:24:18,989 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-09-26 08:24:18,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:18,989 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-09-26 08:24:18,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:24:18,990 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-09-26 08:24:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-26 08:24:18,990 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:18,990 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-09-26 08:24:18,991 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:18,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:18,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895520, now seen corresponding path program 54 times [2018-09-26 08:24:18,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:19,262 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:24:19,262 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:19,262 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:24:19,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:24:19,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:24:19,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:24:19,264 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-09-26 08:24:19,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:19,305 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-26 08:24:19,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:24:19,306 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-09-26 08:24:19,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:19,306 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:24:19,307 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:24:19,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:24:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:24:19,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:24:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:24:19,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:24:19,311 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-09-26 08:24:19,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:19,311 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:24:19,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:24:19,311 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:24:19,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:24:19,312 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:19,312 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-09-26 08:24:19,313 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:19,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:19,313 INFO L82 PathProgramCache]: Analyzing trace with hash -836059322, now seen corresponding path program 55 times [2018-09-26 08:24:19,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:19,604 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:24:19,604 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:19,604 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:24:19,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:24:19,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:24:19,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:24:19,606 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-09-26 08:24:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:19,637 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-26 08:24:19,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:24:19,637 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-09-26 08:24:19,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:19,638 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:24:19,638 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 08:24:19,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:24:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 08:24:19,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-09-26 08:24:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-26 08:24:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-26 08:24:19,643 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-09-26 08:24:19,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:19,643 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-26 08:24:19,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:24:19,644 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-26 08:24:19,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-26 08:24:19,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:19,644 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-09-26 08:24:19,645 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:19,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:19,645 INFO L82 PathProgramCache]: Analyzing trace with hash -148039072, now seen corresponding path program 56 times [2018-09-26 08:24:19,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:19,945 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:24:19,946 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:19,946 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:24:19,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:24:19,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:24:19,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:24:19,948 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-09-26 08:24:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:19,994 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 08:24:19,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:24:19,994 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-09-26 08:24:19,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:19,995 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:24:19,995 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:24:19,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:24:19,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:24:19,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:24:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:24:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:24:20,000 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-09-26 08:24:20,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:20,000 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:24:20,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:24:20,000 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:24:20,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:24:20,001 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:20,001 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-09-26 08:24:20,001 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:20,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:20,002 INFO L82 PathProgramCache]: Analyzing trace with hash -294247802, now seen corresponding path program 57 times [2018-09-26 08:24:20,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:20,315 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:24:20,316 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:20,316 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:24:20,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:24:20,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:24:20,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:24:20,318 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-09-26 08:24:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:20,368 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-26 08:24:20,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:24:20,368 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-09-26 08:24:20,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:20,369 INFO L225 Difference]: With dead ends: 64 [2018-09-26 08:24:20,369 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 08:24:20,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:24:20,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 08:24:20,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-09-26 08:24:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 08:24:20,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-26 08:24:20,374 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-09-26 08:24:20,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:20,374 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-26 08:24:20,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:24:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-26 08:24:20,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 08:24:20,375 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:20,375 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-09-26 08:24:20,375 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:20,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:20,376 INFO L82 PathProgramCache]: Analyzing trace with hash -531751136, now seen corresponding path program 58 times [2018-09-26 08:24:20,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:20,752 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:20,752 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:20,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:24:20,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:24:20,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:24:20,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:24:20,754 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-09-26 08:24:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:20,799 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 08:24:20,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:24:20,799 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-09-26 08:24:20,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:20,800 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:24:20,800 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:24:20,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:24:20,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:24:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:24:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:24:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-26 08:24:20,805 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-09-26 08:24:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:20,805 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-26 08:24:20,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:24:20,806 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-26 08:24:20,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:24:20,806 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:20,807 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-09-26 08:24:20,807 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:20,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:20,807 INFO L82 PathProgramCache]: Analyzing trace with hash 695580102, now seen corresponding path program 59 times [2018-09-26 08:24:20,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:21,187 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:21,187 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:21,188 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:24:21,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:24:21,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:24:21,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:24:21,189 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-09-26 08:24:21,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:21,230 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-26 08:24:21,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:24:21,231 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-09-26 08:24:21,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:21,231 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:24:21,232 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:24:21,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:24:21,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:24:21,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-26 08:24:21,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 08:24:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-26 08:24:21,236 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-09-26 08:24:21,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:21,236 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-26 08:24:21,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:24:21,237 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-26 08:24:21,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 08:24:21,237 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:21,237 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-09-26 08:24:21,238 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:21,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:21,238 INFO L82 PathProgramCache]: Analyzing trace with hash 88142816, now seen corresponding path program 60 times [2018-09-26 08:24:21,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:21,522 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:21,522 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:21,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:24:21,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:24:21,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:24:21,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:24:21,525 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-09-26 08:24:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:21,567 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-26 08:24:21,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:24:21,567 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-09-26 08:24:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:21,568 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:24:21,568 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:24:21,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:24:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:24:21,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:24:21,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:24:21,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:24:21,573 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-09-26 08:24:21,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:21,573 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:24:21,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:24:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:24:21,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:24:21,574 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:21,574 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-09-26 08:24:21,574 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:21,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:21,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543866, now seen corresponding path program 61 times [2018-09-26 08:24:21,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:21,854 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:21,854 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:21,854 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:24:21,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:24:21,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:24:21,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:24:21,856 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-09-26 08:24:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:21,894 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-26 08:24:21,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:24:21,894 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-09-26 08:24:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:21,895 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:24:21,895 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:24:21,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:24:21,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:24:21,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-09-26 08:24:21,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:24:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-26 08:24:21,900 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-09-26 08:24:21,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:21,901 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-26 08:24:21,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:24:21,901 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-26 08:24:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 08:24:21,902 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:21,902 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-09-26 08:24:21,902 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:21,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:21,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223456, now seen corresponding path program 62 times [2018-09-26 08:24:21,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:22,190 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:22,190 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:22,190 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:24:22,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:24:22,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:24:22,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:24:22,193 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-09-26 08:24:22,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:22,246 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-09-26 08:24:22,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:24:22,247 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-09-26 08:24:22,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:22,247 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:24:22,247 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:24:22,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:24:22,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:24:22,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:24:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:24:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 08:24:22,252 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-09-26 08:24:22,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:22,252 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 08:24:22,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:24:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 08:24:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:24:22,253 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:22,253 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-09-26 08:24:22,254 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:22,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:22,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774662, now seen corresponding path program 63 times [2018-09-26 08:24:22,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:22,551 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,551 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:22,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:24:22,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:24:22,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:24:22,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:24:22,554 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-09-26 08:24:22,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:22,593 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-26 08:24:22,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:24:22,593 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-09-26 08:24:22,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:22,594 INFO L225 Difference]: With dead ends: 70 [2018-09-26 08:24:22,594 INFO L226 Difference]: Without dead ends: 68 [2018-09-26 08:24:22,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:24:22,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-26 08:24:22,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-09-26 08:24:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-26 08:24:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-26 08:24:22,602 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-09-26 08:24:22,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:22,602 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-26 08:24:22,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:24:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-26 08:24:22,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-26 08:24:22,603 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:22,603 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-09-26 08:24:22,603 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:22,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:22,603 INFO L82 PathProgramCache]: Analyzing trace with hash -892596896, now seen corresponding path program 64 times [2018-09-26 08:24:22,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:22,924 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:22,925 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:22,925 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:24:22,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:24:22,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:24:22,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:24:22,927 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-09-26 08:24:22,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:22,982 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 08:24:22,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:24:22,983 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-09-26 08:24:22,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:22,983 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:24:22,983 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:24:22,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:24:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:24:22,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:24:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:24:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 08:24:22,989 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-09-26 08:24:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:22,989 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 08:24:22,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:24:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 08:24:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:24:22,990 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:22,990 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-09-26 08:24:22,991 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:22,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:22,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703866, now seen corresponding path program 65 times [2018-09-26 08:24:22,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:23,343 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:23,344 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:23,344 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:24:23,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:24:23,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:24:23,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:24:23,346 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-09-26 08:24:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:23,397 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-26 08:24:23,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:24:23,398 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-09-26 08:24:23,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:23,398 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:24:23,398 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:24:23,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:24:23,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:24:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-09-26 08:24:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:24:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-09-26 08:24:23,403 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-09-26 08:24:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:23,403 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-09-26 08:24:23,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:24:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-09-26 08:24:23,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-26 08:24:23,404 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:23,404 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-09-26 08:24:23,404 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:23,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:23,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718432, now seen corresponding path program 66 times [2018-09-26 08:24:23,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:23,733 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:23,733 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:23,733 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:24:23,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:24:23,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:24:23,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:24:23,736 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-09-26 08:24:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:23,787 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-09-26 08:24:23,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:24:23,788 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-09-26 08:24:23,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:23,789 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:24:23,789 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:24:23,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:24:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:24:23,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:24:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:24:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:24:23,793 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-09-26 08:24:23,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:23,794 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:24:23,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:24:23,794 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:24:23,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:24:23,795 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:23,795 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-09-26 08:24:23,795 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:23,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:23,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438138, now seen corresponding path program 67 times [2018-09-26 08:24:23,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:24,247 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:24,248 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:24,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:24:24,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:24:24,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:24:24,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:24:24,250 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-09-26 08:24:24,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:24,290 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-26 08:24:24,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:24:24,290 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-09-26 08:24:24,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:24,291 INFO L225 Difference]: With dead ends: 74 [2018-09-26 08:24:24,291 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:24:24,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:24:24,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:24:24,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-26 08:24:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:24:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-26 08:24:24,296 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-09-26 08:24:24,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:24,296 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-26 08:24:24,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:24:24,296 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-26 08:24:24,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-26 08:24:24,297 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:24,297 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-09-26 08:24:24,297 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:24,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:24,298 INFO L82 PathProgramCache]: Analyzing trace with hash 976119520, now seen corresponding path program 68 times [2018-09-26 08:24:24,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:24,623 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:24,623 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:24,624 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:24:24,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:24:24,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:24:24,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:24:24,626 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-09-26 08:24:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:24,674 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 08:24:24,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:24:24,675 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-09-26 08:24:24,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:24,675 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:24:24,676 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:24:24,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:24:24,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:24:24,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:24:24,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:24:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 08:24:24,680 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-09-26 08:24:24,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:24,681 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 08:24:24,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:24:24,681 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 08:24:24,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:24:24,681 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:24,681 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-09-26 08:24:24,682 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:24,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:24,682 INFO L82 PathProgramCache]: Analyzing trace with hash 194930182, now seen corresponding path program 69 times [2018-09-26 08:24:24,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:24,996 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:24,997 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:24,997 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:24:24,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:24:24,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:24:24,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:24:24,999 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-09-26 08:24:25,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:25,054 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-26 08:24:25,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:24:25,055 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-09-26 08:24:25,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:25,055 INFO L225 Difference]: With dead ends: 76 [2018-09-26 08:24:25,056 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:24:25,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:24:25,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:24:25,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-26 08:24:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:24:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-26 08:24:25,060 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-09-26 08:24:25,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:25,061 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-26 08:24:25,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:24:25,061 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-26 08:24:25,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:24:25,061 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:25,062 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-09-26 08:24:25,062 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:25,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:25,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864480, now seen corresponding path program 70 times [2018-09-26 08:24:25,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:25,383 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:25,383 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:25,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:24:25,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:24:25,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:24:25,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:24:25,388 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-09-26 08:24:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:25,446 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-09-26 08:24:25,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:24:25,446 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-09-26 08:24:25,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:25,447 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:24:25,447 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:24:25,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:24:25,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:24:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:24:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:24:25,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-26 08:24:25,452 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-09-26 08:24:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:25,452 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-26 08:24:25,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:24:25,452 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-26 08:24:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:24:25,453 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:25,453 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-09-26 08:24:25,453 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:25,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:25,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779834, now seen corresponding path program 71 times [2018-09-26 08:24:25,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:25,803 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:24:25,803 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:25,803 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:24:25,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:24:25,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:24:25,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:24:25,806 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-09-26 08:24:25,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:25,869 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-26 08:24:25,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:24:25,869 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-09-26 08:24:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:25,870 INFO L225 Difference]: With dead ends: 78 [2018-09-26 08:24:25,870 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:24:25,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:24:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:24:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-26 08:24:25,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:24:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-26 08:24:25,876 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-09-26 08:24:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:25,877 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-26 08:24:25,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:24:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-26 08:24:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 08:24:25,878 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:25,878 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-09-26 08:24:25,878 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:25,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:25,878 INFO L82 PathProgramCache]: Analyzing trace with hash 365428832, now seen corresponding path program 72 times [2018-09-26 08:24:25,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:26,329 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:24:26,329 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:26,329 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:24:26,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:24:26,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:24:26,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:24:26,331 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-09-26 08:24:26,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:26,389 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-26 08:24:26,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:24:26,389 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-09-26 08:24:26,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:26,390 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:24:26,390 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:24:26,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:24:26,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:24:26,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:24:26,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:24:26,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:24:26,394 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-09-26 08:24:26,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:26,394 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:24:26,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:24:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:24:26,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:24:26,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:26,395 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-09-26 08:24:26,396 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:26,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:26,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1556611962, now seen corresponding path program 73 times [2018-09-26 08:24:26,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:26,725 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:24:26,725 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:26,725 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:24:26,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:24:26,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:24:26,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:24:26,728 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-09-26 08:24:26,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:26,788 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-26 08:24:26,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:24:26,789 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-09-26 08:24:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:26,789 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:24:26,789 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:24:26,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:24:26,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:24:26,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-09-26 08:24:26,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:24:26,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-09-26 08:24:26,794 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-09-26 08:24:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:26,794 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-09-26 08:24:26,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:24:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-09-26 08:24:26,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 08:24:26,795 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:26,795 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-09-26 08:24:26,795 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:26,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:26,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334432, now seen corresponding path program 74 times [2018-09-26 08:24:26,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:27,097 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:24:27,098 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:27,098 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:24:27,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:24:27,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:24:27,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:24:27,100 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-09-26 08:24:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:27,161 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-26 08:24:27,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:24:27,162 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-09-26 08:24:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:27,163 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:24:27,163 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:24:27,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:24:27,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:24:27,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:24:27,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:24:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-26 08:24:27,168 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-09-26 08:24:27,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:27,168 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-26 08:24:27,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:24:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-26 08:24:27,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:24:27,169 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:27,169 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-09-26 08:24:27,169 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:27,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:27,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600186, now seen corresponding path program 75 times [2018-09-26 08:24:27,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:27,506 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:24:27,507 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:27,507 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:24:27,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:24:27,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:24:27,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:24:27,509 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-09-26 08:24:27,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:27,578 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-26 08:24:27,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:24:27,578 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-09-26 08:24:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:27,579 INFO L225 Difference]: With dead ends: 82 [2018-09-26 08:24:27,579 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:24:27,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:24:27,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:24:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-26 08:24:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 08:24:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-26 08:24:27,583 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-09-26 08:24:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:27,583 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-26 08:24:27,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:24:27,584 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-26 08:24:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-26 08:24:27,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:27,584 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-09-26 08:24:27,585 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:27,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:27,585 INFO L82 PathProgramCache]: Analyzing trace with hash -268903968, now seen corresponding path program 76 times [2018-09-26 08:24:27,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:27,925 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:24:27,926 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:27,926 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:24:27,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:24:27,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:24:27,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:24:27,928 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-09-26 08:24:27,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:27,978 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 08:24:27,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:24:27,978 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-09-26 08:24:27,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:27,979 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:24:27,979 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:24:27,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:24:27,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:24:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:24:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:24:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:24:27,983 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-09-26 08:24:27,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:27,983 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:24:27,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:24:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:24:27,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:24:27,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:27,984 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-09-26 08:24:27,985 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:27,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:27,985 INFO L82 PathProgramCache]: Analyzing trace with hash 253907718, now seen corresponding path program 77 times [2018-09-26 08:24:27,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:28,320 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:24:28,320 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:28,320 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:24:28,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:24:28,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:24:28,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:24:28,322 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-09-26 08:24:28,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:28,365 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-26 08:24:28,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:24:28,365 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-09-26 08:24:28,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:28,366 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:24:28,366 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:24:28,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:24:28,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:24:28,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-26 08:24:28,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 08:24:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-26 08:24:28,370 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-09-26 08:24:28,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:28,371 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-26 08:24:28,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:24:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-26 08:24:28,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-26 08:24:28,372 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:28,372 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-09-26 08:24:28,372 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:28,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:28,373 INFO L82 PathProgramCache]: Analyzing trace with hash -718799200, now seen corresponding path program 78 times [2018-09-26 08:24:28,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:28,747 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:24:28,747 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:28,747 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:24:28,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:24:28,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:24:28,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:24:28,749 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-09-26 08:24:28,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:28,816 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-26 08:24:28,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:24:28,817 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-09-26 08:24:28,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:28,818 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:24:28,818 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:24:28,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:24:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:24:28,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:24:28,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:24:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:24:28,821 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-09-26 08:24:28,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:28,822 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:24:28,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:24:28,822 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:24:28,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:24:28,823 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:28,823 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-09-26 08:24:28,823 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:28,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:28,823 INFO L82 PathProgramCache]: Analyzing trace with hash -807942586, now seen corresponding path program 79 times [2018-09-26 08:24:28,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:29,146 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:24:29,146 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:29,146 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:24:29,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:24:29,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:24:29,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:24:29,148 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-09-26 08:24:29,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:29,206 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-26 08:24:29,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:24:29,207 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-09-26 08:24:29,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:29,207 INFO L225 Difference]: With dead ends: 86 [2018-09-26 08:24:29,207 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 08:24:29,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:24:29,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 08:24:29,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-09-26 08:24:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-26 08:24:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-09-26 08:24:29,211 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-09-26 08:24:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:29,211 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-09-26 08:24:29,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:24:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-09-26 08:24:29,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-26 08:24:29,212 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:29,213 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-09-26 08:24:29,213 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:29,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:29,213 INFO L82 PathProgramCache]: Analyzing trace with hash 723579744, now seen corresponding path program 80 times [2018-09-26 08:24:29,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:29,588 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:24:29,589 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:29,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:24:29,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:24:29,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:24:29,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:24:29,591 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-09-26 08:24:29,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:29,642 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 08:24:29,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:24:29,643 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-09-26 08:24:29,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:29,645 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:24:29,645 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:24:29,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:24:29,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:24:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:24:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:24:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 08:24:29,649 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-09-26 08:24:29,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:29,649 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 08:24:29,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:24:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 08:24:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:24:29,650 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:29,650 INFO L375 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-09-26 08:24:29,651 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:29,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:29,651 INFO L82 PathProgramCache]: Analyzing trace with hash 956131718, now seen corresponding path program 81 times [2018-09-26 08:24:29,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:30,060 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:24:30,061 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:30,061 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:24:30,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:24:30,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:24:30,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:24:30,063 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-09-26 08:24:30,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:30,128 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-26 08:24:30,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:24:30,128 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-09-26 08:24:30,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:30,129 INFO L225 Difference]: With dead ends: 88 [2018-09-26 08:24:30,129 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:24:30,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:24:30,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:24:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-09-26 08:24:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:24:30,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-26 08:24:30,134 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-09-26 08:24:30,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:30,134 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-26 08:24:30,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:24:30,134 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-26 08:24:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 08:24:30,135 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:30,136 INFO L375 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-09-26 08:24:30,136 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:30,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:30,136 INFO L82 PathProgramCache]: Analyzing trace with hash -424691680, now seen corresponding path program 82 times [2018-09-26 08:24:30,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:30,564 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:24:30,564 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:30,564 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:24:30,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:24:30,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:24:30,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:24:30,566 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-09-26 08:24:30,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:30,659 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-09-26 08:24:30,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:24:30,659 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-09-26 08:24:30,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:30,660 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:24:30,660 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:24:30,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:24:30,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:24:30,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:24:30,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:24:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 08:24:30,664 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-09-26 08:24:30,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:30,665 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 08:24:30,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:24:30,665 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 08:24:30,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:24:30,666 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:30,666 INFO L375 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-09-26 08:24:30,666 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:30,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:30,666 INFO L82 PathProgramCache]: Analyzing trace with hash -280544058, now seen corresponding path program 83 times [2018-09-26 08:24:30,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:31,033 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:24:31,034 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:31,034 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:24:31,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:24:31,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:24:31,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:24:31,036 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-09-26 08:24:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:31,083 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-26 08:24:31,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:24:31,083 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-09-26 08:24:31,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:31,084 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:24:31,085 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:24:31,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:24:31,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:24:31,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-09-26 08:24:31,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 08:24:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-09-26 08:24:31,089 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-09-26 08:24:31,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:31,090 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-09-26 08:24:31,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:24:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-09-26 08:24:31,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 08:24:31,091 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:31,091 INFO L375 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-09-26 08:24:31,091 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:31,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:31,092 INFO L82 PathProgramCache]: Analyzing trace with hash -106935072, now seen corresponding path program 84 times [2018-09-26 08:24:31,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:31,482 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:24:31,482 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:31,482 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:24:31,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:24:31,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:24:31,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:24:31,484 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-09-26 08:24:31,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:31,576 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 08:24:31,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:24:31,577 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-09-26 08:24:31,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:31,577 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:24:31,578 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:24:31,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:24:31,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:24:31,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:24:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:24:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:24:31,581 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-09-26 08:24:31,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:31,582 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:24:31,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:24:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:24:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:24:31,582 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:31,583 INFO L375 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-09-26 08:24:31,583 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:31,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:31,583 INFO L82 PathProgramCache]: Analyzing trace with hash 979976198, now seen corresponding path program 85 times [2018-09-26 08:24:31,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:31,862 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:24:31,862 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:31,862 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:24:31,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:24:31,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:24:31,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:24:31,864 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-09-26 08:24:31,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:31,901 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-26 08:24:31,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:24:31,901 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-09-26 08:24:31,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:31,902 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:24:31,902 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:24:31,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:24:31,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:24:31,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-09-26 08:24:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-26 08:24:31,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-09-26 08:24:31,906 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-09-26 08:24:31,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:31,906 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-09-26 08:24:31,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:24:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-09-26 08:24:31,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-26 08:24:31,907 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:31,907 INFO L375 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-09-26 08:24:31,907 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:31,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:31,908 INFO L82 PathProgramCache]: Analyzing trace with hash 314487200, now seen corresponding path program 86 times [2018-09-26 08:24:31,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:32,268 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:24:32,268 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:32,269 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:24:32,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:24:32,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:24:32,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:24:32,270 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-09-26 08:24:32,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:32,370 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-09-26 08:24:32,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:24:32,370 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-09-26 08:24:32,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:32,371 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:24:32,371 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:24:32,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:24:32,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:24:32,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:24:32,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:24:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 08:24:32,376 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-09-26 08:24:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:32,376 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 08:24:32,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:24:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 08:24:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:24:32,377 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:32,377 INFO L375 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-09-26 08:24:32,377 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:32,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:32,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164742, now seen corresponding path program 87 times [2018-09-26 08:24:32,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:32,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:32,789 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:24:32,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:24:32,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:24:32,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:24:32,791 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-09-26 08:24:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:32,830 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-26 08:24:32,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:24:32,831 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-09-26 08:24:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:32,832 INFO L225 Difference]: With dead ends: 94 [2018-09-26 08:24:32,832 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:24:32,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:24:32,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:24:32,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-26 08:24:32,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 08:24:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-26 08:24:32,838 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-09-26 08:24:32,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:32,838 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-26 08:24:32,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:24:32,838 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-26 08:24:32,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-26 08:24:32,839 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:32,839 INFO L375 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-09-26 08:24:32,839 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:32,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:32,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364768, now seen corresponding path program 88 times [2018-09-26 08:24:32,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:33,154 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:33,155 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:24:33,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:24:33,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:24:33,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:24:33,157 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-09-26 08:24:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:33,230 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 08:24:33,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:24:33,231 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-09-26 08:24:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:33,233 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:24:33,233 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:24:33,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:24:33,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:24:33,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:24:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:24:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 08:24:33,243 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-09-26 08:24:33,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:33,243 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 08:24:33,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:24:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 08:24:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:24:33,244 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:33,244 INFO L375 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-09-26 08:24:33,244 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:33,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:33,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663686, now seen corresponding path program 89 times [2018-09-26 08:24:33,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:33,603 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:33,603 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:24:33,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:24:33,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:24:33,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:24:33,605 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-09-26 08:24:33,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:33,676 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-26 08:24:33,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:24:33,677 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-09-26 08:24:33,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:33,677 INFO L225 Difference]: With dead ends: 96 [2018-09-26 08:24:33,678 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:24:33,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:24:33,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:24:33,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-09-26 08:24:33,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-26 08:24:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-09-26 08:24:33,681 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-09-26 08:24:33,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:33,681 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-09-26 08:24:33,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:24:33,682 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-09-26 08:24:33,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-26 08:24:33,682 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:33,683 INFO L375 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-09-26 08:24:33,683 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:33,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:33,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930144, now seen corresponding path program 90 times [2018-09-26 08:24:33,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:34,030 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:34,031 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:24:34,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:24:34,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:24:34,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:24:34,033 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-09-26 08:24:34,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:34,072 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-09-26 08:24:34,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:24:34,072 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-09-26 08:24:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:34,073 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:24:34,073 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:24:34,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:24:34,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:24:34,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:24:34,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:24:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:24:34,077 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-09-26 08:24:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:34,077 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:24:34,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:24:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:24:34,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:24:34,078 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:34,078 INFO L375 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-09-26 08:24:34,078 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:34,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:34,078 INFO L82 PathProgramCache]: Analyzing trace with hash 854092230, now seen corresponding path program 91 times [2018-09-26 08:24:34,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:34,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:34,399 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:34,399 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:24:34,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:24:34,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:24:34,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:24:34,401 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-09-26 08:24:34,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:34,463 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-26 08:24:34,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:24:34,463 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-09-26 08:24:34,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:34,464 INFO L225 Difference]: With dead ends: 98 [2018-09-26 08:24:34,464 INFO L226 Difference]: Without dead ends: 96 [2018-09-26 08:24:34,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:24:34,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-26 08:24:34,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-26 08:24:34,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:24:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-26 08:24:34,468 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-09-26 08:24:34,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:34,469 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-26 08:24:34,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:24:34,469 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-26 08:24:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-26 08:24:34,469 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:34,469 INFO L375 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-09-26 08:24:34,469 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:34,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:34,470 INFO L82 PathProgramCache]: Analyzing trace with hash 707051488, now seen corresponding path program 92 times [2018-09-26 08:24:34,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:34,791 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:34,791 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:24:34,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:24:34,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:24:34,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:24:34,793 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-09-26 08:24:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:34,881 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-26 08:24:34,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:24:34,881 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-09-26 08:24:34,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:34,882 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:24:34,882 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:24:34,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:24:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:24:34,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:24:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:24:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 08:24:34,885 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-09-26 08:24:34,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:34,886 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 08:24:34,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:24:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 08:24:34,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:24:34,887 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:34,887 INFO L375 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-09-26 08:24:34,887 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:34,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:34,887 INFO L82 PathProgramCache]: Analyzing trace with hash 443755782, now seen corresponding path program 93 times [2018-09-26 08:24:34,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:35,236 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:35,236 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:24:35,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:24:35,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:24:35,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:24:35,237 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-09-26 08:24:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:35,320 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-26 08:24:35,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:24:35,320 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-09-26 08:24:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:35,321 INFO L225 Difference]: With dead ends: 100 [2018-09-26 08:24:35,321 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 08:24:35,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:24:35,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 08:24:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-26 08:24:35,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:24:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-26 08:24:35,325 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-09-26 08:24:35,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:35,325 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-26 08:24:35,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:24:35,325 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-26 08:24:35,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-26 08:24:35,326 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:35,326 INFO L375 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-09-26 08:24:35,326 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:35,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:35,326 INFO L82 PathProgramCache]: Analyzing trace with hash 871523488, now seen corresponding path program 94 times [2018-09-26 08:24:35,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:35,801 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:35,801 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:24:35,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:24:35,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:24:35,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:24:35,803 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-09-26 08:24:35,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:35,849 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-26 08:24:35,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:24:35,849 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-09-26 08:24:35,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:35,850 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:24:35,850 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:24:35,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:24:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:24:35,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:24:35,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:24:35,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-09-26 08:24:35,853 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-09-26 08:24:35,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:35,853 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-09-26 08:24:35,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:24:35,853 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-09-26 08:24:35,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:24:35,854 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:35,854 INFO L375 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-09-26 08:24:35,854 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:35,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:35,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420486, now seen corresponding path program 95 times [2018-09-26 08:24:35,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:36,201 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:36,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:24:36,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:24:36,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:24:36,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:24:36,204 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-09-26 08:24:36,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:36,253 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-26 08:24:36,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:24:36,254 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-09-26 08:24:36,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:36,254 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:24:36,254 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:24:36,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:24:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:24:36,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-26 08:24:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:24:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-09-26 08:24:36,258 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-09-26 08:24:36,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:36,258 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-09-26 08:24:36,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:24:36,258 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-09-26 08:24:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-26 08:24:36,259 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:36,259 INFO L375 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-09-26 08:24:36,259 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:36,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:36,259 INFO L82 PathProgramCache]: Analyzing trace with hash 15325536, now seen corresponding path program 96 times [2018-09-26 08:24:36,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:36,612 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:36,612 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:24:36,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:24:36,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:24:36,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:24:36,614 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-09-26 08:24:36,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:36,667 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-26 08:24:36,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:24:36,668 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-09-26 08:24:36,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:36,668 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:24:36,668 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:24:36,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:24:36,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:24:36,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:24:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:24:36,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:24:36,672 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-09-26 08:24:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:36,672 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:24:36,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:24:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:24:36,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:24:36,673 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:36,673 INFO L375 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-09-26 08:24:36,673 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:36,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:36,673 INFO L82 PathProgramCache]: Analyzing trace with hash 475087750, now seen corresponding path program 97 times [2018-09-26 08:24:36,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:37,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:37,058 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:37,059 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:24:37,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:24:37,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:24:37,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:24:37,060 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-09-26 08:24:37,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:37,119 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-26 08:24:37,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:24:37,119 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-09-26 08:24:37,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:37,120 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:24:37,120 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 08:24:37,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:24:37,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 08:24:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-09-26 08:24:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-26 08:24:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-26 08:24:37,123 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-09-26 08:24:37,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:37,124 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-26 08:24:37,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:24:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-26 08:24:37,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-26 08:24:37,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:37,125 INFO L375 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-09-26 08:24:37,125 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:37,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:37,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814496, now seen corresponding path program 98 times [2018-09-26 08:24:37,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:37,506 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:37,506 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:24:37,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:24:37,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:24:37,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:24:37,508 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-09-26 08:24:37,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:37,567 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-26 08:24:37,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:24:37,568 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-09-26 08:24:37,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:37,568 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:24:37,568 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:24:37,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:24:37,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:24:37,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:24:37,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:24:37,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-09-26 08:24:37,573 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-09-26 08:24:37,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:37,573 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-09-26 08:24:37,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:24:37,573 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-09-26 08:24:37,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:24:37,573 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:37,574 INFO L375 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-09-26 08:24:37,574 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:37,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:37,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670662, now seen corresponding path program 99 times [2018-09-26 08:24:37,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:38,038 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:38,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:24:38,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:24:38,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:24:38,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:24:38,040 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-09-26 08:24:38,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:38,100 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-26 08:24:38,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:24:38,101 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-09-26 08:24:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:38,101 INFO L225 Difference]: With dead ends: 106 [2018-09-26 08:24:38,101 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:24:38,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:24:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:24:38,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-26 08:24:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 08:24:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-09-26 08:24:38,105 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-09-26 08:24:38,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:38,105 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-09-26 08:24:38,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:24:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-09-26 08:24:38,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-26 08:24:38,106 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:38,106 INFO L375 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-09-26 08:24:38,106 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:38,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:38,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080992, now seen corresponding path program 100 times [2018-09-26 08:24:38,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:38,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:38,490 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:38,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:24:38,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:24:38,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:24:38,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:24:38,492 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-09-26 08:24:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:38,557 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-26 08:24:38,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:24:38,557 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-09-26 08:24:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:38,558 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:24:38,558 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:24:38,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:24:38,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:24:38,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-09-26 08:24:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:24:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-26 08:24:38,563 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-09-26 08:24:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:38,563 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-26 08:24:38,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:24:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-26 08:24:38,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:24:38,564 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:38,564 INFO L375 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-09-26 08:24:38,564 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:38,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:38,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833926, now seen corresponding path program 101 times [2018-09-26 08:24:38,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:38,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:38,989 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:38,989 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:24:38,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:24:38,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:24:38,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:24:38,992 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-09-26 08:24:39,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:39,074 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-09-26 08:24:39,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:24:39,074 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-09-26 08:24:39,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:39,075 INFO L225 Difference]: With dead ends: 108 [2018-09-26 08:24:39,075 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 08:24:39,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:24:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 08:24:39,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-09-26 08:24:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 08:24:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-09-26 08:24:39,080 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-09-26 08:24:39,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:39,080 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-09-26 08:24:39,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:24:39,080 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-09-26 08:24:39,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-26 08:24:39,081 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:39,081 INFO L375 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-09-26 08:24:39,081 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:39,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:39,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076768, now seen corresponding path program 102 times [2018-09-26 08:24:39,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:39,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:39,585 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:39,585 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:24:39,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:24:39,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:24:39,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:24:39,587 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-09-26 08:24:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:39,702 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-09-26 08:24:39,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:24:39,702 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-09-26 08:24:39,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:39,703 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:24:39,703 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:24:39,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:24:39,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:24:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:24:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:24:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-26 08:24:39,708 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-09-26 08:24:39,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:39,708 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-26 08:24:39,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:24:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-26 08:24:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:24:39,709 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:39,709 INFO L375 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-09-26 08:24:39,709 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:39,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:39,709 INFO L82 PathProgramCache]: Analyzing trace with hash 748670278, now seen corresponding path program 103 times [2018-09-26 08:24:39,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:40,157 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:40,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:24:40,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:24:40,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:24:40,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:24:40,160 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-09-26 08:24:40,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:40,287 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-09-26 08:24:40,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:24:40,287 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-09-26 08:24:40,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:40,288 INFO L225 Difference]: With dead ends: 110 [2018-09-26 08:24:40,288 INFO L226 Difference]: Without dead ends: 108 [2018-09-26 08:24:40,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:24:40,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-26 08:24:40,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-09-26 08:24:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-26 08:24:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-09-26 08:24:40,293 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-09-26 08:24:40,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:40,294 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-09-26 08:24:40,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:24:40,294 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-09-26 08:24:40,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-26 08:24:40,294 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:40,295 INFO L375 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-09-26 08:24:40,295 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:40,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:40,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938272, now seen corresponding path program 104 times [2018-09-26 08:24:40,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:40,878 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:40,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:24:40,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:24:40,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:24:40,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:24:40,880 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-09-26 08:24:40,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:40,949 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-26 08:24:40,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:24:40,950 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-09-26 08:24:40,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:40,950 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:24:40,950 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:24:40,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:24:40,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:24:40,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 08:24:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:24:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-26 08:24:40,955 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-09-26 08:24:40,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:40,956 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-26 08:24:40,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:24:40,956 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-26 08:24:40,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:24:40,956 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:40,956 INFO L375 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-09-26 08:24:40,956 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:40,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:40,957 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492282, now seen corresponding path program 105 times [2018-09-26 08:24:40,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:41,390 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:41,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:24:41,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:24:41,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:24:41,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:24:41,392 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-09-26 08:24:41,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:41,450 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-09-26 08:24:41,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:24:41,450 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-09-26 08:24:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:41,450 INFO L225 Difference]: With dead ends: 112 [2018-09-26 08:24:41,450 INFO L226 Difference]: Without dead ends: 110 [2018-09-26 08:24:41,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:24:41,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-26 08:24:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-09-26 08:24:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-26 08:24:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-09-26 08:24:41,455 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-09-26 08:24:41,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:41,456 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-09-26 08:24:41,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:24:41,456 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-09-26 08:24:41,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-26 08:24:41,456 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:41,457 INFO L375 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-09-26 08:24:41,457 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:41,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:41,457 INFO L82 PathProgramCache]: Analyzing trace with hash -132755168, now seen corresponding path program 106 times [2018-09-26 08:24:41,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:41,900 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:41,900 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:24:41,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:24:41,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:24:41,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:24:41,902 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-09-26 08:24:42,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:42,041 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-09-26 08:24:42,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:24:42,042 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-09-26 08:24:42,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:42,042 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:24:42,042 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:24:42,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:24:42,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:24:42,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-26 08:24:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:24:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-26 08:24:42,046 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-09-26 08:24:42,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:42,047 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-26 08:24:42,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:24:42,047 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-26 08:24:42,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:24:42,047 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,047 INFO L375 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-09-26 08:24:42,048 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:42,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,048 INFO L82 PathProgramCache]: Analyzing trace with hash 179553222, now seen corresponding path program 107 times [2018-09-26 08:24:42,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:42,504 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:42,504 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:24:42,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:24:42,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:24:42,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:24:42,507 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-09-26 08:24:42,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:42,636 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-09-26 08:24:42,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:24:42,636 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-09-26 08:24:42,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:42,636 INFO L225 Difference]: With dead ends: 114 [2018-09-26 08:24:42,637 INFO L226 Difference]: Without dead ends: 112 [2018-09-26 08:24:42,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:24:42,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-09-26 08:24:42,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-09-26 08:24:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-26 08:24:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-09-26 08:24:42,641 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-09-26 08:24:42,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:42,642 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-09-26 08:24:42,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:24:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-09-26 08:24:42,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-26 08:24:42,642 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,643 INFO L375 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-09-26 08:24:42,643 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:42,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178720, now seen corresponding path program 108 times [2018-09-26 08:24:42,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:43,210 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:43,210 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:24:43,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:24:43,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:24:43,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:24:43,212 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-09-26 08:24:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,301 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-26 08:24:43,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:24:43,301 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-09-26 08:24:43,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,301 INFO L225 Difference]: With dead ends: 115 [2018-09-26 08:24:43,302 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:24:43,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:24:43,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:24:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-26 08:24:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:24:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-26 08:24:43,305 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-09-26 08:24:43,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,305 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-26 08:24:43,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:24:43,305 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-26 08:24:43,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:24:43,306 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,306 INFO L375 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-09-26 08:24:43,306 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:43,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,306 INFO L82 PathProgramCache]: Analyzing trace with hash 751830790, now seen corresponding path program 109 times [2018-09-26 08:24:43,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:43,765 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:43,765 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:24:43,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:24:43,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:24:43,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:24:43,768 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-09-26 08:24:43,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,910 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-09-26 08:24:43,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:24:43,911 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-09-26 08:24:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,911 INFO L225 Difference]: With dead ends: 116 [2018-09-26 08:24:43,911 INFO L226 Difference]: Without dead ends: 114 [2018-09-26 08:24:43,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:24:43,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-26 08:24:43,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-09-26 08:24:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-26 08:24:43,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-09-26 08:24:43,915 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-09-26 08:24:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,916 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-09-26 08:24:43,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:24:43,916 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-09-26 08:24:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-26 08:24:43,917 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,917 INFO L375 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-09-26 08:24:43,917 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:43,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914144, now seen corresponding path program 110 times [2018-09-26 08:24:43,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:44,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:44,410 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:44,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:24:44,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:24:44,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:24:44,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:24:44,412 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-09-26 08:24:44,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:44,486 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-09-26 08:24:44,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:24:44,486 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-09-26 08:24:44,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:44,487 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:24:44,487 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:24:44,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:24:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:24:44,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 08:24:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:24:44,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-09-26 08:24:44,491 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-09-26 08:24:44,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:44,492 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-09-26 08:24:44,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:24:44,492 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-09-26 08:24:44,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:24:44,492 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:44,493 INFO L375 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-09-26 08:24:44,493 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:44,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:44,493 INFO L82 PathProgramCache]: Analyzing trace with hash 954759750, now seen corresponding path program 111 times [2018-09-26 08:24:44,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:45,043 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:45,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:24:45,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:24:45,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:24:45,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:24:45,046 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2018-09-26 08:24:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:45,192 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-09-26 08:24:45,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:24:45,193 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2018-09-26 08:24:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:45,193 INFO L225 Difference]: With dead ends: 118 [2018-09-26 08:24:45,193 INFO L226 Difference]: Without dead ends: 116 [2018-09-26 08:24:45,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:24:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-26 08:24:45,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-09-26 08:24:45,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-26 08:24:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-09-26 08:24:45,198 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-09-26 08:24:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:45,199 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-09-26 08:24:45,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:24:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-09-26 08:24:45,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-26 08:24:45,199 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:45,199 INFO L375 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2018-09-26 08:24:45,200 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:45,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:45,200 INFO L82 PathProgramCache]: Analyzing trace with hash -467222688, now seen corresponding path program 112 times [2018-09-26 08:24:45,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:45,817 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:45,817 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:24:45,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:24:45,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:24:45,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:24:45,819 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2018-09-26 08:24:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:45,964 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-26 08:24:45,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:24:45,964 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2018-09-26 08:24:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:45,964 INFO L225 Difference]: With dead ends: 119 [2018-09-26 08:24:45,964 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 08:24:45,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:24:45,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 08:24:45,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-09-26 08:24:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:24:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-26 08:24:45,968 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-09-26 08:24:45,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:45,968 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-26 08:24:45,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:24:45,968 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-26 08:24:45,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:24:45,969 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:45,969 INFO L375 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2018-09-26 08:24:45,969 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:45,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:45,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005306, now seen corresponding path program 113 times [2018-09-26 08:24:45,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:46,595 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:46,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:24:46,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:24:46,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:24:46,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:24:46,597 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2018-09-26 08:24:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:46,764 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-09-26 08:24:46,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:24:46,765 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2018-09-26 08:24:46,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:46,765 INFO L225 Difference]: With dead ends: 120 [2018-09-26 08:24:46,765 INFO L226 Difference]: Without dead ends: 118 [2018-09-26 08:24:46,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:24:46,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-26 08:24:46,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-09-26 08:24:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-26 08:24:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-09-26 08:24:46,770 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-09-26 08:24:46,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:46,771 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-09-26 08:24:46,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:24:46,771 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-09-26 08:24:46,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-26 08:24:46,772 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:46,772 INFO L375 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2018-09-26 08:24:46,772 INFO L423 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:46,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:46,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439200, now seen corresponding path program 114 times [2018-09-26 08:24:46,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:47,443 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:47,443 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:24:47,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:24:47,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:24:47,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:24:47,446 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2018-09-26 08:24:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:47,610 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-09-26 08:24:47,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:24:47,610 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2018-09-26 08:24:47,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:47,611 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:24:47,611 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:24:47,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:24:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:24:47,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-26 08:24:47,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:24:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-09-26 08:24:47,616 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2018-09-26 08:24:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:47,616 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-09-26 08:24:47,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:24:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-09-26 08:24:47,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:24:47,617 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:47,617 INFO L375 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2018-09-26 08:24:47,617 INFO L423 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:47,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:47,618 INFO L82 PathProgramCache]: Analyzing trace with hash 954069190, now seen corresponding path program 115 times [2018-09-26 08:24:47,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:48,135 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:48,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:24:48,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:24:48,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:24:48,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:24:48,137 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2018-09-26 08:24:48,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:48,255 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-09-26 08:24:48,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:24:48,255 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2018-09-26 08:24:48,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:48,256 INFO L225 Difference]: With dead ends: 122 [2018-09-26 08:24:48,256 INFO L226 Difference]: Without dead ends: 120 [2018-09-26 08:24:48,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:24:48,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-09-26 08:24:48,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-09-26 08:24:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-09-26 08:24:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-09-26 08:24:48,260 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2018-09-26 08:24:48,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:48,261 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-09-26 08:24:48,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:24:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-09-26 08:24:48,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-09-26 08:24:48,261 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:48,262 INFO L375 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2018-09-26 08:24:48,262 INFO L423 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:48,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:48,262 INFO L82 PathProgramCache]: Analyzing trace with hash -488630048, now seen corresponding path program 116 times [2018-09-26 08:24:48,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:48,977 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:48,977 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-09-26 08:24:48,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-09-26 08:24:48,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-09-26 08:24:48,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:24:48,979 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2018-09-26 08:24:49,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:49,097 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-26 08:24:49,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:24:49,097 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2018-09-26 08:24:49,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:49,098 INFO L225 Difference]: With dead ends: 123 [2018-09-26 08:24:49,098 INFO L226 Difference]: Without dead ends: 121 [2018-09-26 08:24:49,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:24:49,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-26 08:24:49,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-09-26 08:24:49,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:24:49,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-26 08:24:49,103 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2018-09-26 08:24:49,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:49,103 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-26 08:24:49,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-09-26 08:24:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-26 08:24:49,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:24:49,104 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:49,104 INFO L375 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2018-09-26 08:24:49,104 INFO L423 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:49,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:49,105 INFO L82 PathProgramCache]: Analyzing trace with hash 2032333830, now seen corresponding path program 117 times [2018-09-26 08:24:49,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:49,682 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:49,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-09-26 08:24:49,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:24:49,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:24:49,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:24:49,684 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 120 states. [2018-09-26 08:24:49,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:49,845 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-09-26 08:24:49,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:24:49,845 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2018-09-26 08:24:49,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:49,846 INFO L225 Difference]: With dead ends: 124 [2018-09-26 08:24:49,846 INFO L226 Difference]: Without dead ends: 122 [2018-09-26 08:24:49,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:24:49,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-26 08:24:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-09-26 08:24:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-09-26 08:24:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-09-26 08:24:49,850 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2018-09-26 08:24:49,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:49,851 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-09-26 08:24:49,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:24:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-09-26 08:24:49,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-26 08:24:49,851 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:49,852 INFO L375 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2018-09-26 08:24:49,852 INFO L423 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:49,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:49,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1422164576, now seen corresponding path program 118 times [2018-09-26 08:24:49,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:50,430 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:50,430 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-09-26 08:24:50,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-09-26 08:24:50,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-09-26 08:24:50,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:24:50,433 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 121 states. [2018-09-26 08:24:50,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:50,569 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-09-26 08:24:50,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-09-26 08:24:50,569 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 121 [2018-09-26 08:24:50,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:50,570 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:24:50,570 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:24:50,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:24:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:24:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-26 08:24:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:24:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-09-26 08:24:50,575 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2018-09-26 08:24:50,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:50,575 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-09-26 08:24:50,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-09-26 08:24:50,576 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-09-26 08:24:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:24:50,576 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:50,576 INFO L375 BasicCegarLoop]: trace histogram [119, 1, 1, 1] [2018-09-26 08:24:50,576 INFO L423 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:50,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:50,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1137432762, now seen corresponding path program 119 times [2018-09-26 08:24:50,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:51,331 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:51,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-09-26 08:24:51,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 08:24:51,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 08:24:51,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:24:51,333 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 122 states. [2018-09-26 08:24:51,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:51,412 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-09-26 08:24:51,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:24:51,413 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 122 [2018-09-26 08:24:51,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:51,413 INFO L225 Difference]: With dead ends: 126 [2018-09-26 08:24:51,413 INFO L226 Difference]: Without dead ends: 124 [2018-09-26 08:24:51,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:24:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-26 08:24:51,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-09-26 08:24:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-09-26 08:24:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-09-26 08:24:51,417 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2018-09-26 08:24:51,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:51,417 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-09-26 08:24:51,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 08:24:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-09-26 08:24:51,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-26 08:24:51,418 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:51,418 INFO L375 BasicCegarLoop]: trace histogram [120, 1, 1, 1] [2018-09-26 08:24:51,418 INFO L423 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:51,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:51,418 INFO L82 PathProgramCache]: Analyzing trace with hash -900681120, now seen corresponding path program 120 times [2018-09-26 08:24:51,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:51,977 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:51,978 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-09-26 08:24:51,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-09-26 08:24:51,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-09-26 08:24:51,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:24:51,980 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 123 states. [2018-09-26 08:24:52,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:52,135 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-26 08:24:52,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 08:24:52,135 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 123 [2018-09-26 08:24:52,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:52,135 INFO L225 Difference]: With dead ends: 127 [2018-09-26 08:24:52,135 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 08:24:52,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:24:52,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 08:24:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-09-26 08:24:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:24:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-26 08:24:52,140 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 123 [2018-09-26 08:24:52,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:52,140 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-26 08:24:52,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-09-26 08:24:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-26 08:24:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:24:52,141 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:52,141 INFO L375 BasicCegarLoop]: trace histogram [121, 1, 1, 1] [2018-09-26 08:24:52,141 INFO L423 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:52,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:52,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2143652486, now seen corresponding path program 121 times [2018-09-26 08:24:52,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:52,822 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:52,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-09-26 08:24:52,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 08:24:52,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 08:24:52,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:24:52,825 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 124 states. [2018-09-26 08:24:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:52,936 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-09-26 08:24:52,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-09-26 08:24:52,936 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 124 [2018-09-26 08:24:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:52,937 INFO L225 Difference]: With dead ends: 128 [2018-09-26 08:24:52,937 INFO L226 Difference]: Without dead ends: 126 [2018-09-26 08:24:52,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:24:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-26 08:24:52,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-09-26 08:24:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-09-26 08:24:52,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-09-26 08:24:52,942 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 124 [2018-09-26 08:24:52,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:52,943 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-09-26 08:24:52,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 08:24:52,943 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-09-26 08:24:52,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-26 08:24:52,944 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:52,944 INFO L375 BasicCegarLoop]: trace histogram [122, 1, 1, 1] [2018-09-26 08:24:52,944 INFO L423 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:52,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:52,944 INFO L82 PathProgramCache]: Analyzing trace with hash 2028713760, now seen corresponding path program 122 times [2018-09-26 08:24:52,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:53,587 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:53,588 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-09-26 08:24:53,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-09-26 08:24:53,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-09-26 08:24:53,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:24:53,590 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 125 states. [2018-09-26 08:24:53,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:53,769 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-09-26 08:24:53,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:24:53,769 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 125 [2018-09-26 08:24:53,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:53,770 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:24:53,770 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:24:53,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:24:53,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:24:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-26 08:24:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:24:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-09-26 08:24:53,774 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 125 [2018-09-26 08:24:53,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:53,774 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-09-26 08:24:53,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-09-26 08:24:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-09-26 08:24:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:24:53,775 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:53,775 INFO L375 BasicCegarLoop]: trace histogram [123, 1, 1, 1] [2018-09-26 08:24:53,775 INFO L423 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:53,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:53,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1534386746, now seen corresponding path program 123 times [2018-09-26 08:24:53,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:54,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:54,370 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:54,370 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-09-26 08:24:54,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 08:24:54,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 08:24:54,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:24:54,373 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 126 states. [2018-09-26 08:24:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:54,483 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-09-26 08:24:54,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-26 08:24:54,484 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 126 [2018-09-26 08:24:54,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:54,484 INFO L225 Difference]: With dead ends: 130 [2018-09-26 08:24:54,484 INFO L226 Difference]: Without dead ends: 128 [2018-09-26 08:24:54,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:24:54,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-09-26 08:24:54,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-09-26 08:24:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-09-26 08:24:54,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-09-26 08:24:54,488 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 126 [2018-09-26 08:24:54,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:54,489 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-09-26 08:24:54,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 08:24:54,489 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-09-26 08:24:54,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-09-26 08:24:54,489 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:54,489 INFO L375 BasicCegarLoop]: trace histogram [124, 1, 1, 1] [2018-09-26 08:24:54,490 INFO L423 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:54,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:54,490 INFO L82 PathProgramCache]: Analyzing trace with hash -321352736, now seen corresponding path program 124 times [2018-09-26 08:24:54,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:55,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:55,051 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:55,051 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-09-26 08:24:55,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-09-26 08:24:55,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-09-26 08:24:55,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:24:55,053 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 127 states. [2018-09-26 08:24:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:55,265 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-26 08:24:55,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-09-26 08:24:55,265 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 127 [2018-09-26 08:24:55,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:55,265 INFO L225 Difference]: With dead ends: 131 [2018-09-26 08:24:55,266 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 08:24:55,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:24:55,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 08:24:55,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-26 08:24:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:24:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-26 08:24:55,270 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 127 [2018-09-26 08:24:55,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:55,270 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-26 08:24:55,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-09-26 08:24:55,271 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-26 08:24:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:24:55,271 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:55,271 INFO L375 BasicCegarLoop]: trace histogram [125, 1, 1, 1] [2018-09-26 08:24:55,271 INFO L423 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:55,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:55,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1372004090, now seen corresponding path program 125 times [2018-09-26 08:24:55,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:55,894 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:55,895 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-09-26 08:24:55,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 08:24:55,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 08:24:55,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:24:55,897 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 128 states. [2018-09-26 08:24:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:56,004 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-09-26 08:24:56,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:24:56,004 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 128 [2018-09-26 08:24:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:56,004 INFO L225 Difference]: With dead ends: 132 [2018-09-26 08:24:56,005 INFO L226 Difference]: Without dead ends: 130 [2018-09-26 08:24:56,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:24:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-26 08:24:56,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-09-26 08:24:56,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-09-26 08:24:56,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-09-26 08:24:56,010 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 128 [2018-09-26 08:24:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:56,010 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-09-26 08:24:56,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 08:24:56,010 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-09-26 08:24:56,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-26 08:24:56,011 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:56,011 INFO L375 BasicCegarLoop]: trace histogram [126, 1, 1, 1] [2018-09-26 08:24:56,011 INFO L423 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:56,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:56,012 INFO L82 PathProgramCache]: Analyzing trace with hash 417542304, now seen corresponding path program 126 times [2018-09-26 08:24:56,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:56,639 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:56,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-09-26 08:24:56,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-09-26 08:24:56,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-09-26 08:24:56,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:24:56,642 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 129 states. [2018-09-26 08:24:56,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:56,903 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-09-26 08:24:56,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-09-26 08:24:56,903 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 129 [2018-09-26 08:24:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:56,904 INFO L225 Difference]: With dead ends: 133 [2018-09-26 08:24:56,904 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:24:56,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:24:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:24:56,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-26 08:24:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:24:56,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-26 08:24:56,909 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 129 [2018-09-26 08:24:56,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:56,909 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-26 08:24:56,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-09-26 08:24:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-26 08:24:56,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:24:56,910 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:56,910 INFO L375 BasicCegarLoop]: trace histogram [127, 1, 1, 1] [2018-09-26 08:24:56,911 INFO L423 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:56,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:56,911 INFO L82 PathProgramCache]: Analyzing trace with hash 58905670, now seen corresponding path program 127 times [2018-09-26 08:24:56,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:57,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:57,525 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:57,525 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-09-26 08:24:57,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 08:24:57,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 08:24:57,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:24:57,529 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 130 states. [2018-09-26 08:24:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:57,625 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-09-26 08:24:57,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:24:57,625 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 130 [2018-09-26 08:24:57,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:57,626 INFO L225 Difference]: With dead ends: 134 [2018-09-26 08:24:57,626 INFO L226 Difference]: Without dead ends: 132 [2018-09-26 08:24:57,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:24:57,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-09-26 08:24:57,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-09-26 08:24:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-09-26 08:24:57,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-09-26 08:24:57,630 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 130 [2018-09-26 08:24:57,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:57,631 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-09-26 08:24:57,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 08:24:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-09-26 08:24:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-26 08:24:57,632 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:57,632 INFO L375 BasicCegarLoop]: trace histogram [128, 1, 1, 1] [2018-09-26 08:24:57,632 INFO L423 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:57,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:57,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1826071904, now seen corresponding path program 128 times [2018-09-26 08:24:57,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:58,296 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:58,296 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:58,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-09-26 08:24:58,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-09-26 08:24:58,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-09-26 08:24:58,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:24:58,299 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 131 states. [2018-09-26 08:24:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:58,485 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-26 08:24:58,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 08:24:58,485 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 131 [2018-09-26 08:24:58,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:58,486 INFO L225 Difference]: With dead ends: 135 [2018-09-26 08:24:58,486 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 08:24:58,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:24:58,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 08:24:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-26 08:24:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:24:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-26 08:24:58,490 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 131 [2018-09-26 08:24:58,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:58,490 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-26 08:24:58,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-09-26 08:24:58,490 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-26 08:24:58,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:24:58,491 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:58,491 INFO L375 BasicCegarLoop]: trace histogram [129, 1, 1, 1] [2018-09-26 08:24:58,491 INFO L423 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:58,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:58,491 INFO L82 PathProgramCache]: Analyzing trace with hash 773650310, now seen corresponding path program 129 times [2018-09-26 08:24:58,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:59,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:59,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-09-26 08:24:59,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 08:24:59,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 08:24:59,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:24:59,081 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 132 states. [2018-09-26 08:24:59,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:59,255 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-09-26 08:24:59,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:24:59,255 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 132 [2018-09-26 08:24:59,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:59,255 INFO L225 Difference]: With dead ends: 136 [2018-09-26 08:24:59,255 INFO L226 Difference]: Without dead ends: 134 [2018-09-26 08:24:59,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:24:59,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-26 08:24:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-09-26 08:24:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-26 08:24:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-09-26 08:24:59,258 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 132 [2018-09-26 08:24:59,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:59,258 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-09-26 08:24:59,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 08:24:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-09-26 08:24:59,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-26 08:24:59,259 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:59,259 INFO L375 BasicCegarLoop]: trace histogram [130, 1, 1, 1] [2018-09-26 08:24:59,259 INFO L423 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:59,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:59,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1786648032, now seen corresponding path program 130 times [2018-09-26 08:24:59,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:59,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:59,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-09-26 08:24:59,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-09-26 08:24:59,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-09-26 08:24:59,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:24:59,956 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 133 states. [2018-09-26 08:25:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:00,090 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-09-26 08:25:00,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-09-26 08:25:00,090 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 133 [2018-09-26 08:25:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:00,091 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:25:00,091 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:25:00,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:25:00,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:25:00,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-26 08:25:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:25:00,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-09-26 08:25:00,095 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 133 [2018-09-26 08:25:00,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:00,095 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-09-26 08:25:00,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-09-26 08:25:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-09-26 08:25:00,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:25:00,096 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:00,096 INFO L375 BasicCegarLoop]: trace histogram [131, 1, 1, 1] [2018-09-26 08:25:00,096 INFO L423 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:00,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:00,097 INFO L82 PathProgramCache]: Analyzing trace with hash 448481990, now seen corresponding path program 131 times [2018-09-26 08:25:00,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:00,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:00,660 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:00,661 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-09-26 08:25:00,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 08:25:00,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 08:25:00,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:25:00,663 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 134 states. [2018-09-26 08:25:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:00,839 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-09-26 08:25:00,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:25:00,840 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 134 [2018-09-26 08:25:00,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:00,840 INFO L225 Difference]: With dead ends: 138 [2018-09-26 08:25:00,840 INFO L226 Difference]: Without dead ends: 136 [2018-09-26 08:25:00,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:25:00,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-26 08:25:00,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-09-26 08:25:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-26 08:25:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-09-26 08:25:00,845 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 134 [2018-09-26 08:25:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:00,846 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-09-26 08:25:00,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 08:25:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-09-26 08:25:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-26 08:25:00,847 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:00,847 INFO L375 BasicCegarLoop]: trace histogram [132, 1, 1, 1] [2018-09-26 08:25:00,847 INFO L423 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:00,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:00,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1018035936, now seen corresponding path program 132 times [2018-09-26 08:25:00,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:01,529 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:01,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-09-26 08:25:01,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-09-26 08:25:01,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-09-26 08:25:01,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:25:01,531 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 135 states. [2018-09-26 08:25:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:01,709 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-26 08:25:01,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-09-26 08:25:01,709 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 135 [2018-09-26 08:25:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:01,709 INFO L225 Difference]: With dead ends: 139 [2018-09-26 08:25:01,710 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:25:01,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:25:01,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:25:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-09-26 08:25:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:25:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-26 08:25:01,714 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 135 [2018-09-26 08:25:01,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:01,714 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-26 08:25:01,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-09-26 08:25:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-26 08:25:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:25:01,715 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:01,715 INFO L375 BasicCegarLoop]: trace histogram [133, 1, 1, 1] [2018-09-26 08:25:01,716 INFO L423 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:01,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:01,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1494339078, now seen corresponding path program 133 times [2018-09-26 08:25:01,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:02,384 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:02,384 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-09-26 08:25:02,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 08:25:02,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 08:25:02,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:25:02,387 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 136 states. [2018-09-26 08:25:02,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:02,552 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-09-26 08:25:02,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-09-26 08:25:02,552 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 136 [2018-09-26 08:25:02,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:02,553 INFO L225 Difference]: With dead ends: 140 [2018-09-26 08:25:02,553 INFO L226 Difference]: Without dead ends: 138 [2018-09-26 08:25:02,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:25:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-26 08:25:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-09-26 08:25:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-09-26 08:25:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-09-26 08:25:02,558 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 136 [2018-09-26 08:25:02,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:02,558 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-09-26 08:25:02,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 08:25:02,559 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-09-26 08:25:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-26 08:25:02,559 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:02,559 INFO L375 BasicCegarLoop]: trace histogram [134, 1, 1, 1] [2018-09-26 08:25:02,559 INFO L423 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:02,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:02,560 INFO L82 PathProgramCache]: Analyzing trace with hash -920132704, now seen corresponding path program 134 times [2018-09-26 08:25:02,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:03,306 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:03,307 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:03,307 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-09-26 08:25:03,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-09-26 08:25:03,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-09-26 08:25:03,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:25:03,309 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 137 states. [2018-09-26 08:25:03,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:03,542 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-09-26 08:25:03,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-26 08:25:03,542 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 137 [2018-09-26 08:25:03,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:03,543 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:25:03,543 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:25:03,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:25:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:25:03,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-26 08:25:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:25:03,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-09-26 08:25:03,547 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 137 [2018-09-26 08:25:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:03,547 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-09-26 08:25:03,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-09-26 08:25:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-09-26 08:25:03,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:25:03,547 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:03,548 INFO L375 BasicCegarLoop]: trace histogram [135, 1, 1, 1] [2018-09-26 08:25:03,548 INFO L423 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:03,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:03,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1540653382, now seen corresponding path program 135 times [2018-09-26 08:25:03,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:04,266 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:04,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-09-26 08:25:04,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-26 08:25:04,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-26 08:25:04,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:25:04,269 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 138 states. [2018-09-26 08:25:04,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:04,507 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-09-26 08:25:04,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-09-26 08:25:04,507 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 138 [2018-09-26 08:25:04,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:04,507 INFO L225 Difference]: With dead ends: 142 [2018-09-26 08:25:04,508 INFO L226 Difference]: Without dead ends: 140 [2018-09-26 08:25:04,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:25:04,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-09-26 08:25:04,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-09-26 08:25:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-09-26 08:25:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-09-26 08:25:04,512 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 138 [2018-09-26 08:25:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:04,513 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-09-26 08:25:04,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-26 08:25:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-09-26 08:25:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-26 08:25:04,513 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:04,514 INFO L375 BasicCegarLoop]: trace histogram [136, 1, 1, 1] [2018-09-26 08:25:04,514 INFO L423 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:04,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:04,514 INFO L82 PathProgramCache]: Analyzing trace with hash 515610720, now seen corresponding path program 136 times [2018-09-26 08:25:04,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:05,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:05,213 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:05,213 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-09-26 08:25:05,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-09-26 08:25:05,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-09-26 08:25:05,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:25:05,216 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 139 states. [2018-09-26 08:25:05,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:05,333 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-26 08:25:05,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-09-26 08:25:05,333 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 139 [2018-09-26 08:25:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:05,333 INFO L225 Difference]: With dead ends: 143 [2018-09-26 08:25:05,333 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 08:25:05,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:25:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 08:25:05,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-26 08:25:05,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:25:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-26 08:25:05,337 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 139 [2018-09-26 08:25:05,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:05,337 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-26 08:25:05,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-09-26 08:25:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-26 08:25:05,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:25:05,338 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:05,338 INFO L375 BasicCegarLoop]: trace histogram [137, 1, 1, 1] [2018-09-26 08:25:05,338 INFO L423 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:05,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:05,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1195940730, now seen corresponding path program 137 times [2018-09-26 08:25:05,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:06,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:06,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-09-26 08:25:06,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-26 08:25:06,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-26 08:25:06,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:25:06,081 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 140 states. [2018-09-26 08:25:06,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:06,330 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-09-26 08:25:06,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-09-26 08:25:06,330 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 140 [2018-09-26 08:25:06,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:06,331 INFO L225 Difference]: With dead ends: 144 [2018-09-26 08:25:06,331 INFO L226 Difference]: Without dead ends: 142 [2018-09-26 08:25:06,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:25:06,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-26 08:25:06,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-09-26 08:25:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-26 08:25:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-09-26 08:25:06,334 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 140 [2018-09-26 08:25:06,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:06,334 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-09-26 08:25:06,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-26 08:25:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-09-26 08:25:06,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-26 08:25:06,335 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:06,335 INFO L375 BasicCegarLoop]: trace histogram [138, 1, 1, 1] [2018-09-26 08:25:06,335 INFO L423 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:06,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:06,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1580539168, now seen corresponding path program 138 times [2018-09-26 08:25:06,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:07,111 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:07,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-09-26 08:25:07,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-09-26 08:25:07,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-09-26 08:25:07,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:25:07,113 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 141 states. [2018-09-26 08:25:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:07,327 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-09-26 08:25:07,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-09-26 08:25:07,327 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 141 [2018-09-26 08:25:07,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:07,328 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:25:07,328 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:25:07,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:25:07,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:25:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-26 08:25:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:25:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-09-26 08:25:07,331 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 141 [2018-09-26 08:25:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:07,332 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-09-26 08:25:07,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-09-26 08:25:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-09-26 08:25:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:25:07,332 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:07,333 INFO L375 BasicCegarLoop]: trace histogram [139, 1, 1, 1] [2018-09-26 08:25:07,333 INFO L423 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:07,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:07,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1752070086, now seen corresponding path program 139 times [2018-09-26 08:25:07,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:08,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:08,046 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:08,046 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-09-26 08:25:08,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-26 08:25:08,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-26 08:25:08,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:25:08,048 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 142 states. [2018-09-26 08:25:08,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:08,334 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-09-26 08:25:08,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-09-26 08:25:08,334 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 142 [2018-09-26 08:25:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:08,335 INFO L225 Difference]: With dead ends: 146 [2018-09-26 08:25:08,335 INFO L226 Difference]: Without dead ends: 144 [2018-09-26 08:25:08,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:25:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-26 08:25:08,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-09-26 08:25:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-09-26 08:25:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-09-26 08:25:08,339 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 142 [2018-09-26 08:25:08,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:08,339 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-09-26 08:25:08,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-26 08:25:08,339 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-09-26 08:25:08,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-09-26 08:25:08,340 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:08,340 INFO L375 BasicCegarLoop]: trace histogram [140, 1, 1, 1] [2018-09-26 08:25:08,340 INFO L423 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:08,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:08,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1520406048, now seen corresponding path program 140 times [2018-09-26 08:25:08,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:09,029 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:09,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-09-26 08:25:09,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-09-26 08:25:09,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-09-26 08:25:09,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:25:09,032 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 143 states. [2018-09-26 08:25:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:09,267 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-26 08:25:09,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-09-26 08:25:09,267 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 143 [2018-09-26 08:25:09,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:09,268 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:25:09,268 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:25:09,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:25:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:25:09,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-09-26 08:25:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:25:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-26 08:25:09,271 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 143 [2018-09-26 08:25:09,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:09,272 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-26 08:25:09,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-09-26 08:25:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-26 08:25:09,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:25:09,272 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:09,272 INFO L375 BasicCegarLoop]: trace histogram [141, 1, 1, 1] [2018-09-26 08:25:09,273 INFO L423 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:09,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:09,273 INFO L82 PathProgramCache]: Analyzing trace with hash 112048902, now seen corresponding path program 141 times [2018-09-26 08:25:09,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:10,099 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:10,100 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-09-26 08:25:10,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-26 08:25:10,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-26 08:25:10,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:25:10,104 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 144 states. [2018-09-26 08:25:10,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:10,243 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-09-26 08:25:10,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-09-26 08:25:10,243 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 144 [2018-09-26 08:25:10,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:10,244 INFO L225 Difference]: With dead ends: 148 [2018-09-26 08:25:10,244 INFO L226 Difference]: Without dead ends: 146 [2018-09-26 08:25:10,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:25:10,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-26 08:25:10,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-09-26 08:25:10,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-26 08:25:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-09-26 08:25:10,248 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 144 [2018-09-26 08:25:10,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:10,248 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-09-26 08:25:10,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-26 08:25:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-09-26 08:25:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-26 08:25:10,249 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:10,249 INFO L375 BasicCegarLoop]: trace histogram [142, 1, 1, 1] [2018-09-26 08:25:10,249 INFO L423 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:10,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:10,249 INFO L82 PathProgramCache]: Analyzing trace with hash -821455200, now seen corresponding path program 142 times [2018-09-26 08:25:10,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:11,053 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:11,053 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-09-26 08:25:11,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-09-26 08:25:11,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-09-26 08:25:11,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:25:11,056 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 145 states. [2018-09-26 08:25:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:11,223 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-09-26 08:25:11,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-26 08:25:11,223 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 145 [2018-09-26 08:25:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:11,224 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:25:11,224 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:25:11,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:25:11,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:25:11,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-26 08:25:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:25:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-09-26 08:25:11,228 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 145 [2018-09-26 08:25:11,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:11,229 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-09-26 08:25:11,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-09-26 08:25:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-09-26 08:25:11,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:25:11,229 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:11,229 INFO L375 BasicCegarLoop]: trace histogram [143, 1, 1, 1] [2018-09-26 08:25:11,229 INFO L423 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:11,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:11,230 INFO L82 PathProgramCache]: Analyzing trace with hash 304688710, now seen corresponding path program 143 times [2018-09-26 08:25:11,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:11,997 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:11,997 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-09-26 08:25:11,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-26 08:25:11,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-26 08:25:12,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:25:12,000 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 146 states. [2018-09-26 08:25:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:12,310 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-09-26 08:25:12,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-26 08:25:12,310 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 146 [2018-09-26 08:25:12,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:12,311 INFO L225 Difference]: With dead ends: 150 [2018-09-26 08:25:12,311 INFO L226 Difference]: Without dead ends: 148 [2018-09-26 08:25:12,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:25:12,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-26 08:25:12,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-09-26 08:25:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-09-26 08:25:12,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-09-26 08:25:12,316 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 146 [2018-09-26 08:25:12,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:12,316 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-09-26 08:25:12,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-26 08:25:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-09-26 08:25:12,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-26 08:25:12,316 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:12,317 INFO L375 BasicCegarLoop]: trace histogram [144, 1, 1, 1] [2018-09-26 08:25:12,317 INFO L423 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:12,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:12,317 INFO L82 PathProgramCache]: Analyzing trace with hash 855411552, now seen corresponding path program 144 times [2018-09-26 08:25:12,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:13,124 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:13,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-09-26 08:25:13,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-09-26 08:25:13,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-09-26 08:25:13,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:25:13,127 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 147 states. [2018-09-26 08:25:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:13,478 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-26 08:25:13,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-09-26 08:25:13,478 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 147 [2018-09-26 08:25:13,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:13,479 INFO L225 Difference]: With dead ends: 151 [2018-09-26 08:25:13,479 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:25:13,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:25:13,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:25:13,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-09-26 08:25:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:25:13,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-26 08:25:13,483 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 147 [2018-09-26 08:25:13,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:13,483 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-26 08:25:13,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-09-26 08:25:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-26 08:25:13,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:25:13,483 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:13,484 INFO L375 BasicCegarLoop]: trace histogram [145, 1, 1, 1] [2018-09-26 08:25:13,484 INFO L423 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:13,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:13,484 INFO L82 PathProgramCache]: Analyzing trace with hash 747950470, now seen corresponding path program 145 times [2018-09-26 08:25:13,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:14,426 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:14,427 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-09-26 08:25:14,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-26 08:25:14,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-26 08:25:14,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:25:14,430 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 148 states. [2018-09-26 08:25:14,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:14,761 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-09-26 08:25:14,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-09-26 08:25:14,762 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 148 [2018-09-26 08:25:14,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:14,762 INFO L225 Difference]: With dead ends: 152 [2018-09-26 08:25:14,762 INFO L226 Difference]: Without dead ends: 150 [2018-09-26 08:25:14,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:25:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-26 08:25:14,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-09-26 08:25:14,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-09-26 08:25:14,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-09-26 08:25:14,765 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 148 [2018-09-26 08:25:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:14,765 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-09-26 08:25:14,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-26 08:25:14,766 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-09-26 08:25:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-26 08:25:14,766 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:14,766 INFO L375 BasicCegarLoop]: trace histogram [146, 1, 1, 1] [2018-09-26 08:25:14,767 INFO L423 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:14,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:14,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1711624224, now seen corresponding path program 146 times [2018-09-26 08:25:14,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:15,474 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:15,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-09-26 08:25:15,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-09-26 08:25:15,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-09-26 08:25:15,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:25:15,477 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 149 states. [2018-09-26 08:25:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:15,767 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-09-26 08:25:15,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-09-26 08:25:15,767 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 149 [2018-09-26 08:25:15,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:15,768 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:25:15,768 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:25:15,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:25:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:25:15,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-09-26 08:25:15,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:25:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-26 08:25:15,772 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 149 [2018-09-26 08:25:15,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:15,773 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-26 08:25:15,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-09-26 08:25:15,773 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-26 08:25:15,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:25:15,774 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:15,774 INFO L375 BasicCegarLoop]: trace histogram [147, 1, 1, 1] [2018-09-26 08:25:15,774 INFO L423 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:15,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:15,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1520739526, now seen corresponding path program 147 times [2018-09-26 08:25:15,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:16,530 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:16,530 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-09-26 08:25:16,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-26 08:25:16,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-26 08:25:16,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:25:16,532 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 150 states. [2018-09-26 08:25:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:16,891 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-09-26 08:25:16,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-09-26 08:25:16,891 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 150 [2018-09-26 08:25:16,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:16,891 INFO L225 Difference]: With dead ends: 154 [2018-09-26 08:25:16,891 INFO L226 Difference]: Without dead ends: 152 [2018-09-26 08:25:16,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:25:16,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-09-26 08:25:16,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-09-26 08:25:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-09-26 08:25:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-09-26 08:25:16,895 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 150 [2018-09-26 08:25:16,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:16,896 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-09-26 08:25:16,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-26 08:25:16,896 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-09-26 08:25:16,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-26 08:25:16,897 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:16,897 INFO L375 BasicCegarLoop]: trace histogram [148, 1, 1, 1] [2018-09-26 08:25:16,897 INFO L423 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:16,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:16,897 INFO L82 PathProgramCache]: Analyzing trace with hash -101718816, now seen corresponding path program 148 times [2018-09-26 08:25:16,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:17,745 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:17,745 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-09-26 08:25:17,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-09-26 08:25:17,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-09-26 08:25:17,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:25:17,748 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 151 states. [2018-09-26 08:25:18,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:18,086 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-26 08:25:18,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-09-26 08:25:18,086 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 151 [2018-09-26 08:25:18,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:18,087 INFO L225 Difference]: With dead ends: 155 [2018-09-26 08:25:18,087 INFO L226 Difference]: Without dead ends: 153 [2018-09-26 08:25:18,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:25:18,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-26 08:25:18,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-09-26 08:25:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:25:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-26 08:25:18,091 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 151 [2018-09-26 08:25:18,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:18,092 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-26 08:25:18,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-09-26 08:25:18,092 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-26 08:25:18,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:25:18,092 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:18,093 INFO L375 BasicCegarLoop]: trace histogram [149, 1, 1, 1] [2018-09-26 08:25:18,093 INFO L423 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:18,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:18,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1141680134, now seen corresponding path program 149 times [2018-09-26 08:25:18,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:18,856 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:18,856 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-09-26 08:25:18,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-26 08:25:18,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-26 08:25:18,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:25:18,859 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 152 states. [2018-09-26 08:25:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:19,185 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-09-26 08:25:19,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 08:25:19,185 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 152 [2018-09-26 08:25:19,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:19,186 INFO L225 Difference]: With dead ends: 156 [2018-09-26 08:25:19,186 INFO L226 Difference]: Without dead ends: 154 [2018-09-26 08:25:19,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:25:19,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-26 08:25:19,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-09-26 08:25:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-09-26 08:25:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-09-26 08:25:19,189 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 152 [2018-09-26 08:25:19,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:19,190 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-09-26 08:25:19,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-26 08:25:19,190 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-09-26 08:25:19,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-09-26 08:25:19,190 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:19,190 INFO L375 BasicCegarLoop]: trace histogram [150, 1, 1, 1] [2018-09-26 08:25:19,190 INFO L423 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:19,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:19,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1032341920, now seen corresponding path program 150 times [2018-09-26 08:25:19,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:19,980 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:19,981 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-09-26 08:25:19,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-09-26 08:25:19,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-09-26 08:25:19,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:25:19,984 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 153 states. [2018-09-26 08:25:20,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:20,371 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-09-26 08:25:20,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-09-26 08:25:20,372 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 153 [2018-09-26 08:25:20,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:20,372 INFO L225 Difference]: With dead ends: 157 [2018-09-26 08:25:20,372 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:25:20,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:25:20,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:25:20,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-09-26 08:25:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:25:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-09-26 08:25:20,376 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 153 [2018-09-26 08:25:20,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:20,376 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-09-26 08:25:20,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-09-26 08:25:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-09-26 08:25:20,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:25:20,377 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:20,377 INFO L375 BasicCegarLoop]: trace histogram [151, 1, 1, 1] [2018-09-26 08:25:20,377 INFO L423 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:20,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:20,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1937824582, now seen corresponding path program 151 times [2018-09-26 08:25:20,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:21,157 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:21,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-09-26 08:25:21,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-26 08:25:21,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-26 08:25:21,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:25:21,160 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 154 states. [2018-09-26 08:25:21,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:21,492 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-09-26 08:25:21,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-09-26 08:25:21,492 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 154 [2018-09-26 08:25:21,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:21,493 INFO L225 Difference]: With dead ends: 158 [2018-09-26 08:25:21,493 INFO L226 Difference]: Without dead ends: 156 [2018-09-26 08:25:21,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:25:21,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-09-26 08:25:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-09-26 08:25:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-26 08:25:21,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-09-26 08:25:21,496 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 154 [2018-09-26 08:25:21,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:21,496 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-09-26 08:25:21,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-26 08:25:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-09-26 08:25:21,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-26 08:25:21,497 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:21,497 INFO L375 BasicCegarLoop]: trace histogram [152, 1, 1, 1] [2018-09-26 08:25:21,497 INFO L423 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:21,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:21,497 INFO L82 PathProgramCache]: Analyzing trace with hash -56983968, now seen corresponding path program 152 times [2018-09-26 08:25:21,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:22,341 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:22,341 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:22,341 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-09-26 08:25:22,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-09-26 08:25:22,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-09-26 08:25:22,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:25:22,344 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 155 states. [2018-09-26 08:25:22,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:22,703 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-26 08:25:22,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-09-26 08:25:22,704 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 155 [2018-09-26 08:25:22,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:22,704 INFO L225 Difference]: With dead ends: 159 [2018-09-26 08:25:22,704 INFO L226 Difference]: Without dead ends: 157 [2018-09-26 08:25:22,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:25:22,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-26 08:25:22,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-09-26 08:25:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 08:25:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-26 08:25:22,708 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 155 [2018-09-26 08:25:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:22,708 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-26 08:25:22,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-09-26 08:25:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-26 08:25:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:25:22,709 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:22,709 INFO L375 BasicCegarLoop]: trace histogram [153, 1, 1, 1] [2018-09-26 08:25:22,710 INFO L423 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:22,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:22,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1766506874, now seen corresponding path program 153 times [2018-09-26 08:25:22,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:23,556 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:23,556 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:23,556 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-09-26 08:25:23,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-09-26 08:25:23,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-09-26 08:25:23,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:25:23,559 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 156 states. [2018-09-26 08:25:24,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:24,009 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-09-26 08:25:24,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-09-26 08:25:24,009 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 156 [2018-09-26 08:25:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:24,010 INFO L225 Difference]: With dead ends: 160 [2018-09-26 08:25:24,010 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 08:25:24,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:25:24,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 08:25:24,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-09-26 08:25:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-09-26 08:25:24,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-09-26 08:25:24,014 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 156 [2018-09-26 08:25:24,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:24,015 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-09-26 08:25:24,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-09-26 08:25:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-09-26 08:25:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-09-26 08:25:24,015 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:24,015 INFO L375 BasicCegarLoop]: trace histogram [154, 1, 1, 1] [2018-09-26 08:25:24,016 INFO L423 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:24,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:24,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1072857888, now seen corresponding path program 154 times [2018-09-26 08:25:24,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:24,930 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:24,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-09-26 08:25:24,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-09-26 08:25:24,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-09-26 08:25:24,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:25:24,934 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 157 states. [2018-09-26 08:25:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:25,347 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-09-26 08:25:25,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-09-26 08:25:25,347 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 157 [2018-09-26 08:25:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:25,348 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:25:25,348 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:25:25,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:25:25,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:25:25,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-09-26 08:25:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:25:25,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-09-26 08:25:25,353 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 157 [2018-09-26 08:25:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:25,353 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-09-26 08:25:25,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-09-26 08:25:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-09-26 08:25:25,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:25:25,353 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:25,353 INFO L375 BasicCegarLoop]: trace histogram [155, 1, 1, 1] [2018-09-26 08:25:25,354 INFO L423 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:25,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:25,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1101147706, now seen corresponding path program 155 times [2018-09-26 08:25:25,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:26,302 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:26,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-09-26 08:25:26,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-09-26 08:25:26,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-09-26 08:25:26,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:25:26,306 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 158 states. [2018-09-26 08:25:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:26,547 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-09-26 08:25:26,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-09-26 08:25:26,548 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 158 [2018-09-26 08:25:26,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:26,548 INFO L225 Difference]: With dead ends: 162 [2018-09-26 08:25:26,548 INFO L226 Difference]: Without dead ends: 160 [2018-09-26 08:25:26,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:25:26,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-26 08:25:26,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-09-26 08:25:26,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-09-26 08:25:26,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-09-26 08:25:26,553 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 158 [2018-09-26 08:25:26,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:26,553 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-09-26 08:25:26,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-09-26 08:25:26,553 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-09-26 08:25:26,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-26 08:25:26,554 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:26,554 INFO L375 BasicCegarLoop]: trace histogram [156, 1, 1, 1] [2018-09-26 08:25:26,554 INFO L423 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:26,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:26,554 INFO L82 PathProgramCache]: Analyzing trace with hash 224155616, now seen corresponding path program 156 times [2018-09-26 08:25:26,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:27,484 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:27,484 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:27,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-09-26 08:25:27,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-09-26 08:25:27,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-09-26 08:25:27,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:25:27,488 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 159 states. [2018-09-26 08:25:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:27,651 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-26 08:25:27,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-09-26 08:25:27,651 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 159 [2018-09-26 08:25:27,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:27,651 INFO L225 Difference]: With dead ends: 163 [2018-09-26 08:25:27,651 INFO L226 Difference]: Without dead ends: 161 [2018-09-26 08:25:27,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:25:27,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-09-26 08:25:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-09-26 08:25:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:25:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-26 08:25:27,655 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 159 [2018-09-26 08:25:27,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:27,655 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-26 08:25:27,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-09-26 08:25:27,656 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-26 08:25:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:25:27,656 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:27,656 INFO L375 BasicCegarLoop]: trace histogram [157, 1, 1, 1] [2018-09-26 08:25:27,656 INFO L423 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:27,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:27,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1641114362, now seen corresponding path program 157 times [2018-09-26 08:25:27,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:28,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:28,668 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:28,669 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-09-26 08:25:28,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-09-26 08:25:28,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-09-26 08:25:28,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:25:28,672 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 160 states. [2018-09-26 08:25:29,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:29,000 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-09-26 08:25:29,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-09-26 08:25:29,001 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 160 [2018-09-26 08:25:29,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:29,001 INFO L225 Difference]: With dead ends: 164 [2018-09-26 08:25:29,001 INFO L226 Difference]: Without dead ends: 162 [2018-09-26 08:25:29,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:25:29,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-26 08:25:29,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-09-26 08:25:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-26 08:25:29,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-09-26 08:25:29,006 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 160 [2018-09-26 08:25:29,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:29,006 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-09-26 08:25:29,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-09-26 08:25:29,006 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-09-26 08:25:29,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-09-26 08:25:29,007 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:29,007 INFO L375 BasicCegarLoop]: trace histogram [158, 1, 1, 1] [2018-09-26 08:25:29,007 INFO L423 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:29,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:29,007 INFO L82 PathProgramCache]: Analyzing trace with hash 665058464, now seen corresponding path program 158 times [2018-09-26 08:25:29,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:29,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:29,998 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:29,998 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-09-26 08:25:29,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-09-26 08:25:30,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-09-26 08:25:30,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:25:30,003 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 161 states. [2018-09-26 08:25:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:30,531 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-09-26 08:25:30,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-09-26 08:25:30,531 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 161 [2018-09-26 08:25:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:30,532 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:25:30,532 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:25:30,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:25:30,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:25:30,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-09-26 08:25:30,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:25:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-09-26 08:25:30,536 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 161 [2018-09-26 08:25:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:30,537 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-09-26 08:25:30,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-09-26 08:25:30,537 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-09-26 08:25:30,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:25:30,537 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:30,537 INFO L375 BasicCegarLoop]: trace histogram [159, 1, 1, 1] [2018-09-26 08:25:30,537 INFO L423 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:30,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:30,538 INFO L82 PathProgramCache]: Analyzing trace with hash -858027962, now seen corresponding path program 159 times [2018-09-26 08:25:30,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:31,431 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:31,431 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-09-26 08:25:31,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-09-26 08:25:31,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-09-26 08:25:31,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:25:31,434 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 162 states. [2018-09-26 08:25:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:31,841 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-09-26 08:25:31,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-09-26 08:25:31,842 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 162 [2018-09-26 08:25:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:31,842 INFO L225 Difference]: With dead ends: 166 [2018-09-26 08:25:31,842 INFO L226 Difference]: Without dead ends: 164 [2018-09-26 08:25:31,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:25:31,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-26 08:25:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-09-26 08:25:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-09-26 08:25:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-09-26 08:25:31,847 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 162 [2018-09-26 08:25:31,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:31,847 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-09-26 08:25:31,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-09-26 08:25:31,847 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-09-26 08:25:31,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-09-26 08:25:31,848 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:31,848 INFO L375 BasicCegarLoop]: trace histogram [160, 1, 1, 1] [2018-09-26 08:25:31,848 INFO L423 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:31,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:31,849 INFO L82 PathProgramCache]: Analyzing trace with hash -829066912, now seen corresponding path program 160 times [2018-09-26 08:25:31,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:32,986 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:32,986 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:32,986 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-09-26 08:25:32,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-09-26 08:25:32,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-09-26 08:25:32,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:25:32,989 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 163 states. [2018-09-26 08:25:33,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:33,375 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-26 08:25:33,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-09-26 08:25:33,375 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 163 [2018-09-26 08:25:33,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:33,376 INFO L225 Difference]: With dead ends: 167 [2018-09-26 08:25:33,376 INFO L226 Difference]: Without dead ends: 165 [2018-09-26 08:25:33,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:25:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-26 08:25:33,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-09-26 08:25:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 08:25:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-26 08:25:33,381 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 163 [2018-09-26 08:25:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:33,381 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-26 08:25:33,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-09-26 08:25:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-26 08:25:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 08:25:33,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:33,382 INFO L375 BasicCegarLoop]: trace histogram [161, 1, 1, 1] [2018-09-26 08:25:33,382 INFO L423 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:33,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:33,382 INFO L82 PathProgramCache]: Analyzing trace with hash 68725638, now seen corresponding path program 161 times [2018-09-26 08:25:33,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:34,271 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:34,271 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-09-26 08:25:34,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-09-26 08:25:34,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-09-26 08:25:34,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:25:34,274 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 164 states. [2018-09-26 08:25:34,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:34,414 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-09-26 08:25:34,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-09-26 08:25:34,414 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 164 [2018-09-26 08:25:34,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:34,415 INFO L225 Difference]: With dead ends: 168 [2018-09-26 08:25:34,415 INFO L226 Difference]: Without dead ends: 166 [2018-09-26 08:25:34,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:25:34,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-26 08:25:34,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-09-26 08:25:34,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-26 08:25:34,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-09-26 08:25:34,421 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 164 [2018-09-26 08:25:34,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:34,422 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-09-26 08:25:34,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-09-26 08:25:34,422 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-09-26 08:25:34,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-26 08:25:34,422 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:34,423 INFO L375 BasicCegarLoop]: trace histogram [162, 1, 1, 1] [2018-09-26 08:25:34,423 INFO L423 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:34,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:34,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2130490912, now seen corresponding path program 162 times [2018-09-26 08:25:34,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:35,608 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:35,608 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-09-26 08:25:35,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-09-26 08:25:35,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-09-26 08:25:35,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:25:35,610 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 165 states. [2018-09-26 08:25:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:35,957 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-09-26 08:25:35,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-09-26 08:25:35,958 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 165 [2018-09-26 08:25:35,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:35,958 INFO L225 Difference]: With dead ends: 169 [2018-09-26 08:25:35,958 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:25:35,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:25:35,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:25:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-26 08:25:35,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:25:35,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-09-26 08:25:35,961 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 165 [2018-09-26 08:25:35,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:35,962 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-09-26 08:25:35,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-09-26 08:25:35,962 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-09-26 08:25:35,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:25:35,962 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:35,962 INFO L375 BasicCegarLoop]: trace histogram [163, 1, 1, 1] [2018-09-26 08:25:35,962 INFO L423 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:35,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:35,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1620704966, now seen corresponding path program 163 times [2018-09-26 08:25:35,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:36,897 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:36,897 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-09-26 08:25:36,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-09-26 08:25:36,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-09-26 08:25:36,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:25:36,900 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 166 states. [2018-09-26 08:25:37,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:37,367 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-09-26 08:25:37,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-09-26 08:25:37,367 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 166 [2018-09-26 08:25:37,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:37,367 INFO L225 Difference]: With dead ends: 170 [2018-09-26 08:25:37,367 INFO L226 Difference]: Without dead ends: 168 [2018-09-26 08:25:37,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:25:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-09-26 08:25:37,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-09-26 08:25:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-26 08:25:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-09-26 08:25:37,371 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 166 [2018-09-26 08:25:37,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:37,371 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-09-26 08:25:37,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-09-26 08:25:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-09-26 08:25:37,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-09-26 08:25:37,372 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:37,372 INFO L375 BasicCegarLoop]: trace histogram [164, 1, 1, 1] [2018-09-26 08:25:37,372 INFO L423 AbstractCegarLoop]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:37,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:37,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1297757472, now seen corresponding path program 164 times [2018-09-26 08:25:37,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:38,319 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:38,319 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-09-26 08:25:38,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-09-26 08:25:38,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-09-26 08:25:38,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:25:38,323 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 167 states. [2018-09-26 08:25:38,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:38,642 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-26 08:25:38,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-09-26 08:25:38,642 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 167 [2018-09-26 08:25:38,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:38,643 INFO L225 Difference]: With dead ends: 171 [2018-09-26 08:25:38,643 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 08:25:38,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:25:38,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 08:25:38,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-09-26 08:25:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 08:25:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-26 08:25:38,648 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 167 [2018-09-26 08:25:38,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:38,649 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-26 08:25:38,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-09-26 08:25:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-26 08:25:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 08:25:38,649 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:38,650 INFO L375 BasicCegarLoop]: trace histogram [165, 1, 1, 1] [2018-09-26 08:25:38,650 INFO L423 AbstractCegarLoop]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:38,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:38,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1575779834, now seen corresponding path program 165 times [2018-09-26 08:25:38,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:39,643 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:39,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-09-26 08:25:39,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-09-26 08:25:39,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-09-26 08:25:39,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:25:39,646 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 168 states. [2018-09-26 08:25:39,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:39,867 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-09-26 08:25:39,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-09-26 08:25:39,867 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 168 [2018-09-26 08:25:39,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:39,868 INFO L225 Difference]: With dead ends: 172 [2018-09-26 08:25:39,868 INFO L226 Difference]: Without dead ends: 170 [2018-09-26 08:25:39,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:25:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-26 08:25:39,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-09-26 08:25:39,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-09-26 08:25:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-09-26 08:25:39,871 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 168 [2018-09-26 08:25:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:39,872 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-09-26 08:25:39,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-09-26 08:25:39,872 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-09-26 08:25:39,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-09-26 08:25:39,872 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:39,872 INFO L375 BasicCegarLoop]: trace histogram [166, 1, 1, 1] [2018-09-26 08:25:39,873 INFO L423 AbstractCegarLoop]: === Iteration 167 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:39,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:39,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1604538464, now seen corresponding path program 166 times [2018-09-26 08:25:39,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:40,785 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:40,785 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-09-26 08:25:40,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-09-26 08:25:40,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-09-26 08:25:40,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:25:40,788 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 169 states. [2018-09-26 08:25:41,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:41,327 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-09-26 08:25:41,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-09-26 08:25:41,327 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 169 [2018-09-26 08:25:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:41,328 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:25:41,328 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:25:41,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:25:41,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:25:41,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-09-26 08:25:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:25:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-09-26 08:25:41,332 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 169 [2018-09-26 08:25:41,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:41,332 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-09-26 08:25:41,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-09-26 08:25:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-09-26 08:25:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:25:41,333 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:41,333 INFO L375 BasicCegarLoop]: trace histogram [167, 1, 1, 1] [2018-09-26 08:25:41,333 INFO L423 AbstractCegarLoop]: === Iteration 168 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:41,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:41,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1798911302, now seen corresponding path program 167 times [2018-09-26 08:25:41,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:42,279 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:42,279 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-09-26 08:25:42,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-09-26 08:25:42,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-09-26 08:25:42,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:25:42,282 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 170 states. [2018-09-26 08:25:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:42,653 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-09-26 08:25:42,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-09-26 08:25:42,653 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 170 [2018-09-26 08:25:42,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:42,654 INFO L225 Difference]: With dead ends: 174 [2018-09-26 08:25:42,654 INFO L226 Difference]: Without dead ends: 172 [2018-09-26 08:25:42,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:25:42,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-09-26 08:25:42,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-09-26 08:25:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-09-26 08:25:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-09-26 08:25:42,658 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 170 [2018-09-26 08:25:42,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:42,658 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-09-26 08:25:42,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-09-26 08:25:42,658 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-09-26 08:25:42,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-09-26 08:25:42,659 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:42,659 INFO L375 BasicCegarLoop]: trace histogram [168, 1, 1, 1] [2018-09-26 08:25:42,659 INFO L423 AbstractCegarLoop]: === Iteration 169 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:42,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:42,660 INFO L82 PathProgramCache]: Analyzing trace with hash -68328352, now seen corresponding path program 168 times [2018-09-26 08:25:42,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:43,717 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:43,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-09-26 08:25:43,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-09-26 08:25:43,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-09-26 08:25:43,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:25:43,721 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 171 states. [2018-09-26 08:25:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:44,113 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-26 08:25:44,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-09-26 08:25:44,114 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 171 [2018-09-26 08:25:44,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:44,114 INFO L225 Difference]: With dead ends: 175 [2018-09-26 08:25:44,114 INFO L226 Difference]: Without dead ends: 173 [2018-09-26 08:25:44,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:25:44,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-09-26 08:25:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-09-26 08:25:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:25:44,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-26 08:25:44,119 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 171 [2018-09-26 08:25:44,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:44,119 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-26 08:25:44,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-09-26 08:25:44,119 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-26 08:25:44,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:25:44,119 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:44,120 INFO L375 BasicCegarLoop]: trace histogram [169, 1, 1, 1] [2018-09-26 08:25:44,120 INFO L423 AbstractCegarLoop]: === Iteration 170 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:44,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:44,120 INFO L82 PathProgramCache]: Analyzing trace with hash -2118182778, now seen corresponding path program 169 times [2018-09-26 08:25:44,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:45,238 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:45,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-09-26 08:25:45,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-09-26 08:25:45,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-09-26 08:25:45,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:25:45,243 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 172 states. [2018-09-26 08:25:45,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:45,957 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-09-26 08:25:45,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-09-26 08:25:45,957 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 172 [2018-09-26 08:25:45,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:45,958 INFO L225 Difference]: With dead ends: 176 [2018-09-26 08:25:45,958 INFO L226 Difference]: Without dead ends: 174 [2018-09-26 08:25:45,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:25:45,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-26 08:25:45,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-09-26 08:25:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-26 08:25:45,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-09-26 08:25:45,963 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 172 [2018-09-26 08:25:45,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:45,963 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-09-26 08:25:45,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-09-26 08:25:45,963 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-09-26 08:25:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-09-26 08:25:45,963 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:45,964 INFO L375 BasicCegarLoop]: trace histogram [170, 1, 1, 1] [2018-09-26 08:25:45,964 INFO L423 AbstractCegarLoop]: === Iteration 171 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:45,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:45,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1239160544, now seen corresponding path program 170 times [2018-09-26 08:25:45,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:47,161 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:47,161 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-09-26 08:25:47,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-09-26 08:25:47,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-09-26 08:25:47,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:25:47,164 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 173 states. [2018-09-26 08:25:47,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:47,337 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-09-26 08:25:47,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-09-26 08:25:47,337 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 173 [2018-09-26 08:25:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:47,338 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:25:47,338 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 08:25:47,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:25:47,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 08:25:47,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-09-26 08:25:47,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 08:25:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-09-26 08:25:47,342 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 173 [2018-09-26 08:25:47,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:47,343 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-09-26 08:25:47,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-09-26 08:25:47,343 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-09-26 08:25:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:25:47,343 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:47,344 INFO L375 BasicCegarLoop]: trace histogram [171, 1, 1, 1] [2018-09-26 08:25:47,344 INFO L423 AbstractCegarLoop]: === Iteration 172 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:47,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:47,344 INFO L82 PathProgramCache]: Analyzing trace with hash 240724934, now seen corresponding path program 171 times [2018-09-26 08:25:47,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:48,457 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:48,457 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-09-26 08:25:48,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-09-26 08:25:48,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-09-26 08:25:48,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:25:48,461 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 174 states. [2018-09-26 08:25:49,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:49,143 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-09-26 08:25:49,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-09-26 08:25:49,143 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 174 [2018-09-26 08:25:49,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:49,144 INFO L225 Difference]: With dead ends: 178 [2018-09-26 08:25:49,144 INFO L226 Difference]: Without dead ends: 176 [2018-09-26 08:25:49,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:25:49,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-09-26 08:25:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-09-26 08:25:49,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-09-26 08:25:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-09-26 08:25:49,149 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 174 [2018-09-26 08:25:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:49,149 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-09-26 08:25:49,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-09-26 08:25:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-09-26 08:25:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-26 08:25:49,150 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:49,150 INFO L375 BasicCegarLoop]: trace histogram [172, 1, 1, 1] [2018-09-26 08:25:49,150 INFO L423 AbstractCegarLoop]: === Iteration 173 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:49,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:49,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1127465504, now seen corresponding path program 172 times [2018-09-26 08:25:49,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:50,283 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:50,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-09-26 08:25:50,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-09-26 08:25:50,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-09-26 08:25:50,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:25:50,287 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 175 states. [2018-09-26 08:25:50,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:50,718 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-26 08:25:50,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-09-26 08:25:50,718 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 175 [2018-09-26 08:25:50,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:50,718 INFO L225 Difference]: With dead ends: 179 [2018-09-26 08:25:50,719 INFO L226 Difference]: Without dead ends: 177 [2018-09-26 08:25:50,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:25:50,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-26 08:25:50,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-09-26 08:25:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 08:25:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-26 08:25:50,724 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 175 [2018-09-26 08:25:50,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:50,724 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-26 08:25:50,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-09-26 08:25:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-26 08:25:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 08:25:50,725 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:50,725 INFO L375 BasicCegarLoop]: trace histogram [173, 1, 1, 1] [2018-09-26 08:25:50,725 INFO L423 AbstractCegarLoop]: === Iteration 174 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:50,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:50,726 INFO L82 PathProgramCache]: Analyzing trace with hash -591696122, now seen corresponding path program 173 times [2018-09-26 08:25:50,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:51,934 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:51,934 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:51,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-09-26 08:25:51,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-09-26 08:25:51,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-09-26 08:25:51,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:25:51,937 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 176 states. [2018-09-26 08:25:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:52,628 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-09-26 08:25:52,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-09-26 08:25:52,628 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 176 [2018-09-26 08:25:52,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:52,628 INFO L225 Difference]: With dead ends: 180 [2018-09-26 08:25:52,628 INFO L226 Difference]: Without dead ends: 178 [2018-09-26 08:25:52,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:25:52,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-26 08:25:52,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-09-26 08:25:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-09-26 08:25:52,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-09-26 08:25:52,632 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 176 [2018-09-26 08:25:52,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:52,633 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-09-26 08:25:52,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-09-26 08:25:52,633 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-09-26 08:25:52,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-09-26 08:25:52,633 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:52,633 INFO L375 BasicCegarLoop]: trace histogram [174, 1, 1, 1] [2018-09-26 08:25:52,633 INFO L423 AbstractCegarLoop]: === Iteration 175 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:52,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:52,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1162714464, now seen corresponding path program 174 times [2018-09-26 08:25:52,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:53,849 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:53,849 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:53,849 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-09-26 08:25:53,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-09-26 08:25:53,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-09-26 08:25:53,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:25:53,854 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 177 states. [2018-09-26 08:25:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:54,378 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-09-26 08:25:54,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-09-26 08:25:54,379 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 177 [2018-09-26 08:25:54,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:54,379 INFO L225 Difference]: With dead ends: 181 [2018-09-26 08:25:54,379 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:25:54,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:25:54,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:25:54,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-09-26 08:25:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:25:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-09-26 08:25:54,384 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 177 [2018-09-26 08:25:54,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:54,384 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-09-26 08:25:54,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-09-26 08:25:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-09-26 08:25:54,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:25:54,385 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:54,385 INFO L375 BasicCegarLoop]: trace histogram [175, 1, 1, 1] [2018-09-26 08:25:54,385 INFO L423 AbstractCegarLoop]: === Iteration 176 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:54,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:54,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1684413882, now seen corresponding path program 175 times [2018-09-26 08:25:54,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:55,648 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:55,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-09-26 08:25:55,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-09-26 08:25:55,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-09-26 08:25:55,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:25:55,653 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 178 states. [2018-09-26 08:25:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:56,367 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-09-26 08:25:56,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-09-26 08:25:56,368 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 178 [2018-09-26 08:25:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:56,368 INFO L225 Difference]: With dead ends: 182 [2018-09-26 08:25:56,368 INFO L226 Difference]: Without dead ends: 180 [2018-09-26 08:25:56,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:25:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-09-26 08:25:56,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-09-26 08:25:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-09-26 08:25:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-09-26 08:25:56,373 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 178 [2018-09-26 08:25:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:56,373 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-09-26 08:25:56,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-09-26 08:25:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-09-26 08:25:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-09-26 08:25:56,374 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:56,374 INFO L375 BasicCegarLoop]: trace histogram [176, 1, 1, 1] [2018-09-26 08:25:56,374 INFO L423 AbstractCegarLoop]: === Iteration 177 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:56,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:56,374 INFO L82 PathProgramCache]: Analyzing trace with hash -677226656, now seen corresponding path program 176 times [2018-09-26 08:25:56,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:57,564 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:57,564 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-09-26 08:25:57,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-09-26 08:25:57,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-09-26 08:25:57,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:25:57,568 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 179 states. [2018-09-26 08:25:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:58,037 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-09-26 08:25:58,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-09-26 08:25:58,037 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 179 [2018-09-26 08:25:58,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:58,037 INFO L225 Difference]: With dead ends: 183 [2018-09-26 08:25:58,037 INFO L226 Difference]: Without dead ends: 181 [2018-09-26 08:25:58,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:25:58,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-09-26 08:25:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-09-26 08:25:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 08:25:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-26 08:25:58,042 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 179 [2018-09-26 08:25:58,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:58,042 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-26 08:25:58,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-09-26 08:25:58,043 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-26 08:25:58,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:25:58,043 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:58,043 INFO L375 BasicCegarLoop]: trace histogram [177, 1, 1, 1] [2018-09-26 08:25:58,043 INFO L423 AbstractCegarLoop]: === Iteration 178 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:58,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:58,044 INFO L82 PathProgramCache]: Analyzing trace with hash 480806278, now seen corresponding path program 177 times [2018-09-26 08:25:58,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:59,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:59,283 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:59,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-09-26 08:25:59,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-09-26 08:25:59,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-09-26 08:25:59,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:25:59,288 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 180 states. [2018-09-26 08:26:00,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:00,206 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-09-26 08:26:00,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-09-26 08:26:00,206 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 180 [2018-09-26 08:26:00,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:00,207 INFO L225 Difference]: With dead ends: 184 [2018-09-26 08:26:00,207 INFO L226 Difference]: Without dead ends: 182 [2018-09-26 08:26:00,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:26:00,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-26 08:26:00,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-09-26 08:26:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-26 08:26:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-09-26 08:26:00,212 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 180 [2018-09-26 08:26:00,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:00,212 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-09-26 08:26:00,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-09-26 08:26:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-09-26 08:26:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-09-26 08:26:00,213 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:00,213 INFO L375 BasicCegarLoop]: trace histogram [178, 1, 1, 1] [2018-09-26 08:26:00,213 INFO L423 AbstractCegarLoop]: === Iteration 179 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:00,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:00,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2020088864, now seen corresponding path program 178 times [2018-09-26 08:26:00,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:01,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:01,476 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:01,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-09-26 08:26:01,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-09-26 08:26:01,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-09-26 08:26:01,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 08:26:01,479 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 181 states. [2018-09-26 08:26:01,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:01,735 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-09-26 08:26:01,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-09-26 08:26:01,735 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 181 [2018-09-26 08:26:01,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:01,735 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:26:01,736 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:26:01,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 08:26:01,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:26:01,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-09-26 08:26:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:26:01,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-09-26 08:26:01,739 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 181 [2018-09-26 08:26:01,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:01,740 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-09-26 08:26:01,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-09-26 08:26:01,740 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-09-26 08:26:01,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-26 08:26:01,741 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:01,741 INFO L375 BasicCegarLoop]: trace histogram [179, 1, 1, 1] [2018-09-26 08:26:01,741 INFO L423 AbstractCegarLoop]: === Iteration 180 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:01,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:01,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1801758522, now seen corresponding path program 179 times [2018-09-26 08:26:01,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:02,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:02,994 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:02,995 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-09-26 08:26:02,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-09-26 08:26:02,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-09-26 08:26:02,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:26:02,999 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 182 states. [2018-09-26 08:26:03,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:03,719 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-09-26 08:26:03,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-09-26 08:26:03,719 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 182 [2018-09-26 08:26:03,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:03,720 INFO L225 Difference]: With dead ends: 186 [2018-09-26 08:26:03,720 INFO L226 Difference]: Without dead ends: 184 [2018-09-26 08:26:03,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:26:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-26 08:26:03,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-09-26 08:26:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-09-26 08:26:03,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-09-26 08:26:03,725 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 182 [2018-09-26 08:26:03,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:03,725 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-09-26 08:26:03,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-09-26 08:26:03,726 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-09-26 08:26:03,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-26 08:26:03,726 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:03,726 INFO L375 BasicCegarLoop]: trace histogram [180, 1, 1, 1] [2018-09-26 08:26:03,726 INFO L423 AbstractCegarLoop]: === Iteration 181 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:03,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:03,726 INFO L82 PathProgramCache]: Analyzing trace with hash -19943200, now seen corresponding path program 180 times [2018-09-26 08:26:03,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:04,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:04,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2018-09-26 08:26:04,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-09-26 08:26:04,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-09-26 08:26:04,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-09-26 08:26:04,937 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 183 states. [2018-09-26 08:26:05,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:05,237 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-09-26 08:26:05,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-09-26 08:26:05,237 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 183 [2018-09-26 08:26:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:05,238 INFO L225 Difference]: With dead ends: 187 [2018-09-26 08:26:05,238 INFO L226 Difference]: Without dead ends: 185 [2018-09-26 08:26:05,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-09-26 08:26:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-09-26 08:26:05,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-09-26 08:26:05,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 08:26:05,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-26 08:26:05,243 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 183 [2018-09-26 08:26:05,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:05,243 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-26 08:26:05,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-09-26 08:26:05,243 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-26 08:26:05,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 08:26:05,244 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:05,244 INFO L375 BasicCegarLoop]: trace histogram [181, 1, 1, 1] [2018-09-26 08:26:05,244 INFO L423 AbstractCegarLoop]: === Iteration 182 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:05,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:05,245 INFO L82 PathProgramCache]: Analyzing trace with hash -618243066, now seen corresponding path program 181 times [2018-09-26 08:26:05,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:06,582 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:06,582 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-09-26 08:26:06,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-09-26 08:26:06,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-09-26 08:26:06,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 08:26:06,587 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 184 states. [2018-09-26 08:26:07,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:07,268 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-09-26 08:26:07,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-09-26 08:26:07,268 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 184 [2018-09-26 08:26:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:07,269 INFO L225 Difference]: With dead ends: 188 [2018-09-26 08:26:07,269 INFO L226 Difference]: Without dead ends: 186 [2018-09-26 08:26:07,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 08:26:07,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-26 08:26:07,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-09-26 08:26:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-09-26 08:26:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-09-26 08:26:07,274 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 184 [2018-09-26 08:26:07,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:07,274 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-09-26 08:26:07,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-09-26 08:26:07,274 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-09-26 08:26:07,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-26 08:26:07,275 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:07,275 INFO L375 BasicCegarLoop]: trace histogram [182, 1, 1, 1] [2018-09-26 08:26:07,275 INFO L423 AbstractCegarLoop]: === Iteration 183 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:07,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:07,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1985669728, now seen corresponding path program 182 times [2018-09-26 08:26:07,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:08,595 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:08,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2018-09-26 08:26:08,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-09-26 08:26:08,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-09-26 08:26:08,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:26:08,601 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 185 states. [2018-09-26 08:26:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:09,555 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-09-26 08:26:09,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-09-26 08:26:09,555 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 185 [2018-09-26 08:26:09,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:09,556 INFO L225 Difference]: With dead ends: 189 [2018-09-26 08:26:09,556 INFO L226 Difference]: Without dead ends: 187 [2018-09-26 08:26:09,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:26:09,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-26 08:26:09,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-09-26 08:26:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-26 08:26:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-09-26 08:26:09,562 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 185 [2018-09-26 08:26:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:09,562 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-09-26 08:26:09,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-09-26 08:26:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-09-26 08:26:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 08:26:09,562 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:09,563 INFO L375 BasicCegarLoop]: trace histogram [183, 1, 1, 1] [2018-09-26 08:26:09,563 INFO L423 AbstractCegarLoop]: === Iteration 184 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:09,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:09,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1426223290, now seen corresponding path program 183 times [2018-09-26 08:26:09,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:10,925 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:10,926 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185] total 185 [2018-09-26 08:26:10,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-09-26 08:26:10,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-09-26 08:26:10,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-09-26 08:26:10,930 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 186 states. [2018-09-26 08:26:11,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:11,188 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-09-26 08:26:11,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-09-26 08:26:11,188 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 186 [2018-09-26 08:26:11,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:11,189 INFO L225 Difference]: With dead ends: 190 [2018-09-26 08:26:11,189 INFO L226 Difference]: Without dead ends: 188 [2018-09-26 08:26:11,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-09-26 08:26:11,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-09-26 08:26:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-09-26 08:26:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-09-26 08:26:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-09-26 08:26:11,193 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 186 [2018-09-26 08:26:11,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:11,193 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-09-26 08:26:11,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-09-26 08:26:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-09-26 08:26:11,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-09-26 08:26:11,193 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:11,194 INFO L375 BasicCegarLoop]: trace histogram [184, 1, 1, 1] [2018-09-26 08:26:11,194 INFO L423 AbstractCegarLoop]: === Iteration 185 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:11,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:11,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1263252896, now seen corresponding path program 184 times [2018-09-26 08:26:11,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:12,500 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:12,500 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [186] total 186 [2018-09-26 08:26:12,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 187 states [2018-09-26 08:26:12,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2018-09-26 08:26:12,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-09-26 08:26:12,504 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 187 states. [2018-09-26 08:26:13,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:13,266 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-26 08:26:13,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-09-26 08:26:13,266 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 187 [2018-09-26 08:26:13,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:13,266 INFO L225 Difference]: With dead ends: 191 [2018-09-26 08:26:13,266 INFO L226 Difference]: Without dead ends: 189 [2018-09-26 08:26:13,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-09-26 08:26:13,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-26 08:26:13,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-09-26 08:26:13,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-26 08:26:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-09-26 08:26:13,272 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 187 [2018-09-26 08:26:13,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:13,272 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-09-26 08:26:13,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 187 states. [2018-09-26 08:26:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-09-26 08:26:13,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 08:26:13,273 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:13,273 INFO L375 BasicCegarLoop]: trace histogram [185, 1, 1, 1] [2018-09-26 08:26:13,273 INFO L423 AbstractCegarLoop]: === Iteration 186 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:13,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:13,273 INFO L82 PathProgramCache]: Analyzing trace with hash -506137978, now seen corresponding path program 185 times [2018-09-26 08:26:13,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:14,668 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:14,668 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:14,668 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187] total 187 [2018-09-26 08:26:14,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-09-26 08:26:14,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-09-26 08:26:14,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:26:14,673 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 188 states. [2018-09-26 08:26:15,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:15,700 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-09-26 08:26:15,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-09-26 08:26:15,700 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 188 [2018-09-26 08:26:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:15,700 INFO L225 Difference]: With dead ends: 192 [2018-09-26 08:26:15,701 INFO L226 Difference]: Without dead ends: 190 [2018-09-26 08:26:15,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:26:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-26 08:26:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-09-26 08:26:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-09-26 08:26:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-09-26 08:26:15,705 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 188 [2018-09-26 08:26:15,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:15,705 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-09-26 08:26:15,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-09-26 08:26:15,705 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-09-26 08:26:15,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-09-26 08:26:15,706 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:15,706 INFO L375 BasicCegarLoop]: trace histogram [186, 1, 1, 1] [2018-09-26 08:26:15,706 INFO L423 AbstractCegarLoop]: === Iteration 187 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:15,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:15,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1489588000, now seen corresponding path program 186 times [2018-09-26 08:26:15,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:17,095 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:17,095 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [188] total 188 [2018-09-26 08:26:17,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-09-26 08:26:17,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-09-26 08:26:17,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-09-26 08:26:17,099 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 189 states. [2018-09-26 08:26:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:17,574 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-09-26 08:26:17,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-09-26 08:26:17,575 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 189 [2018-09-26 08:26:17,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:17,575 INFO L225 Difference]: With dead ends: 193 [2018-09-26 08:26:17,575 INFO L226 Difference]: Without dead ends: 191 [2018-09-26 08:26:17,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-09-26 08:26:17,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-26 08:26:17,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-09-26 08:26:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 08:26:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-09-26 08:26:17,580 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 189 [2018-09-26 08:26:17,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:17,580 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-09-26 08:26:17,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-09-26 08:26:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-09-26 08:26:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:26:17,581 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:17,581 INFO L375 BasicCegarLoop]: trace histogram [187, 1, 1, 1] [2018-09-26 08:26:17,581 INFO L423 AbstractCegarLoop]: === Iteration 188 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:17,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:17,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1067416122, now seen corresponding path program 187 times [2018-09-26 08:26:17,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 17578 backedges. 0 proven. 17578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:19,048 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:19,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [189] total 189 [2018-09-26 08:26:19,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-09-26 08:26:19,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-09-26 08:26:19,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:26:19,051 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 190 states. [2018-09-26 08:26:19,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:19,423 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-09-26 08:26:19,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-09-26 08:26:19,424 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 190 [2018-09-26 08:26:19,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:19,424 INFO L225 Difference]: With dead ends: 194 [2018-09-26 08:26:19,424 INFO L226 Difference]: Without dead ends: 192 [2018-09-26 08:26:19,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:26:19,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-09-26 08:26:19,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-09-26 08:26:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-09-26 08:26:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-09-26 08:26:19,428 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 190 [2018-09-26 08:26:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:19,429 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-09-26 08:26:19,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-09-26 08:26:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-09-26 08:26:19,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-26 08:26:19,429 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:19,429 INFO L375 BasicCegarLoop]: trace histogram [188, 1, 1, 1] [2018-09-26 08:26:19,429 INFO L423 AbstractCegarLoop]: === Iteration 189 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:19,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:19,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1269834720, now seen corresponding path program 188 times [2018-09-26 08:26:19,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:20,861 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:20,862 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:20,862 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [190] total 190 [2018-09-26 08:26:20,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-09-26 08:26:20,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-09-26 08:26:20,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-09-26 08:26:20,867 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 191 states. [2018-09-26 08:26:21,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:21,888 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-26 08:26:21,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-09-26 08:26:21,888 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 191 [2018-09-26 08:26:21,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:21,889 INFO L225 Difference]: With dead ends: 195 [2018-09-26 08:26:21,889 INFO L226 Difference]: Without dead ends: 193 [2018-09-26 08:26:21,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-09-26 08:26:21,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-09-26 08:26:21,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-09-26 08:26:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-26 08:26:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-09-26 08:26:21,896 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 191 [2018-09-26 08:26:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:21,896 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-09-26 08:26:21,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-09-26 08:26:21,896 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-09-26 08:26:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-26 08:26:21,897 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:21,897 INFO L375 BasicCegarLoop]: trace histogram [189, 1, 1, 1] [2018-09-26 08:26:21,898 INFO L423 AbstractCegarLoop]: === Iteration 190 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:21,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:21,898 INFO L82 PathProgramCache]: Analyzing trace with hash 710166790, now seen corresponding path program 189 times [2018-09-26 08:26:21,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 17955 backedges. 0 proven. 17955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:23,597 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:23,597 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191] total 191 [2018-09-26 08:26:23,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-09-26 08:26:23,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-09-26 08:26:23,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-09-26 08:26:23,602 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 192 states. [2018-09-26 08:26:24,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:24,536 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-09-26 08:26:24,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-09-26 08:26:24,537 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 192 [2018-09-26 08:26:24,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:24,537 INFO L225 Difference]: With dead ends: 196 [2018-09-26 08:26:24,537 INFO L226 Difference]: Without dead ends: 194 [2018-09-26 08:26:24,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-09-26 08:26:24,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-26 08:26:24,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-09-26 08:26:24,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-09-26 08:26:24,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-09-26 08:26:24,542 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 192 [2018-09-26 08:26:24,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:24,542 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-09-26 08:26:24,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-09-26 08:26:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-09-26 08:26:24,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-09-26 08:26:24,543 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:24,543 INFO L375 BasicCegarLoop]: trace histogram [190, 1, 1, 1] [2018-09-26 08:26:24,544 INFO L423 AbstractCegarLoop]: === Iteration 191 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:24,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:24,544 INFO L82 PathProgramCache]: Analyzing trace with hash 540330144, now seen corresponding path program 190 times [2018-09-26 08:26:24,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:26,025 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:26,026 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:26,026 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [192] total 192 [2018-09-26 08:26:26,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-09-26 08:26:26,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-09-26 08:26:26,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-09-26 08:26:26,030 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 193 states. [2018-09-26 08:26:26,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:26,631 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-09-26 08:26:26,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-09-26 08:26:26,631 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 193 [2018-09-26 08:26:26,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:26,632 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:26:26,632 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:26:26,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-09-26 08:26:26,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:26:26,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-09-26 08:26:26,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-26 08:26:26,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-09-26 08:26:26,637 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 193 [2018-09-26 08:26:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:26,637 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-09-26 08:26:26,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-09-26 08:26:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-09-26 08:26:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-26 08:26:26,637 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:26,638 INFO L375 BasicCegarLoop]: trace histogram [191, 1, 1, 1] [2018-09-26 08:26:26,638 INFO L423 AbstractCegarLoop]: === Iteration 192 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:26,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:26,638 INFO L82 PathProgramCache]: Analyzing trace with hash -429638586, now seen corresponding path program 191 times [2018-09-26 08:26:26,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:28,132 INFO L134 CoverageAnalysis]: Checked inductivity of 18336 backedges. 0 proven. 18336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:28,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:28,133 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [193] total 193 [2018-09-26 08:26:28,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-09-26 08:26:28,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-09-26 08:26:28,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:26:28,139 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 194 states. [2018-09-26 08:26:28,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:28,466 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-09-26 08:26:28,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-09-26 08:26:28,466 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 194 [2018-09-26 08:26:28,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:28,467 INFO L225 Difference]: With dead ends: 198 [2018-09-26 08:26:28,467 INFO L226 Difference]: Without dead ends: 196 [2018-09-26 08:26:28,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:26:28,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-09-26 08:26:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-09-26 08:26:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-09-26 08:26:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-09-26 08:26:28,473 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 194 [2018-09-26 08:26:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:28,473 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-09-26 08:26:28,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-09-26 08:26:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-09-26 08:26:28,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-26 08:26:28,474 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:28,474 INFO L375 BasicCegarLoop]: trace histogram [192, 1, 1, 1] [2018-09-26 08:26:28,474 INFO L423 AbstractCegarLoop]: === Iteration 193 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:28,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:28,475 INFO L82 PathProgramCache]: Analyzing trace with hash -433898144, now seen corresponding path program 192 times [2018-09-26 08:26:28,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:29,982 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:29,982 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:29,982 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [194] total 194 [2018-09-26 08:26:29,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 195 states [2018-09-26 08:26:29,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2018-09-26 08:26:29,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-09-26 08:26:29,989 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 195 states. [2018-09-26 08:26:30,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:30,468 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-09-26 08:26:30,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-09-26 08:26:30,469 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 195 [2018-09-26 08:26:30,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:30,469 INFO L225 Difference]: With dead ends: 199 [2018-09-26 08:26:30,469 INFO L226 Difference]: Without dead ends: 197 [2018-09-26 08:26:30,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-09-26 08:26:30,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-09-26 08:26:30,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-09-26 08:26:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:26:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-26 08:26:30,475 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 195 [2018-09-26 08:26:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:30,475 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-26 08:26:30,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 195 states. [2018-09-26 08:26:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-26 08:26:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:26:30,476 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:30,476 INFO L375 BasicCegarLoop]: trace histogram [193, 1, 1, 1] [2018-09-26 08:26:30,476 INFO L423 AbstractCegarLoop]: === Iteration 194 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:30,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:30,476 INFO L82 PathProgramCache]: Analyzing trace with hash -565944442, now seen corresponding path program 193 times [2018-09-26 08:26:30,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 18721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:32,055 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:32,055 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195] total 195 [2018-09-26 08:26:32,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-09-26 08:26:32,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-09-26 08:26:32,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:26:32,061 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 196 states. [2018-09-26 08:26:32,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:32,928 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-09-26 08:26:32,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-09-26 08:26:32,928 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 196 [2018-09-26 08:26:32,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:32,929 INFO L225 Difference]: With dead ends: 200 [2018-09-26 08:26:32,929 INFO L226 Difference]: Without dead ends: 198 [2018-09-26 08:26:32,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:26:32,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-26 08:26:32,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-09-26 08:26:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-09-26 08:26:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-09-26 08:26:32,936 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 196 [2018-09-26 08:26:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:32,936 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-09-26 08:26:32,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-09-26 08:26:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-09-26 08:26:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-09-26 08:26:32,937 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:32,937 INFO L375 BasicCegarLoop]: trace histogram [194, 1, 1, 1] [2018-09-26 08:26:32,937 INFO L423 AbstractCegarLoop]: === Iteration 195 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:32,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:32,938 INFO L82 PathProgramCache]: Analyzing trace with hash -364412384, now seen corresponding path program 194 times [2018-09-26 08:26:32,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:34,623 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:34,624 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [196] total 196 [2018-09-26 08:26:34,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-09-26 08:26:34,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-09-26 08:26:34,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:26:34,629 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 197 states. [2018-09-26 08:26:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:35,789 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-09-26 08:26:35,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-09-26 08:26:35,790 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 197 [2018-09-26 08:26:35,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:35,790 INFO L225 Difference]: With dead ends: 201 [2018-09-26 08:26:35,790 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 08:26:35,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:26:35,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 08:26:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-09-26 08:26:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-09-26 08:26:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-09-26 08:26:35,796 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 197 [2018-09-26 08:26:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:35,796 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-09-26 08:26:35,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-09-26 08:26:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-09-26 08:26:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-26 08:26:35,797 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:35,797 INFO L375 BasicCegarLoop]: trace histogram [195, 1, 1, 1] [2018-09-26 08:26:35,797 INFO L423 AbstractCegarLoop]: === Iteration 196 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:35,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:35,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1588114118, now seen corresponding path program 195 times [2018-09-26 08:26:35,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:37,400 INFO L134 CoverageAnalysis]: Checked inductivity of 19110 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:37,400 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:37,400 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [197] total 197 [2018-09-26 08:26:37,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-09-26 08:26:37,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-09-26 08:26:37,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-09-26 08:26:37,406 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 198 states. [2018-09-26 08:26:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:38,414 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-09-26 08:26:38,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-09-26 08:26:38,414 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 198 [2018-09-26 08:26:38,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:38,414 INFO L225 Difference]: With dead ends: 202 [2018-09-26 08:26:38,415 INFO L226 Difference]: Without dead ends: 200 [2018-09-26 08:26:38,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-09-26 08:26:38,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-26 08:26:38,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-09-26 08:26:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-09-26 08:26:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-09-26 08:26:38,419 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 198 [2018-09-26 08:26:38,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:38,419 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-09-26 08:26:38,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-09-26 08:26:38,419 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-09-26 08:26:38,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-09-26 08:26:38,420 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:38,420 INFO L375 BasicCegarLoop]: trace histogram [196, 1, 1, 1] [2018-09-26 08:26:38,420 INFO L423 AbstractCegarLoop]: === Iteration 197 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:38,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:38,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1986893536, now seen corresponding path program 196 times [2018-09-26 08:26:38,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:39,992 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:39,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [198] total 198 [2018-09-26 08:26:39,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 199 states [2018-09-26 08:26:39,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2018-09-26 08:26:39,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-09-26 08:26:39,998 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 199 states. [2018-09-26 08:26:41,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:41,202 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-09-26 08:26:41,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-09-26 08:26:41,202 INFO L78 Accepts]: Start accepts. Automaton has 199 states. Word has length 199 [2018-09-26 08:26:41,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:41,203 INFO L225 Difference]: With dead ends: 203 [2018-09-26 08:26:41,203 INFO L226 Difference]: Without dead ends: 201 [2018-09-26 08:26:41,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-09-26 08:26:41,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-09-26 08:26:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-09-26 08:26:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 08:26:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-26 08:26:41,211 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 199 [2018-09-26 08:26:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:41,211 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-26 08:26:41,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 199 states. [2018-09-26 08:26:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-26 08:26:41,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 08:26:41,212 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:41,212 INFO L375 BasicCegarLoop]: trace histogram [197, 1, 1, 1] [2018-09-26 08:26:41,213 INFO L423 AbstractCegarLoop]: === Iteration 198 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:41,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:41,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1464153606, now seen corresponding path program 197 times [2018-09-26 08:26:41,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:42,972 INFO L134 CoverageAnalysis]: Checked inductivity of 19503 backedges. 0 proven. 19503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:42,972 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:42,972 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [199] total 199 [2018-09-26 08:26:42,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-09-26 08:26:42,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-09-26 08:26:42,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:26:42,977 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 200 states. [2018-09-26 08:26:44,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:44,228 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-09-26 08:26:44,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-09-26 08:26:44,228 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 200 [2018-09-26 08:26:44,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:44,229 INFO L225 Difference]: With dead ends: 204 [2018-09-26 08:26:44,229 INFO L226 Difference]: Without dead ends: 202 [2018-09-26 08:26:44,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:26:44,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-26 08:26:44,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-09-26 08:26:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-26 08:26:44,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-09-26 08:26:44,235 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 200 [2018-09-26 08:26:44,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:44,235 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-09-26 08:26:44,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-09-26 08:26:44,235 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-09-26 08:26:44,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-26 08:26:44,236 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:44,236 INFO L375 BasicCegarLoop]: trace histogram [198, 1, 1, 1] [2018-09-26 08:26:44,236 INFO L423 AbstractCegarLoop]: === Iteration 199 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:44,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:44,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1855882336, now seen corresponding path program 198 times [2018-09-26 08:26:44,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:45,795 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:45,795 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [200] total 200 [2018-09-26 08:26:45,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-09-26 08:26:45,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-09-26 08:26:45,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-09-26 08:26:45,800 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 201 states. [2018-09-26 08:26:46,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:46,659 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-09-26 08:26:46,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-09-26 08:26:46,659 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 201 [2018-09-26 08:26:46,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:46,660 INFO L225 Difference]: With dead ends: 205 [2018-09-26 08:26:46,660 INFO L226 Difference]: Without dead ends: 203 [2018-09-26 08:26:46,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-09-26 08:26:46,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-26 08:26:46,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-09-26 08:26:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:26:46,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-09-26 08:26:46,666 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 201 [2018-09-26 08:26:46,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:46,666 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-09-26 08:26:46,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-09-26 08:26:46,666 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-09-26 08:26:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:26:46,666 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:46,667 INFO L375 BasicCegarLoop]: trace histogram [199, 1, 1, 1] [2018-09-26 08:26:46,667 INFO L423 AbstractCegarLoop]: === Iteration 200 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:46,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:46,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1697781434, now seen corresponding path program 199 times [2018-09-26 08:26:46,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 19900 backedges. 0 proven. 19900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:48,315 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:48,315 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [201] total 201 [2018-09-26 08:26:48,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-09-26 08:26:48,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-09-26 08:26:48,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:26:48,318 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 202 states. [2018-09-26 08:26:49,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:49,094 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-09-26 08:26:49,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-09-26 08:26:49,094 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 202 [2018-09-26 08:26:49,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:49,095 INFO L225 Difference]: With dead ends: 206 [2018-09-26 08:26:49,095 INFO L226 Difference]: Without dead ends: 204 [2018-09-26 08:26:49,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:26:49,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-09-26 08:26:49,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-09-26 08:26:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-09-26 08:26:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-09-26 08:26:49,099 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 202 [2018-09-26 08:26:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:49,099 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-09-26 08:26:49,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-09-26 08:26:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-09-26 08:26:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-09-26 08:26:49,100 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:49,100 INFO L375 BasicCegarLoop]: trace histogram [200, 1, 1, 1] [2018-09-26 08:26:49,100 INFO L423 AbstractCegarLoop]: === Iteration 201 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:49,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:49,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1091620768, now seen corresponding path program 200 times [2018-09-26 08:26:49,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:50,567 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:50,567 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [202] total 202 [2018-09-26 08:26:50,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 203 states [2018-09-26 08:26:50,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2018-09-26 08:26:50,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-09-26 08:26:50,572 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 203 states. [2018-09-26 08:26:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:51,422 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-26 08:26:51,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-09-26 08:26:51,422 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 203 [2018-09-26 08:26:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:51,422 INFO L225 Difference]: With dead ends: 207 [2018-09-26 08:26:51,422 INFO L226 Difference]: Without dead ends: 205 [2018-09-26 08:26:51,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-09-26 08:26:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-09-26 08:26:51,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-09-26 08:26:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-26 08:26:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-09-26 08:26:51,427 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 203 [2018-09-26 08:26:51,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:51,427 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-09-26 08:26:51,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 203 states. [2018-09-26 08:26:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-09-26 08:26:51,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 08:26:51,428 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:51,428 INFO L375 BasicCegarLoop]: trace histogram [201, 1, 1, 1] [2018-09-26 08:26:51,428 INFO L423 AbstractCegarLoop]: === Iteration 202 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:51,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:51,429 INFO L82 PathProgramCache]: Analyzing trace with hash 519490694, now seen corresponding path program 201 times [2018-09-26 08:26:51,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:52,972 INFO L134 CoverageAnalysis]: Checked inductivity of 20301 backedges. 0 proven. 20301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:52,973 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:52,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203] total 203 [2018-09-26 08:26:52,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-09-26 08:26:52,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-09-26 08:26:52,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 08:26:52,976 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 204 states. [2018-09-26 08:26:53,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:53,757 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-09-26 08:26:53,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-09-26 08:26:53,757 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 204 [2018-09-26 08:26:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:53,757 INFO L225 Difference]: With dead ends: 208 [2018-09-26 08:26:53,757 INFO L226 Difference]: Without dead ends: 206 [2018-09-26 08:26:53,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 08:26:53,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-09-26 08:26:53,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-09-26 08:26:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-09-26 08:26:53,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-09-26 08:26:53,761 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 204 [2018-09-26 08:26:53,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:53,762 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-09-26 08:26:53,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-09-26 08:26:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-09-26 08:26:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-26 08:26:53,762 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:53,762 INFO L375 BasicCegarLoop]: trace histogram [202, 1, 1, 1] [2018-09-26 08:26:53,762 INFO L423 AbstractCegarLoop]: === Iteration 203 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:53,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:53,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1075661536, now seen corresponding path program 202 times [2018-09-26 08:26:53,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 20503 backedges. 0 proven. 20503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:55,402 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:55,402 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [204] total 204 [2018-09-26 08:26:55,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-09-26 08:26:55,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-09-26 08:26:55,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-09-26 08:26:55,408 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 205 states. [2018-09-26 08:26:56,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:56,662 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-09-26 08:26:56,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-09-26 08:26:56,663 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 205 [2018-09-26 08:26:56,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:56,663 INFO L225 Difference]: With dead ends: 209 [2018-09-26 08:26:56,663 INFO L226 Difference]: Without dead ends: 207 [2018-09-26 08:26:56,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-09-26 08:26:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-26 08:26:56,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-09-26 08:26:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-26 08:26:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-09-26 08:26:56,669 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 205 [2018-09-26 08:26:56,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:56,669 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-09-26 08:26:56,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-09-26 08:26:56,669 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-09-26 08:26:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-26 08:26:56,670 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:56,670 INFO L375 BasicCegarLoop]: trace histogram [203, 1, 1, 1] [2018-09-26 08:26:56,670 INFO L423 AbstractCegarLoop]: === Iteration 204 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:56,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:56,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1014226886, now seen corresponding path program 203 times [2018-09-26 08:26:56,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 20706 backedges. 0 proven. 20706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:58,413 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:58,414 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [205] total 205 [2018-09-26 08:26:58,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-09-26 08:26:58,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-09-26 08:26:58,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-09-26 08:26:58,418 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 206 states. [2018-09-26 08:26:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:59,786 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-09-26 08:26:59,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-09-26 08:26:59,786 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 206 [2018-09-26 08:26:59,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:59,787 INFO L225 Difference]: With dead ends: 210 [2018-09-26 08:26:59,787 INFO L226 Difference]: Without dead ends: 208 [2018-09-26 08:26:59,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-09-26 08:26:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-09-26 08:26:59,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-09-26 08:26:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-09-26 08:26:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-09-26 08:26:59,793 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 206 [2018-09-26 08:26:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:59,793 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-09-26 08:26:59,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-09-26 08:26:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-09-26 08:26:59,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-09-26 08:26:59,794 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:59,794 INFO L375 BasicCegarLoop]: trace histogram [204, 1, 1, 1] [2018-09-26 08:26:59,794 INFO L423 AbstractCegarLoop]: === Iteration 205 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:59,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:59,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1376258528, now seen corresponding path program 204 times [2018-09-26 08:26:59,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 20910 backedges. 0 proven. 20910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:01,562 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:01,562 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [206] total 206 [2018-09-26 08:27:01,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 207 states [2018-09-26 08:27:01,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 207 interpolants. [2018-09-26 08:27:01,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-09-26 08:27:01,567 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 207 states. [2018-09-26 08:27:03,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:03,142 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-09-26 08:27:03,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-09-26 08:27:03,142 INFO L78 Accepts]: Start accepts. Automaton has 207 states. Word has length 207 [2018-09-26 08:27:03,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:03,142 INFO L225 Difference]: With dead ends: 211 [2018-09-26 08:27:03,142 INFO L226 Difference]: Without dead ends: 209 [2018-09-26 08:27:03,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-09-26 08:27:03,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-26 08:27:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-09-26 08:27:03,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-26 08:27:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-09-26 08:27:03,149 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 207 [2018-09-26 08:27:03,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:03,149 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-09-26 08:27:03,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 207 states. [2018-09-26 08:27:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-09-26 08:27:03,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 08:27:03,149 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:03,150 INFO L375 BasicCegarLoop]: trace histogram [205, 1, 1, 1] [2018-09-26 08:27:03,150 INFO L423 AbstractCegarLoop]: === Iteration 206 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:03,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:03,150 INFO L82 PathProgramCache]: Analyzing trace with hash -285662458, now seen corresponding path program 205 times [2018-09-26 08:27:03,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 21115 backedges. 0 proven. 21115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:04,917 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:04,917 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [207] total 207 [2018-09-26 08:27:04,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 208 states [2018-09-26 08:27:04,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 208 interpolants. [2018-09-26 08:27:04,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-09-26 08:27:04,922 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 208 states. [2018-09-26 08:27:06,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:06,440 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-09-26 08:27:06,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2018-09-26 08:27:06,440 INFO L78 Accepts]: Start accepts. Automaton has 208 states. Word has length 208 [2018-09-26 08:27:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:06,441 INFO L225 Difference]: With dead ends: 212 [2018-09-26 08:27:06,441 INFO L226 Difference]: Without dead ends: 210 [2018-09-26 08:27:06,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-09-26 08:27:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-26 08:27:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-09-26 08:27:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-09-26 08:27:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-09-26 08:27:06,446 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 208 [2018-09-26 08:27:06,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:06,446 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-09-26 08:27:06,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 208 states. [2018-09-26 08:27:06,446 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-09-26 08:27:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-09-26 08:27:06,447 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:06,447 INFO L375 BasicCegarLoop]: trace histogram [206, 1, 1, 1] [2018-09-26 08:27:06,447 INFO L423 AbstractCegarLoop]: === Iteration 207 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:06,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:06,448 INFO L82 PathProgramCache]: Analyzing trace with hash -265605472, now seen corresponding path program 206 times [2018-09-26 08:27:06,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 21321 backedges. 0 proven. 21321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:08,235 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:08,235 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [208] total 208 [2018-09-26 08:27:08,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 209 states [2018-09-26 08:27:08,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2018-09-26 08:27:08,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-09-26 08:27:08,241 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 209 states. [2018-09-26 08:27:09,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:09,705 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-09-26 08:27:09,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-09-26 08:27:09,705 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 209 [2018-09-26 08:27:09,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:09,706 INFO L225 Difference]: With dead ends: 213 [2018-09-26 08:27:09,706 INFO L226 Difference]: Without dead ends: 211 [2018-09-26 08:27:09,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-09-26 08:27:09,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-26 08:27:09,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-09-26 08:27:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-26 08:27:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-09-26 08:27:09,712 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 209 [2018-09-26 08:27:09,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:09,712 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-09-26 08:27:09,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 209 states. [2018-09-26 08:27:09,712 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-09-26 08:27:09,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-26 08:27:09,713 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:09,713 INFO L375 BasicCegarLoop]: trace histogram [207, 1, 1, 1] [2018-09-26 08:27:09,713 INFO L423 AbstractCegarLoop]: === Iteration 208 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:09,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:09,713 INFO L82 PathProgramCache]: Analyzing trace with hash 356161094, now seen corresponding path program 207 times [2018-09-26 08:27:09,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:11,502 INFO L134 CoverageAnalysis]: Checked inductivity of 21528 backedges. 0 proven. 21528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:11,502 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:11,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [209] total 209 [2018-09-26 08:27:11,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-09-26 08:27:11,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-09-26 08:27:11,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-09-26 08:27:11,509 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 210 states. [2018-09-26 08:27:12,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:12,589 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-09-26 08:27:12,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-09-26 08:27:12,589 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 210 [2018-09-26 08:27:12,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:12,589 INFO L225 Difference]: With dead ends: 214 [2018-09-26 08:27:12,589 INFO L226 Difference]: Without dead ends: 212 [2018-09-26 08:27:12,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-09-26 08:27:12,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-09-26 08:27:12,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-09-26 08:27:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-09-26 08:27:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-09-26 08:27:12,596 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 210 [2018-09-26 08:27:12,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:12,597 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-09-26 08:27:12,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-09-26 08:27:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-09-26 08:27:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-09-26 08:27:12,598 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:12,598 INFO L375 BasicCegarLoop]: trace histogram [208, 1, 1, 1] [2018-09-26 08:27:12,598 INFO L423 AbstractCegarLoop]: === Iteration 209 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:12,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:12,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1843911840, now seen corresponding path program 208 times [2018-09-26 08:27:12,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 21736 backedges. 0 proven. 21736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:14,629 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:14,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [210] total 210 [2018-09-26 08:27:14,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 211 states [2018-09-26 08:27:14,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 211 interpolants. [2018-09-26 08:27:14,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-09-26 08:27:14,632 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 211 states. [2018-09-26 08:27:15,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:15,382 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-26 08:27:15,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-09-26 08:27:15,382 INFO L78 Accepts]: Start accepts. Automaton has 211 states. Word has length 211 [2018-09-26 08:27:15,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:15,383 INFO L225 Difference]: With dead ends: 215 [2018-09-26 08:27:15,383 INFO L226 Difference]: Without dead ends: 213 [2018-09-26 08:27:15,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-09-26 08:27:15,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-09-26 08:27:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-09-26 08:27:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 08:27:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-09-26 08:27:15,387 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 211 [2018-09-26 08:27:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:15,388 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-09-26 08:27:15,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 211 states. [2018-09-26 08:27:15,388 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-09-26 08:27:15,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-26 08:27:15,388 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:15,388 INFO L375 BasicCegarLoop]: trace histogram [209, 1, 1, 1] [2018-09-26 08:27:15,389 INFO L423 AbstractCegarLoop]: === Iteration 210 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:15,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:15,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1326696058, now seen corresponding path program 209 times [2018-09-26 08:27:15,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:17,295 INFO L134 CoverageAnalysis]: Checked inductivity of 21945 backedges. 0 proven. 21945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:17,296 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:17,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [211] total 211 [2018-09-26 08:27:17,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 212 states [2018-09-26 08:27:17,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2018-09-26 08:27:17,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-09-26 08:27:17,302 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 212 states. [2018-09-26 08:27:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:18,006 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-09-26 08:27:18,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-09-26 08:27:18,006 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 212 [2018-09-26 08:27:18,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:18,007 INFO L225 Difference]: With dead ends: 216 [2018-09-26 08:27:18,007 INFO L226 Difference]: Without dead ends: 214 [2018-09-26 08:27:18,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-09-26 08:27:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-26 08:27:18,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-09-26 08:27:18,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-09-26 08:27:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2018-09-26 08:27:18,012 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 212 [2018-09-26 08:27:18,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:18,012 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2018-09-26 08:27:18,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 212 states. [2018-09-26 08:27:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2018-09-26 08:27:18,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-26 08:27:18,013 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:18,013 INFO L375 BasicCegarLoop]: trace histogram [210, 1, 1, 1] [2018-09-26 08:27:18,013 INFO L423 AbstractCegarLoop]: === Iteration 211 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:18,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:18,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1822091296, now seen corresponding path program 210 times [2018-09-26 08:27:18,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 22155 backedges. 0 proven. 22155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:19,696 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:19,696 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [212] total 212 [2018-09-26 08:27:19,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 213 states [2018-09-26 08:27:19,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 213 interpolants. [2018-09-26 08:27:19,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-09-26 08:27:19,701 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 213 states. [2018-09-26 08:27:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:20,884 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-09-26 08:27:20,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-09-26 08:27:20,884 INFO L78 Accepts]: Start accepts. Automaton has 213 states. Word has length 213 [2018-09-26 08:27:20,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:20,885 INFO L225 Difference]: With dead ends: 217 [2018-09-26 08:27:20,885 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 08:27:20,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-09-26 08:27:20,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 08:27:20,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-09-26 08:27:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-09-26 08:27:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-09-26 08:27:20,889 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 213 [2018-09-26 08:27:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:20,889 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-09-26 08:27:20,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 213 states. [2018-09-26 08:27:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-09-26 08:27:20,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-26 08:27:20,890 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:20,890 INFO L375 BasicCegarLoop]: trace histogram [211, 1, 1, 1] [2018-09-26 08:27:20,890 INFO L423 AbstractCegarLoop]: === Iteration 212 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:20,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:20,891 INFO L82 PathProgramCache]: Analyzing trace with hash 650251462, now seen corresponding path program 211 times [2018-09-26 08:27:20,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 22366 backedges. 0 proven. 22366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:22,824 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:22,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [213] total 213 [2018-09-26 08:27:22,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 214 states [2018-09-26 08:27:22,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2018-09-26 08:27:22,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-09-26 08:27:22,831 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 214 states. [2018-09-26 08:27:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:24,481 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-09-26 08:27:24,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-09-26 08:27:24,482 INFO L78 Accepts]: Start accepts. Automaton has 214 states. Word has length 214 [2018-09-26 08:27:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:24,482 INFO L225 Difference]: With dead ends: 218 [2018-09-26 08:27:24,482 INFO L226 Difference]: Without dead ends: 216 [2018-09-26 08:27:24,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-09-26 08:27:24,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-09-26 08:27:24,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-09-26 08:27:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-09-26 08:27:24,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-09-26 08:27:24,489 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 214 [2018-09-26 08:27:24,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:24,489 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-09-26 08:27:24,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 214 states. [2018-09-26 08:27:24,489 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-09-26 08:27:24,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-09-26 08:27:24,489 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:24,490 INFO L375 BasicCegarLoop]: trace histogram [212, 1, 1, 1] [2018-09-26 08:27:24,490 INFO L423 AbstractCegarLoop]: === Iteration 213 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:24,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:24,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1317045024, now seen corresponding path program 212 times [2018-09-26 08:27:24,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 22578 backedges. 0 proven. 22578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:26,179 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:26,180 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [214] total 214 [2018-09-26 08:27:26,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 215 states [2018-09-26 08:27:26,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 215 interpolants. [2018-09-26 08:27:26,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-09-26 08:27:26,186 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 215 states. [2018-09-26 08:27:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:27,205 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-09-26 08:27:27,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-09-26 08:27:27,205 INFO L78 Accepts]: Start accepts. Automaton has 215 states. Word has length 215 [2018-09-26 08:27:27,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:27,206 INFO L225 Difference]: With dead ends: 219 [2018-09-26 08:27:27,206 INFO L226 Difference]: Without dead ends: 217 [2018-09-26 08:27:27,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-09-26 08:27:27,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-09-26 08:27:27,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-09-26 08:27:27,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-26 08:27:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-09-26 08:27:27,212 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 215 [2018-09-26 08:27:27,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:27,212 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-09-26 08:27:27,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 215 states. [2018-09-26 08:27:27,213 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-09-26 08:27:27,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-26 08:27:27,213 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:27,213 INFO L375 BasicCegarLoop]: trace histogram [213, 1, 1, 1] [2018-09-26 08:27:27,213 INFO L423 AbstractCegarLoop]: === Iteration 214 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:27,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:27,214 INFO L82 PathProgramCache]: Analyzing trace with hash 2121273350, now seen corresponding path program 213 times [2018-09-26 08:27:27,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22791 backedges. 0 proven. 22791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:29,264 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:29,265 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [215] total 215 [2018-09-26 08:27:29,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 216 states [2018-09-26 08:27:29,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2018-09-26 08:27:29,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-09-26 08:27:29,268 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 216 states. [2018-09-26 08:27:29,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:29,666 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-09-26 08:27:29,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-09-26 08:27:29,666 INFO L78 Accepts]: Start accepts. Automaton has 216 states. Word has length 216 [2018-09-26 08:27:29,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:29,667 INFO L225 Difference]: With dead ends: 220 [2018-09-26 08:27:29,667 INFO L226 Difference]: Without dead ends: 218 [2018-09-26 08:27:29,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-09-26 08:27:29,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-26 08:27:29,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-09-26 08:27:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-09-26 08:27:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-09-26 08:27:29,671 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 216 [2018-09-26 08:27:29,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:29,671 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-09-26 08:27:29,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 216 states. [2018-09-26 08:27:29,671 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-09-26 08:27:29,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-26 08:27:29,672 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:29,672 INFO L375 BasicCegarLoop]: trace histogram [214, 1, 1, 1] [2018-09-26 08:27:29,672 INFO L423 AbstractCegarLoop]: === Iteration 215 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:29,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:29,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1334960544, now seen corresponding path program 214 times [2018-09-26 08:27:29,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 23005 backedges. 0 proven. 23005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:31,543 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:31,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [216] total 216 [2018-09-26 08:27:31,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 217 states [2018-09-26 08:27:31,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 217 interpolants. [2018-09-26 08:27:31,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-09-26 08:27:31,551 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 217 states. [2018-09-26 08:27:32,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:32,488 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-09-26 08:27:32,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-09-26 08:27:32,488 INFO L78 Accepts]: Start accepts. Automaton has 217 states. Word has length 217 [2018-09-26 08:27:32,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:32,488 INFO L225 Difference]: With dead ends: 221 [2018-09-26 08:27:32,488 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:27:32,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-09-26 08:27:32,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:27:32,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-09-26 08:27:32,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-09-26 08:27:32,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-09-26 08:27:32,494 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 217 [2018-09-26 08:27:32,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:32,494 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-09-26 08:27:32,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 217 states. [2018-09-26 08:27:32,494 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-09-26 08:27:32,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-26 08:27:32,495 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:32,495 INFO L375 BasicCegarLoop]: trace histogram [215, 1, 1, 1] [2018-09-26 08:27:32,495 INFO L423 AbstractCegarLoop]: === Iteration 216 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:32,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:32,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1565899962, now seen corresponding path program 215 times [2018-09-26 08:27:32,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 23220 backedges. 0 proven. 23220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:34,448 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:34,448 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [217] total 217 [2018-09-26 08:27:34,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 218 states [2018-09-26 08:27:34,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 218 interpolants. [2018-09-26 08:27:34,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-09-26 08:27:34,454 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 218 states. [2018-09-26 08:27:36,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:36,254 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-09-26 08:27:36,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-09-26 08:27:36,255 INFO L78 Accepts]: Start accepts. Automaton has 218 states. Word has length 218 [2018-09-26 08:27:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:36,255 INFO L225 Difference]: With dead ends: 222 [2018-09-26 08:27:36,255 INFO L226 Difference]: Without dead ends: 220 [2018-09-26 08:27:36,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-09-26 08:27:36,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-09-26 08:27:36,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-09-26 08:27:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-09-26 08:27:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-09-26 08:27:36,260 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 218 [2018-09-26 08:27:36,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:36,260 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-09-26 08:27:36,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 218 states. [2018-09-26 08:27:36,260 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-09-26 08:27:36,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-09-26 08:27:36,261 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:36,261 INFO L375 BasicCegarLoop]: trace histogram [216, 1, 1, 1] [2018-09-26 08:27:36,261 INFO L423 AbstractCegarLoop]: === Iteration 217 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:36,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:36,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1298262432, now seen corresponding path program 216 times [2018-09-26 08:27:36,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:38,041 INFO L134 CoverageAnalysis]: Checked inductivity of 23436 backedges. 0 proven. 23436 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:38,042 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:38,042 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [218] total 218 [2018-09-26 08:27:38,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 219 states [2018-09-26 08:27:38,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2018-09-26 08:27:38,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-09-26 08:27:38,047 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 219 states. [2018-09-26 08:27:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:38,942 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-09-26 08:27:38,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-09-26 08:27:38,942 INFO L78 Accepts]: Start accepts. Automaton has 219 states. Word has length 219 [2018-09-26 08:27:38,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:38,942 INFO L225 Difference]: With dead ends: 223 [2018-09-26 08:27:38,943 INFO L226 Difference]: Without dead ends: 221 [2018-09-26 08:27:38,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-09-26 08:27:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-26 08:27:38,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-09-26 08:27:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 08:27:38,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-26 08:27:38,948 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 219 [2018-09-26 08:27:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:38,948 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-26 08:27:38,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 219 states. [2018-09-26 08:27:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-26 08:27:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 08:27:38,949 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:38,949 INFO L375 BasicCegarLoop]: trace histogram [217, 1, 1, 1] [2018-09-26 08:27:38,949 INFO L423 AbstractCegarLoop]: === Iteration 218 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:38,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:38,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1591433594, now seen corresponding path program 217 times [2018-09-26 08:27:38,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:40,771 INFO L134 CoverageAnalysis]: Checked inductivity of 23653 backedges. 0 proven. 23653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:40,772 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:40,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [219] total 219 [2018-09-26 08:27:40,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 220 states [2018-09-26 08:27:40,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 220 interpolants. [2018-09-26 08:27:40,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-09-26 08:27:40,778 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 220 states. [2018-09-26 08:27:41,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:41,680 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-09-26 08:27:41,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-09-26 08:27:41,680 INFO L78 Accepts]: Start accepts. Automaton has 220 states. Word has length 220 [2018-09-26 08:27:41,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:41,680 INFO L225 Difference]: With dead ends: 224 [2018-09-26 08:27:41,681 INFO L226 Difference]: Without dead ends: 222 [2018-09-26 08:27:41,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-09-26 08:27:41,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-09-26 08:27:41,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-09-26 08:27:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-09-26 08:27:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-09-26 08:27:41,686 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 220 [2018-09-26 08:27:41,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:41,686 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-09-26 08:27:41,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 220 states. [2018-09-26 08:27:41,686 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-09-26 08:27:41,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-09-26 08:27:41,687 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:41,687 INFO L375 BasicCegarLoop]: trace histogram [218, 1, 1, 1] [2018-09-26 08:27:41,687 INFO L423 AbstractCegarLoop]: === Iteration 219 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:41,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:41,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2089805024, now seen corresponding path program 218 times [2018-09-26 08:27:41,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 23871 backedges. 0 proven. 23871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:43,640 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:43,640 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [220] total 220 [2018-09-26 08:27:43,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 221 states [2018-09-26 08:27:43,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 221 interpolants. [2018-09-26 08:27:43,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24310, Invalid=24310, Unknown=0, NotChecked=0, Total=48620 [2018-09-26 08:27:43,645 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 221 states. [2018-09-26 08:27:45,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:45,402 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-09-26 08:27:45,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-09-26 08:27:45,402 INFO L78 Accepts]: Start accepts. Automaton has 221 states. Word has length 221 [2018-09-26 08:27:45,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:45,403 INFO L225 Difference]: With dead ends: 225 [2018-09-26 08:27:45,403 INFO L226 Difference]: Without dead ends: 223 [2018-09-26 08:27:45,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=24310, Invalid=24310, Unknown=0, NotChecked=0, Total=48620 [2018-09-26 08:27:45,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-26 08:27:45,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-09-26 08:27:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-09-26 08:27:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-09-26 08:27:45,408 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 221 [2018-09-26 08:27:45,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:45,408 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-09-26 08:27:45,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 221 states. [2018-09-26 08:27:45,408 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-09-26 08:27:45,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-26 08:27:45,409 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:45,409 INFO L375 BasicCegarLoop]: trace histogram [219, 1, 1, 1] [2018-09-26 08:27:45,409 INFO L423 AbstractCegarLoop]: === Iteration 220 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:45,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:45,409 INFO L82 PathProgramCache]: Analyzing trace with hash -359450170, now seen corresponding path program 219 times [2018-09-26 08:27:45,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 24090 backedges. 0 proven. 24090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:47,557 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:47,557 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [221] total 221 [2018-09-26 08:27:47,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 222 states [2018-09-26 08:27:47,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 222 interpolants. [2018-09-26 08:27:47,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-09-26 08:27:47,564 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 222 states. [2018-09-26 08:27:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:48,152 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-09-26 08:27:48,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2018-09-26 08:27:48,152 INFO L78 Accepts]: Start accepts. Automaton has 222 states. Word has length 222 [2018-09-26 08:27:48,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:48,153 INFO L225 Difference]: With dead ends: 226 [2018-09-26 08:27:48,153 INFO L226 Difference]: Without dead ends: 224 [2018-09-26 08:27:48,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-09-26 08:27:48,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-09-26 08:27:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-09-26 08:27:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-09-26 08:27:48,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-09-26 08:27:48,161 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 222 [2018-09-26 08:27:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:48,161 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-09-26 08:27:48,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 222 states. [2018-09-26 08:27:48,161 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-09-26 08:27:48,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-26 08:27:48,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:48,162 INFO L375 BasicCegarLoop]: trace histogram [220, 1, 1, 1] [2018-09-26 08:27:48,162 INFO L423 AbstractCegarLoop]: === Iteration 221 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:48,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:48,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1741942752, now seen corresponding path program 220 times [2018-09-26 08:27:48,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 24310 backedges. 0 proven. 24310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:50,388 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:50,388 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [222] total 222 [2018-09-26 08:27:50,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 223 states [2018-09-26 08:27:50,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 223 interpolants. [2018-09-26 08:27:50,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24753, Invalid=24753, Unknown=0, NotChecked=0, Total=49506 [2018-09-26 08:27:50,394 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 223 states. [2018-09-26 08:27:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:51,386 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-09-26 08:27:51,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2018-09-26 08:27:51,386 INFO L78 Accepts]: Start accepts. Automaton has 223 states. Word has length 223 [2018-09-26 08:27:51,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:51,387 INFO L225 Difference]: With dead ends: 227 [2018-09-26 08:27:51,387 INFO L226 Difference]: Without dead ends: 225 [2018-09-26 08:27:51,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=24753, Invalid=24753, Unknown=0, NotChecked=0, Total=49506 [2018-09-26 08:27:51,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-26 08:27:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-09-26 08:27:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-26 08:27:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-09-26 08:27:51,392 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 223 [2018-09-26 08:27:51,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:51,392 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-09-26 08:27:51,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 223 states. [2018-09-26 08:27:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-09-26 08:27:51,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-26 08:27:51,393 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:51,393 INFO L375 BasicCegarLoop]: trace histogram [221, 1, 1, 1] [2018-09-26 08:27:51,393 INFO L423 AbstractCegarLoop]: === Iteration 222 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:51,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:51,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1834353402, now seen corresponding path program 221 times [2018-09-26 08:27:51,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 24531 backedges. 0 proven. 24531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:53,546 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:53,547 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [223] total 223 [2018-09-26 08:27:53,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 224 states [2018-09-26 08:27:53,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 224 interpolants. [2018-09-26 08:27:53,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-09-26 08:27:53,551 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 224 states. [2018-09-26 08:27:54,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:54,974 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-09-26 08:27:54,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2018-09-26 08:27:54,974 INFO L78 Accepts]: Start accepts. Automaton has 224 states. Word has length 224 [2018-09-26 08:27:54,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:54,975 INFO L225 Difference]: With dead ends: 228 [2018-09-26 08:27:54,975 INFO L226 Difference]: Without dead ends: 226 [2018-09-26 08:27:54,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-09-26 08:27:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-26 08:27:54,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-09-26 08:27:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-09-26 08:27:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-09-26 08:27:54,979 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 224 [2018-09-26 08:27:54,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:54,979 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-09-26 08:27:54,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 224 states. [2018-09-26 08:27:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-09-26 08:27:54,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-26 08:27:54,980 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:54,980 INFO L375 BasicCegarLoop]: trace histogram [222, 1, 1, 1] [2018-09-26 08:27:54,980 INFO L423 AbstractCegarLoop]: === Iteration 223 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:54,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:54,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1030384480, now seen corresponding path program 222 times [2018-09-26 08:27:54,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 24753 backedges. 0 proven. 24753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:57,004 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:57,004 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [224] total 224 [2018-09-26 08:27:57,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 225 states [2018-09-26 08:27:57,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 225 interpolants. [2018-09-26 08:27:57,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25200, Invalid=25200, Unknown=0, NotChecked=0, Total=50400 [2018-09-26 08:27:57,013 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 225 states. [2018-09-26 08:27:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:57,942 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-09-26 08:27:57,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2018-09-26 08:27:57,942 INFO L78 Accepts]: Start accepts. Automaton has 225 states. Word has length 225 [2018-09-26 08:27:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:57,943 INFO L225 Difference]: With dead ends: 229 [2018-09-26 08:27:57,943 INFO L226 Difference]: Without dead ends: 227 [2018-09-26 08:27:57,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=25200, Invalid=25200, Unknown=0, NotChecked=0, Total=50400 [2018-09-26 08:27:57,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-26 08:27:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-09-26 08:27:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-26 08:27:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-09-26 08:27:57,948 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 225 [2018-09-26 08:27:57,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:57,949 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-09-26 08:27:57,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 225 states. [2018-09-26 08:27:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-09-26 08:27:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-26 08:27:57,949 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:57,949 INFO L375 BasicCegarLoop]: trace histogram [223, 1, 1, 1] [2018-09-26 08:27:57,950 INFO L423 AbstractCegarLoop]: === Iteration 224 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:57,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:57,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1877151674, now seen corresponding path program 223 times [2018-09-26 08:27:57,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 24976 backedges. 0 proven. 24976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:59,924 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:59,925 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [225] total 225 [2018-09-26 08:27:59,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 226 states [2018-09-26 08:27:59,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 226 interpolants. [2018-09-26 08:27:59,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-09-26 08:27:59,931 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 226 states. [2018-09-26 08:28:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:01,534 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-09-26 08:28:01,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2018-09-26 08:28:01,534 INFO L78 Accepts]: Start accepts. Automaton has 226 states. Word has length 226 [2018-09-26 08:28:01,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:01,534 INFO L225 Difference]: With dead ends: 230 [2018-09-26 08:28:01,534 INFO L226 Difference]: Without dead ends: 228 [2018-09-26 08:28:01,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-09-26 08:28:01,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-09-26 08:28:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-09-26 08:28:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-09-26 08:28:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-09-26 08:28:01,539 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 226 [2018-09-26 08:28:01,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:01,540 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-09-26 08:28:01,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 226 states. [2018-09-26 08:28:01,540 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-09-26 08:28:01,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-09-26 08:28:01,540 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:01,540 INFO L375 BasicCegarLoop]: trace histogram [224, 1, 1, 1] [2018-09-26 08:28:01,541 INFO L423 AbstractCegarLoop]: === Iteration 225 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:01,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:01,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1937836384, now seen corresponding path program 224 times [2018-09-26 08:28:01,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 25200 backedges. 0 proven. 25200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:03,580 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:03,580 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [226] total 226 [2018-09-26 08:28:03,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 227 states [2018-09-26 08:28:03,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 227 interpolants. [2018-09-26 08:28:03,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25651, Invalid=25651, Unknown=0, NotChecked=0, Total=51302 [2018-09-26 08:28:03,585 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 227 states. [2018-09-26 08:28:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:04,068 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-09-26 08:28:04,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2018-09-26 08:28:04,068 INFO L78 Accepts]: Start accepts. Automaton has 227 states. Word has length 227 [2018-09-26 08:28:04,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:04,068 INFO L225 Difference]: With dead ends: 231 [2018-09-26 08:28:04,069 INFO L226 Difference]: Without dead ends: 229 [2018-09-26 08:28:04,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=25651, Invalid=25651, Unknown=0, NotChecked=0, Total=51302 [2018-09-26 08:28:04,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-26 08:28:04,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-09-26 08:28:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-26 08:28:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-09-26 08:28:04,073 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 227 [2018-09-26 08:28:04,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:04,074 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-09-26 08:28:04,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 227 states. [2018-09-26 08:28:04,074 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-09-26 08:28:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-26 08:28:04,074 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:04,074 INFO L375 BasicCegarLoop]: trace histogram [225, 1, 1, 1] [2018-09-26 08:28:04,074 INFO L423 AbstractCegarLoop]: === Iteration 226 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:04,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:04,075 INFO L82 PathProgramCache]: Analyzing trace with hash -56618106, now seen corresponding path program 225 times [2018-09-26 08:28:04,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 25425 backedges. 0 proven. 25425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:06,035 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:06,035 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [227] total 227 [2018-09-26 08:28:06,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 228 states [2018-09-26 08:28:06,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 228 interpolants. [2018-09-26 08:28:06,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-09-26 08:28:06,042 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 228 states. [2018-09-26 08:28:07,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:07,740 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-09-26 08:28:07,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2018-09-26 08:28:07,740 INFO L78 Accepts]: Start accepts. Automaton has 228 states. Word has length 228 [2018-09-26 08:28:07,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:07,741 INFO L225 Difference]: With dead ends: 232 [2018-09-26 08:28:07,741 INFO L226 Difference]: Without dead ends: 230 [2018-09-26 08:28:07,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-09-26 08:28:07,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-26 08:28:07,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-09-26 08:28:07,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-09-26 08:28:07,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-09-26 08:28:07,746 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 228 [2018-09-26 08:28:07,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:07,747 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-09-26 08:28:07,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 228 states. [2018-09-26 08:28:07,747 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-09-26 08:28:07,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-09-26 08:28:07,747 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:07,747 INFO L375 BasicCegarLoop]: trace histogram [226, 1, 1, 1] [2018-09-26 08:28:07,747 INFO L423 AbstractCegarLoop]: === Iteration 227 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:07,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:07,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1755165152, now seen corresponding path program 226 times [2018-09-26 08:28:07,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 25651 backedges. 0 proven. 25651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:09,911 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:09,912 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [228] total 228 [2018-09-26 08:28:09,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 229 states [2018-09-26 08:28:09,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 229 interpolants. [2018-09-26 08:28:09,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26106, Invalid=26106, Unknown=0, NotChecked=0, Total=52212 [2018-09-26 08:28:09,918 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 229 states. [2018-09-26 08:28:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:11,228 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-09-26 08:28:11,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2018-09-26 08:28:11,228 INFO L78 Accepts]: Start accepts. Automaton has 229 states. Word has length 229 [2018-09-26 08:28:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:11,229 INFO L225 Difference]: With dead ends: 233 [2018-09-26 08:28:11,229 INFO L226 Difference]: Without dead ends: 231 [2018-09-26 08:28:11,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=26106, Invalid=26106, Unknown=0, NotChecked=0, Total=52212 [2018-09-26 08:28:11,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-09-26 08:28:11,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-09-26 08:28:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-26 08:28:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-09-26 08:28:11,236 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 229 [2018-09-26 08:28:11,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:11,236 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-09-26 08:28:11,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 229 states. [2018-09-26 08:28:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-09-26 08:28:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-26 08:28:11,237 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:11,237 INFO L375 BasicCegarLoop]: trace histogram [227, 1, 1, 1] [2018-09-26 08:28:11,237 INFO L423 AbstractCegarLoop]: === Iteration 228 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:11,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:11,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1424451270, now seen corresponding path program 227 times [2018-09-26 08:28:11,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 25878 backedges. 0 proven. 25878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:13,609 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:13,609 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [229] total 229 [2018-09-26 08:28:13,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 230 states [2018-09-26 08:28:13,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 230 interpolants. [2018-09-26 08:28:13,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26335, Invalid=26335, Unknown=0, NotChecked=0, Total=52670 [2018-09-26 08:28:13,615 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 230 states. [2018-09-26 08:28:15,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:15,623 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-09-26 08:28:15,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2018-09-26 08:28:15,623 INFO L78 Accepts]: Start accepts. Automaton has 230 states. Word has length 230 [2018-09-26 08:28:15,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:15,624 INFO L225 Difference]: With dead ends: 234 [2018-09-26 08:28:15,624 INFO L226 Difference]: Without dead ends: 232 [2018-09-26 08:28:15,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=26335, Invalid=26335, Unknown=0, NotChecked=0, Total=52670 [2018-09-26 08:28:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-09-26 08:28:15,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-09-26 08:28:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-09-26 08:28:15,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-09-26 08:28:15,630 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 230 [2018-09-26 08:28:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:15,630 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-09-26 08:28:15,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 230 states. [2018-09-26 08:28:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-09-26 08:28:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-09-26 08:28:15,631 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:15,631 INFO L375 BasicCegarLoop]: trace histogram [228, 1, 1, 1] [2018-09-26 08:28:15,631 INFO L423 AbstractCegarLoop]: === Iteration 229 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:15,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:15,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1208312544, now seen corresponding path program 228 times [2018-09-26 08:28:15,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:18,096 INFO L134 CoverageAnalysis]: Checked inductivity of 26106 backedges. 0 proven. 26106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:18,096 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:18,096 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [230] total 230 [2018-09-26 08:28:18,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 231 states [2018-09-26 08:28:18,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 231 interpolants. [2018-09-26 08:28:18,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26565, Invalid=26565, Unknown=0, NotChecked=0, Total=53130 [2018-09-26 08:28:18,103 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 231 states. [2018-09-26 08:28:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:18,634 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-26 08:28:18,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2018-09-26 08:28:18,634 INFO L78 Accepts]: Start accepts. Automaton has 231 states. Word has length 231 [2018-09-26 08:28:18,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:18,634 INFO L225 Difference]: With dead ends: 235 [2018-09-26 08:28:18,634 INFO L226 Difference]: Without dead ends: 233 [2018-09-26 08:28:18,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=26565, Invalid=26565, Unknown=0, NotChecked=0, Total=53130 [2018-09-26 08:28:18,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-09-26 08:28:18,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-09-26 08:28:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-26 08:28:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-09-26 08:28:18,641 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 231 [2018-09-26 08:28:18,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:18,641 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-09-26 08:28:18,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 231 states. [2018-09-26 08:28:18,641 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-09-26 08:28:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-26 08:28:18,642 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:18,642 INFO L375 BasicCegarLoop]: trace histogram [229, 1, 1, 1] [2018-09-26 08:28:18,642 INFO L423 AbstractCegarLoop]: === Iteration 230 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:18,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:18,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1197020666, now seen corresponding path program 229 times [2018-09-26 08:28:18,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:20,922 INFO L134 CoverageAnalysis]: Checked inductivity of 26335 backedges. 0 proven. 26335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:20,922 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:20,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [231] total 231 [2018-09-26 08:28:20,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 232 states [2018-09-26 08:28:20,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 232 interpolants. [2018-09-26 08:28:20,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26796, Invalid=26796, Unknown=0, NotChecked=0, Total=53592 [2018-09-26 08:28:20,930 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 232 states. [2018-09-26 08:28:22,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:22,764 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-09-26 08:28:22,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2018-09-26 08:28:22,764 INFO L78 Accepts]: Start accepts. Automaton has 232 states. Word has length 232 [2018-09-26 08:28:22,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:22,765 INFO L225 Difference]: With dead ends: 236 [2018-09-26 08:28:22,765 INFO L226 Difference]: Without dead ends: 234 [2018-09-26 08:28:22,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=26796, Invalid=26796, Unknown=0, NotChecked=0, Total=53592 [2018-09-26 08:28:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-26 08:28:22,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-09-26 08:28:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-09-26 08:28:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-09-26 08:28:22,773 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 232 [2018-09-26 08:28:22,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:22,773 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-09-26 08:28:22,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 232 states. [2018-09-26 08:28:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-09-26 08:28:22,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-09-26 08:28:22,774 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:22,774 INFO L375 BasicCegarLoop]: trace histogram [230, 1, 1, 1] [2018-09-26 08:28:22,774 INFO L423 AbstractCegarLoop]: === Iteration 231 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:22,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:22,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1547061152, now seen corresponding path program 230 times [2018-09-26 08:28:22,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 26565 backedges. 0 proven. 26565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:25,029 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:25,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [232] total 232 [2018-09-26 08:28:25,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 233 states [2018-09-26 08:28:25,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 233 interpolants. [2018-09-26 08:28:25,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27028, Invalid=27028, Unknown=0, NotChecked=0, Total=54056 [2018-09-26 08:28:25,034 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 233 states. [2018-09-26 08:28:26,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:26,196 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-09-26 08:28:26,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2018-09-26 08:28:26,196 INFO L78 Accepts]: Start accepts. Automaton has 233 states. Word has length 233 [2018-09-26 08:28:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:26,197 INFO L225 Difference]: With dead ends: 237 [2018-09-26 08:28:26,197 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 08:28:26,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=27028, Invalid=27028, Unknown=0, NotChecked=0, Total=54056 [2018-09-26 08:28:26,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 08:28:26,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-09-26 08:28:26,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-26 08:28:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-09-26 08:28:26,202 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 233 [2018-09-26 08:28:26,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:26,203 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-09-26 08:28:26,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 233 states. [2018-09-26 08:28:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-09-26 08:28:26,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-26 08:28:26,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:26,203 INFO L375 BasicCegarLoop]: trace histogram [231, 1, 1, 1] [2018-09-26 08:28:26,204 INFO L423 AbstractCegarLoop]: === Iteration 232 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:26,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:26,204 INFO L82 PathProgramCache]: Analyzing trace with hash 714251590, now seen corresponding path program 231 times [2018-09-26 08:28:26,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-26 08:28:26,726 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:28:26,730 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:28:26,730 INFO L202 PluginConnector]: Adding new model LuxembourgOctopus.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:28:26 BoogieIcfgContainer [2018-09-26 08:28:26,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:28:26,731 INFO L168 Benchmark]: Toolchain (without parser) took 258764.23 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -160.1 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-09-26 08:28:26,732 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.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:28:26,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.85 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:28:26,733 INFO L168 Benchmark]: Boogie Preprocessor took 22.70 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:28:26,733 INFO L168 Benchmark]: RCFGBuilder took 249.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:28:26,734 INFO L168 Benchmark]: TraceAbstraction took 258441.54 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -170.7 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-09-26 08:28:26,736 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.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. * Boogie Procedure Inliner took 43.85 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 22.70 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 249.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 258441.54 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -170.7 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 25]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 25). Cancelled while BasicCegarLoop was analyzing trace of length 235 with TraceHistMax 231, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 258.3s OverallTime, 232 OverallIterations, 231 TraceHistogramMax, 78.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 695 SDtfs, 2 SDslu, 14726 SDs, 0 SdLazy, 41753 SolverSat, 422 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27027 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 26796 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 140.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235occurred in iteration=231, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 231 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 22.9s SatisfiabilityAnalysisTime, 149.5s InterpolantComputationTime, 27258 NumberOfCodeBlocks, 27258 NumberOfCodeBlocksAsserted, 231 NumberOfCheckSat, 27027 ConstructedInterpolants, 0 QuantifiedInterpolants, 20784533 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 231 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2054360 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/LuxembourgOctopus.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-28-26-746.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/LuxembourgOctopus.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-28-26-746.csv Completed graceful shutdown